
(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 19 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 (+ 2.0 (+ beta alpha))))
(if (<= beta 4.5e+49)
(/ (/ (/ (+ (+ (* beta alpha) (+ beta alpha)) 1.0) t_0) t_0) (+ 1.0 t_0))
(/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 3.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 4.5e+49) {
tmp = (((((beta * alpha) + (beta + alpha)) + 1.0) / t_0) / t_0) / (1.0 + t_0);
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
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 <= 4.5d+49) then
tmp = (((((beta * alpha) + (beta + alpha)) + 1.0d0) / t_0) / t_0) / (1.0d0 + t_0)
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (3.0d0 + (beta + alpha))
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 <= 4.5e+49) {
tmp = (((((beta * alpha) + (beta + alpha)) + 1.0) / t_0) / t_0) / (1.0 + t_0);
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 4.5e+49: tmp = (((((beta * alpha) + (beta + alpha)) + 1.0) / t_0) / t_0) / (1.0 + t_0) else: tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 4.5e+49) tmp = Float64(Float64(Float64(Float64(Float64(Float64(beta * alpha) + Float64(beta + alpha)) + 1.0) / t_0) / t_0) / Float64(1.0 + t_0)); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(3.0 + Float64(beta + alpha))); 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 <= 4.5e+49)
tmp = (((((beta * alpha) + (beta + alpha)) + 1.0) / t_0) / t_0) / (1.0 + t_0);
else
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
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, 4.5e+49], N[(N[(N[(N[(N[(N[(beta * alpha), $MachinePrecision] + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $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 4.5 \cdot 10^{+49}:\\
\;\;\;\;\frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) + 1}{t\_0}}{t\_0}}{1 + t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 4.49999999999999982e49Initial program 99.9%
if 4.49999999999999982e49 < beta Initial program 79.7%
Taylor expanded in beta around inf 87.8%
Taylor expanded in alpha around 0 87.8%
+-commutative87.8%
Simplified87.8%
Taylor expanded in alpha around 0 87.8%
Final simplification96.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))) (t_1 (+ 3.0 (+ beta alpha))))
(if (<= beta 2e+49)
(/ 1.0 (* t_0 (/ (* t_1 t_0) (* (+ beta 1.0) (+ alpha 1.0)))))
(/ (+ (/ 1.0 beta) (/ alpha beta)) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = 3.0 + (beta + alpha);
double tmp;
if (beta <= 2e+49) {
tmp = 1.0 / (t_0 * ((t_1 * t_0) / ((beta + 1.0) * (alpha + 1.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / t_1;
}
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 = 2.0d0 + (beta + alpha)
t_1 = 3.0d0 + (beta + alpha)
if (beta <= 2d+49) then
tmp = 1.0d0 / (t_0 * ((t_1 * t_0) / ((beta + 1.0d0) * (alpha + 1.0d0))))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / t_1
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 t_1 = 3.0 + (beta + alpha);
double tmp;
if (beta <= 2e+49) {
tmp = 1.0 / (t_0 * ((t_1 * t_0) / ((beta + 1.0) * (alpha + 1.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) t_1 = 3.0 + (beta + alpha) tmp = 0 if beta <= 2e+49: tmp = 1.0 / (t_0 * ((t_1 * t_0) / ((beta + 1.0) * (alpha + 1.0)))) else: tmp = ((1.0 / beta) + (alpha / beta)) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) t_1 = Float64(3.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 2e+49) tmp = Float64(1.0 / Float64(t_0 * Float64(Float64(t_1 * t_0) / Float64(Float64(beta + 1.0) * Float64(alpha + 1.0))))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
t_1 = 3.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 2e+49)
tmp = 1.0 / (t_0 * ((t_1 * t_0) / ((beta + 1.0) * (alpha + 1.0))));
else
tmp = ((1.0 / beta) + (alpha / beta)) / t_1;
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]}, Block[{t$95$1 = N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+49], N[(1.0 / N[(t$95$0 * N[(N[(t$95$1 * t$95$0), $MachinePrecision] / N[(N[(beta + 1.0), $MachinePrecision] * N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
t_1 := 3 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+49}:\\
\;\;\;\;\frac{1}{t\_0 \cdot \frac{t\_1 \cdot t\_0}{\left(\beta + 1\right) \cdot \left(\alpha + 1\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{t\_1}\\
\end{array}
\end{array}
if beta < 1.99999999999999989e49Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
clear-num99.8%
inv-pow99.8%
*-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
distribute-rgt1-in99.8%
fma-define99.8%
Applied egg-rr99.8%
unpow-199.8%
associate-/r/99.8%
Simplified99.8%
if 1.99999999999999989e49 < beta Initial program 79.7%
Taylor expanded in beta around inf 87.8%
Taylor expanded in alpha around 0 87.8%
+-commutative87.8%
Simplified87.8%
Taylor expanded in alpha around 0 87.8%
Final simplification96.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 4.6e+49)
(* (/ (+ alpha 1.0) t_0) (/ (+ beta 1.0) (* t_0 (+ alpha (+ beta 3.0)))))
(/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 3.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4.6e+49) {
tmp = ((alpha + 1.0) / t_0) * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
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 <= 4.6d+49) then
tmp = ((alpha + 1.0d0) / t_0) * ((beta + 1.0d0) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (3.0d0 + (beta + alpha))
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 <= 4.6e+49) {
tmp = ((alpha + 1.0) / t_0) * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 4.6e+49: tmp = ((alpha + 1.0) / t_0) * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 4.6e+49) tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(3.0 + Float64(beta + alpha))); 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 <= 4.6e+49)
tmp = ((alpha + 1.0) / t_0) * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
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, 4.6e+49], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $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 4.6 \cdot 10^{+49}:\\
\;\;\;\;\frac{\alpha + 1}{t\_0} \cdot \frac{\beta + 1}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 4.60000000000000004e49Initial program 99.9%
Simplified95.6%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
if 4.60000000000000004e49 < beta Initial program 79.7%
Taylor expanded in beta around inf 87.8%
Taylor expanded in alpha around 0 87.8%
+-commutative87.8%
Simplified87.8%
Taylor expanded in alpha around 0 87.8%
Final simplification96.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.75e+17) (* (/ 1.0 (+ beta 2.0)) (/ (+ beta 1.0) (+ 6.0 (* beta (+ beta 5.0))))) (/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 3.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.75e+17) {
tmp = (1.0 / (beta + 2.0)) * ((beta + 1.0) / (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
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.75d+17) then
tmp = (1.0d0 / (beta + 2.0d0)) * ((beta + 1.0d0) / (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.75e+17) {
tmp = (1.0 / (beta + 2.0)) * ((beta + 1.0) / (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.75e+17: tmp = (1.0 / (beta + 2.0)) * ((beta + 1.0) / (6.0 + (beta * (beta + 5.0)))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.75e+17) tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) * Float64(Float64(beta + 1.0) / Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.75e+17)
tmp = (1.0 / (beta + 2.0)) * ((beta + 1.0) / (6.0 + (beta * (beta + 5.0))));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
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.75e+17], N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.75 \cdot 10^{+17}:\\
\;\;\;\;\frac{1}{\beta + 2} \cdot \frac{\beta + 1}{6 + \beta \cdot \left(\beta + 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 1.75e17Initial program 99.9%
Simplified95.9%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 67.3%
+-commutative67.3%
+-commutative67.3%
Simplified67.3%
Taylor expanded in beta around 0 67.3%
+-commutative67.3%
Simplified67.3%
Taylor expanded in alpha around 0 67.3%
if 1.75e17 < beta Initial program 82.6%
Taylor expanded in beta around inf 88.4%
Taylor expanded in alpha around 0 88.4%
+-commutative88.4%
Simplified88.4%
Taylor expanded in alpha around 0 88.4%
Final simplification74.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.2) (/ (+ alpha 1.0) (* (+ alpha 2.0) (* (+ alpha 2.0) (+ alpha 3.0)))) (/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 3.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
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.2d0) then
tmp = (alpha + 1.0d0) / ((alpha + 2.0d0) * ((alpha + 2.0d0) * (alpha + 3.0d0)))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.2: tmp = (alpha + 1.0) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.2) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 2.0) * Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.2)
tmp = (alpha + 1.0) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0)));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
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.2], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2:\\
\;\;\;\;\frac{\alpha + 1}{\left(\alpha + 2\right) \cdot \left(\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 3.2000000000000002Initial program 99.9%
Simplified95.8%
Taylor expanded in beta around 0 94.9%
Taylor expanded in beta around 0 95.0%
Taylor expanded in beta around 0 95.0%
if 3.2000000000000002 < beta Initial program 83.5%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 87.0%
+-commutative87.0%
Simplified87.0%
Taylor expanded in alpha around 0 87.0%
Final simplification92.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4e+15) (/ (+ beta 1.0) (* (+ beta 2.0) (+ 6.0 (* beta (+ beta 5.0))))) (/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 3.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+15) {
tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
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 <= 4d+15) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+15) {
tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4e+15: tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0)))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4e+15) 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 / beta) + Float64(alpha / beta)) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4e+15)
tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
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, 4e+15], 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 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4 \cdot 10^{+15}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 4e15Initial program 99.9%
Simplified95.9%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 67.3%
+-commutative67.3%
+-commutative67.3%
Simplified67.3%
Taylor expanded in beta around 0 67.3%
+-commutative67.3%
Simplified67.3%
Taylor expanded in alpha around 0 67.4%
if 4e15 < beta Initial program 82.6%
Taylor expanded in beta around inf 88.4%
Taylor expanded in alpha around 0 88.4%
+-commutative88.4%
Simplified88.4%
Taylor expanded in alpha around 0 88.4%
Final simplification74.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+
0.08333333333333333
(*
alpha
(-
(* alpha (- (* alpha 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) (+ 3.0 (+ beta alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (beta + alpha));
}
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.2d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * ((alpha * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * Float64(Float64(alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / (3.0 + (beta + alpha));
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.2], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * N[(N[(alpha * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot \left(\alpha \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 66.4%
if 2.2000000000000002 < beta Initial program 83.5%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 87.0%
+-commutative87.0%
Simplified87.0%
Final simplification74.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+
0.08333333333333333
(*
alpha
(-
(* alpha (- (* alpha 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 3.0 (+ beta alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
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.2d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * ((alpha * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * Float64(Float64(alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (3.0 + (beta + alpha));
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.2], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * N[(N[(alpha * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot \left(\alpha \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 66.4%
if 2.2000000000000002 < beta Initial program 83.5%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 87.0%
+-commutative87.0%
Simplified87.0%
Taylor expanded in alpha around 0 87.0%
Final simplification74.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.0)
(+ 0.08333333333333333 (* alpha -0.027777777777777776))
(if (<= beta 1.32e+151)
(/ 1.0 (* beta (+ beta 3.0)))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 1.32e+151) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = (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 <= 2.0d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else if (beta <= 1.32d+151) then
tmp = 1.0d0 / (beta * (beta + 3.0d0))
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 1.32e+151) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) elif beta <= 1.32e+151: tmp = 1.0 / (beta * (beta + 3.0)) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); elseif (beta <= 1.32e+151) tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
elseif (beta <= 1.32e+151)
tmp = 1.0 / (beta * (beta + 3.0));
else
tmp = (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, 2.0], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.32e+151], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 1.32 \cdot 10^{+151}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 65.8%
*-commutative65.8%
Simplified65.8%
if 2 < beta < 1.31999999999999992e151Initial program 88.2%
Taylor expanded in beta around inf 79.7%
Taylor expanded in alpha around 0 71.6%
if 1.31999999999999992e151 < beta Initial program 80.9%
Taylor expanded in beta around inf 90.9%
Taylor expanded in alpha around 0 90.9%
+-commutative90.9%
Simplified90.9%
Taylor expanded in alpha around inf 89.2%
Taylor expanded in beta around inf 89.1%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+ 0.08333333333333333 (* alpha -0.027777777777777776))
(if (<= beta 2.8e+160)
(/ (/ 1.0 (+ beta 3.0)) beta)
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 2.8e+160) {
tmp = (1.0 / (beta + 3.0)) / beta;
} else {
tmp = (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 <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else if (beta <= 2.8d+160) then
tmp = (1.0d0 / (beta + 3.0d0)) / beta
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 2.8e+160) {
tmp = (1.0 / (beta + 3.0)) / beta;
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) elif beta <= 2.8e+160: tmp = (1.0 / (beta + 3.0)) / beta else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); elseif (beta <= 2.8e+160) tmp = Float64(Float64(1.0 / Float64(beta + 3.0)) / beta); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
elseif (beta <= 2.8e+160)
tmp = (1.0 / (beta + 3.0)) / beta;
else
tmp = (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, 2.2], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2.8e+160], N[(N[(1.0 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 2.8 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{1}{\beta + 3}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 65.8%
*-commutative65.8%
Simplified65.8%
if 2.2000000000000002 < beta < 2.8e160Initial program 89.2%
Taylor expanded in beta around inf 81.4%
Taylor expanded in alpha around 0 70.9%
inv-pow70.9%
+-commutative70.9%
unpow-prod-down71.2%
inv-pow71.2%
Applied egg-rr71.2%
associate-*l/71.4%
*-lft-identity71.4%
unpow-171.4%
Simplified71.4%
if 2.8e160 < beta Initial program 80.0%
Taylor expanded in beta around inf 90.5%
Taylor expanded in alpha around 0 90.5%
+-commutative90.5%
Simplified90.5%
Taylor expanded in alpha around inf 90.5%
Taylor expanded in beta around inf 90.4%
Final simplification72.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) (+ 3.0 (+ beta alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (beta + alpha));
}
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.2d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / (3.0 + (beta + alpha));
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.2], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 65.9%
if 2.2000000000000002 < beta Initial program 83.5%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 87.0%
+-commutative87.0%
Simplified87.0%
Final simplification73.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.4)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ alpha 1.0) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.4d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.4: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.4) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.4)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.4], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.39999999999999991Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 65.9%
if 3.39999999999999991 < beta Initial program 83.5%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 87.0%
+-commutative87.0%
Simplified87.0%
Taylor expanded in beta around inf 86.7%
Final simplification73.7%
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 (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ alpha 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 * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 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 * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((alpha + 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 * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((alpha + 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 * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((alpha + 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 * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 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.9)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((alpha + 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 * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $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 1.9:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 1.8999999999999999Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 65.9%
if 1.8999999999999999 < beta Initial program 83.5%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 86.8%
+-commutative86.8%
Simplified86.8%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.5d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.5: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.5) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.5)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.5], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 65.8%
*-commutative65.8%
Simplified65.8%
if 3.5 < beta Initial program 83.5%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 87.0%
+-commutative87.0%
Simplified87.0%
Taylor expanded in beta around inf 86.7%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.15) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.15) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / 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.15d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.15) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.15: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.15) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.15)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 0.3333333333333333 / 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.15], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.15:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 3.14999999999999991Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 65.8%
*-commutative65.8%
Simplified65.8%
if 3.14999999999999991 < beta Initial program 83.5%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 81.4%
Taylor expanded in beta around 0 6.8%
Final simplification43.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2e+47) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ alpha beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2e+47) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (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 <= 5.2d+47) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2e+47) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2e+47: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2e+47) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2e+47)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = (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, 5.2e+47], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2 \cdot 10^{+47}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.20000000000000007e47Initial program 99.9%
Simplified95.6%
Taylor expanded in beta around 0 87.1%
Taylor expanded in beta around 0 87.2%
Taylor expanded in alpha around 0 60.8%
+-commutative60.8%
Simplified60.8%
if 5.20000000000000007e47 < beta Initial program 80.0%
Taylor expanded in beta around inf 87.8%
Taylor expanded in alpha around 0 87.8%
+-commutative87.8%
Simplified87.8%
Taylor expanded in alpha around inf 74.6%
Taylor expanded in beta around inf 74.4%
Final simplification65.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) 0.08333333333333333 (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.08333333333333333 else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = 0.08333333333333333; else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.08333333333333333;
else
tmp = 0.3333333333333333 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], 0.08333333333333333, N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 66.3%
if 4 < beta Initial program 83.5%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 81.4%
Taylor expanded in beta around 0 6.8%
Final simplification44.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (beta + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 93.7%
Simplified87.1%
Taylor expanded in beta around 0 82.3%
Taylor expanded in beta around 0 66.4%
Taylor expanded in alpha around 0 44.1%
+-commutative44.1%
Simplified44.1%
Final simplification44.1%
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 93.7%
associate-/l/92.8%
+-commutative92.8%
associate-+l+92.8%
*-commutative92.8%
metadata-eval92.8%
associate-+l+92.8%
metadata-eval92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
metadata-eval92.8%
metadata-eval92.8%
associate-+l+92.8%
Simplified92.8%
Taylor expanded in beta around 0 85.7%
Taylor expanded in beta around 0 65.9%
+-commutative65.9%
Simplified65.9%
Taylor expanded in alpha around 0 43.0%
Final simplification43.0%
herbie shell --seed 2024060
(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)))