
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 3.0 (+ beta alpha))) (t_1 (+ 2.0 (+ beta alpha))))
(if (<= alpha 2e+46)
(/ (/ (/ (* (+ 1.0 beta) (+ 1.0 alpha)) t_1) t_1) t_0)
(/
(/ 1.0 t_1)
(* (/ (+ beta (+ 2.0 alpha)) (+ 1.0 beta)) (/ t_0 alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 3.0 + (beta + alpha);
double t_1 = 2.0 + (beta + alpha);
double tmp;
if (alpha <= 2e+46) {
tmp = ((((1.0 + beta) * (1.0 + alpha)) / t_1) / t_1) / t_0;
} else {
tmp = (1.0 / t_1) / (((beta + (2.0 + alpha)) / (1.0 + beta)) * (t_0 / 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) :: t_1
real(8) :: tmp
t_0 = 3.0d0 + (beta + alpha)
t_1 = 2.0d0 + (beta + alpha)
if (alpha <= 2d+46) then
tmp = ((((1.0d0 + beta) * (1.0d0 + alpha)) / t_1) / t_1) / t_0
else
tmp = (1.0d0 / t_1) / (((beta + (2.0d0 + alpha)) / (1.0d0 + beta)) * (t_0 / alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 3.0 + (beta + alpha);
double t_1 = 2.0 + (beta + alpha);
double tmp;
if (alpha <= 2e+46) {
tmp = ((((1.0 + beta) * (1.0 + alpha)) / t_1) / t_1) / t_0;
} else {
tmp = (1.0 / t_1) / (((beta + (2.0 + alpha)) / (1.0 + beta)) * (t_0 / alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 3.0 + (beta + alpha) t_1 = 2.0 + (beta + alpha) tmp = 0 if alpha <= 2e+46: tmp = ((((1.0 + beta) * (1.0 + alpha)) / t_1) / t_1) / t_0 else: tmp = (1.0 / t_1) / (((beta + (2.0 + alpha)) / (1.0 + beta)) * (t_0 / alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(3.0 + Float64(beta + alpha)) t_1 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (alpha <= 2e+46) tmp = Float64(Float64(Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / t_1) / t_1) / t_0); else tmp = Float64(Float64(1.0 / t_1) / Float64(Float64(Float64(beta + Float64(2.0 + alpha)) / Float64(1.0 + beta)) * Float64(t_0 / alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 3.0 + (beta + alpha);
t_1 = 2.0 + (beta + alpha);
tmp = 0.0;
if (alpha <= 2e+46)
tmp = ((((1.0 + beta) * (1.0 + alpha)) / t_1) / t_1) / t_0;
else
tmp = (1.0 / t_1) / (((beta + (2.0 + alpha)) / (1.0 + beta)) * (t_0 / 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[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 2e+46], N[(N[(N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / t$95$1), $MachinePrecision] / N[(N[(N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 3 + \left(\beta + \alpha\right)\\
t_1 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\alpha \leq 2 \cdot 10^{+46}:\\
\;\;\;\;\frac{\frac{\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{t\_1}}{t\_1}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{\frac{\beta + \left(2 + \alpha\right)}{1 + \beta} \cdot \frac{t\_0}{\alpha}}\\
\end{array}
\end{array}
if alpha < 2e46Initial program 99.9%
div-inv99.9%
+-commutative99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
distribute-rgt1-in99.9%
fma-define99.9%
metadata-eval99.9%
associate-+r+99.9%
metadata-eval99.9%
associate-+r+99.9%
Applied egg-rr99.9%
associate-*l/99.8%
associate-*r/99.9%
*-commutative99.9%
*-lft-identity99.9%
+-commutative99.9%
fma-undefine99.9%
+-commutative99.9%
*-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
distribute-lft1-in99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 99.9%
+-commutative99.9%
Simplified99.9%
if 2e46 < alpha Initial program 84.2%
associate-/l/78.7%
+-commutative78.7%
associate-+l+78.7%
*-commutative78.7%
metadata-eval78.7%
associate-+l+78.7%
metadata-eval78.7%
+-commutative78.7%
+-commutative78.7%
+-commutative78.7%
metadata-eval78.7%
metadata-eval78.7%
associate-+l+78.7%
Simplified78.7%
clear-num78.7%
inv-pow78.7%
*-commutative78.7%
associate-+r+78.7%
+-commutative78.7%
distribute-rgt1-in78.7%
fma-define78.7%
Applied egg-rr78.7%
unpow-178.7%
associate-/r/78.7%
Simplified78.7%
inv-pow78.7%
*-commutative78.7%
associate-+r+78.7%
+-commutative78.7%
+-commutative78.7%
unpow-prod-down78.4%
inv-pow78.4%
inv-pow78.4%
times-frac99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
associate-*r/99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
*-rgt-identity99.8%
associate-+l+99.8%
Applied egg-rr99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around inf 99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))) (t_1 (/ (+ 1.0 alpha) t_0)))
(if (<= beta 9.5e+149)
(/ (* (+ 1.0 beta) t_1) (* (+ 3.0 (+ beta alpha)) t_0))
(* t_1 (/ (- 1.0 (/ (+ 4.0 (* 2.0 alpha)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 9.5e+149) {
tmp = ((1.0 + beta) * t_1) / ((3.0 + (beta + alpha)) * t_0);
} else {
tmp = t_1 * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
t_1 = (1.0d0 + alpha) / t_0
if (beta <= 9.5d+149) then
tmp = ((1.0d0 + beta) * t_1) / ((3.0d0 + (beta + alpha)) * t_0)
else
tmp = t_1 * ((1.0d0 - ((4.0d0 + (2.0d0 * alpha)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 9.5e+149) {
tmp = ((1.0 + beta) * t_1) / ((3.0 + (beta + alpha)) * t_0);
} else {
tmp = t_1 * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) t_1 = (1.0 + alpha) / t_0 tmp = 0 if beta <= 9.5e+149: tmp = ((1.0 + beta) * t_1) / ((3.0 + (beta + alpha)) * t_0) else: tmp = t_1 * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) t_1 = Float64(Float64(1.0 + alpha) / t_0) tmp = 0.0 if (beta <= 9.5e+149) tmp = Float64(Float64(Float64(1.0 + beta) * t_1) / Float64(Float64(3.0 + Float64(beta + alpha)) * t_0)); else tmp = Float64(t_1 * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(2.0 * alpha)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
t_1 = (1.0 + alpha) / t_0;
tmp = 0.0;
if (beta <= 9.5e+149)
tmp = ((1.0 + beta) * t_1) / ((3.0 + (beta + alpha)) * t_0);
else
tmp = t_1 * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[beta, 9.5e+149], N[(N[(N[(1.0 + beta), $MachinePrecision] * t$95$1), $MachinePrecision] / N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(1.0 - N[(N[(4.0 + N[(2.0 * alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
t_1 := \frac{1 + \alpha}{t\_0}\\
\mathbf{if}\;\beta \leq 9.5 \cdot 10^{+149}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot t\_1}{\left(3 + \left(\beta + \alpha\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{1 - \frac{4 + 2 \cdot \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 9.49999999999999973e149Initial program 98.0%
Simplified87.1%
times-frac99.0%
+-commutative99.0%
Applied egg-rr99.0%
associate-*r/99.0%
+-commutative99.0%
+-commutative99.0%
+-commutative99.0%
associate-+r+99.0%
Applied egg-rr99.0%
if 9.49999999999999973e149 < beta Initial program 82.4%
Simplified68.8%
times-frac85.5%
+-commutative85.5%
Applied egg-rr85.5%
Taylor expanded in beta around inf 95.6%
mul-1-neg95.6%
metadata-eval95.6%
distribute-lft-in95.6%
distribute-rgt-in95.6%
metadata-eval95.6%
Simplified95.6%
Final simplification98.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))) (t_1 (/ (+ 1.0 alpha) t_0)))
(if (<= beta 4e+121)
(* t_1 (/ (+ 1.0 beta) (* t_0 (+ alpha (+ beta 3.0)))))
(* t_1 (/ (- 1.0 (/ (+ 4.0 (* 2.0 alpha)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 4e+121) {
tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
t_1 = (1.0d0 + alpha) / t_0
if (beta <= 4d+121) then
tmp = t_1 * ((1.0d0 + beta) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = t_1 * ((1.0d0 - ((4.0d0 + (2.0d0 * alpha)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 4e+121) {
tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) t_1 = (1.0 + alpha) / t_0 tmp = 0 if beta <= 4e+121: tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = t_1 * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) t_1 = Float64(Float64(1.0 + alpha) / t_0) tmp = 0.0 if (beta <= 4e+121) tmp = Float64(t_1 * Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(t_1 * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(2.0 * alpha)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
t_1 = (1.0 + alpha) / t_0;
tmp = 0.0;
if (beta <= 4e+121)
tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = t_1 * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[beta, 4e+121], N[(t$95$1 * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(1.0 - N[(N[(4.0 + N[(2.0 * alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
t_1 := \frac{1 + \alpha}{t\_0}\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+121}:\\
\;\;\;\;t\_1 \cdot \frac{1 + \beta}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{1 - \frac{4 + 2 \cdot \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.00000000000000015e121Initial program 98.4%
Simplified90.3%
times-frac99.0%
+-commutative99.0%
Applied egg-rr99.0%
if 4.00000000000000015e121 < beta Initial program 83.2%
Simplified59.6%
times-frac87.6%
+-commutative87.6%
Applied egg-rr87.6%
Taylor expanded in beta around inf 94.4%
mul-1-neg94.4%
metadata-eval94.4%
distribute-lft-in94.4%
distribute-rgt-in94.4%
metadata-eval94.4%
Simplified94.4%
Final simplification98.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ 1.0 (+ 2.0 (+ beta alpha))) (* (/ (+ beta (+ 2.0 alpha)) (+ 1.0 beta)) (/ (+ 3.0 (+ beta alpha)) (+ 1.0 alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
return (1.0 / (2.0 + (beta + alpha))) / (((beta + (2.0 + alpha)) / (1.0 + beta)) * ((3.0 + (beta + alpha)) / (1.0 + alpha)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = (1.0d0 / (2.0d0 + (beta + alpha))) / (((beta + (2.0d0 + alpha)) / (1.0d0 + beta)) * ((3.0d0 + (beta + alpha)) / (1.0d0 + alpha)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return (1.0 / (2.0 + (beta + alpha))) / (((beta + (2.0 + alpha)) / (1.0 + beta)) * ((3.0 + (beta + alpha)) / (1.0 + alpha)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return (1.0 / (2.0 + (beta + alpha))) / (((beta + (2.0 + alpha)) / (1.0 + beta)) * ((3.0 + (beta + alpha)) / (1.0 + alpha)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(1.0 / Float64(2.0 + Float64(beta + alpha))) / Float64(Float64(Float64(beta + Float64(2.0 + alpha)) / Float64(1.0 + beta)) * Float64(Float64(3.0 + Float64(beta + alpha)) / Float64(1.0 + alpha)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = (1.0 / (2.0 + (beta + alpha))) / (((beta + (2.0 + alpha)) / (1.0 + beta)) * ((3.0 + (beta + alpha)) / (1.0 + alpha)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(1.0 / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{1}{2 + \left(\beta + \alpha\right)}}{\frac{\beta + \left(2 + \alpha\right)}{1 + \beta} \cdot \frac{3 + \left(\beta + \alpha\right)}{1 + \alpha}}
\end{array}
Initial program 95.2%
associate-/l/93.2%
+-commutative93.2%
associate-+l+93.2%
*-commutative93.2%
metadata-eval93.2%
associate-+l+93.2%
metadata-eval93.2%
+-commutative93.2%
+-commutative93.2%
+-commutative93.2%
metadata-eval93.2%
metadata-eval93.2%
associate-+l+93.2%
Simplified93.2%
clear-num93.2%
inv-pow93.2%
*-commutative93.2%
associate-+r+93.2%
+-commutative93.2%
distribute-rgt1-in93.2%
fma-define93.2%
Applied egg-rr93.2%
unpow-193.2%
associate-/r/93.2%
Simplified93.2%
inv-pow93.2%
*-commutative93.2%
associate-+r+93.2%
+-commutative93.2%
+-commutative93.2%
unpow-prod-down93.1%
inv-pow93.1%
inv-pow93.1%
times-frac99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
associate-*r/99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
*-rgt-identity99.8%
associate-+l+99.8%
Applied egg-rr99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 8.5)
(/ (/ (+ 1.0 alpha) (+ 2.0 alpha)) (* (+ 2.0 alpha) (+ 3.0 (+ beta alpha))))
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(/ (- 1.0 (/ (+ 4.0 (* 2.0 alpha)) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.5) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 8.5d0) then
tmp = ((1.0d0 + alpha) / (2.0d0 + alpha)) / ((2.0d0 + alpha) * (3.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * ((1.0d0 - ((4.0d0 + (2.0d0 * alpha)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8.5) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.5: tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (3.0 + (beta + alpha))) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + alpha)) / Float64(Float64(2.0 + alpha) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(2.0 * alpha)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.5)
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (3.0 + (beta + alpha)));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 8.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + alpha), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(2.0 * alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \alpha}}{\left(2 + \alpha\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \frac{1 - \frac{4 + 2 \cdot \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 8.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 99.5%
if 8.5 < beta Initial program 85.5%
Simplified67.2%
times-frac89.8%
+-commutative89.8%
Applied egg-rr89.8%
Taylor expanded in beta around inf 80.2%
mul-1-neg80.2%
metadata-eval80.2%
distribute-lft-in80.2%
distribute-rgt-in80.2%
metadata-eval80.2%
Simplified80.2%
Final simplification93.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (/ 1.0 (+ 2.0 (+ beta alpha)))))
(if (<= beta 3.4e+16)
(/ t_0 (/ (* (+ 2.0 beta) (+ beta 3.0)) (+ 1.0 beta)))
(/ t_0 (/ (+ 3.0 (+ beta alpha)) (+ 1.0 alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 1.0 / (2.0 + (beta + alpha));
double tmp;
if (beta <= 3.4e+16) {
tmp = t_0 / (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta));
} else {
tmp = t_0 / ((3.0 + (beta + alpha)) / (1.0 + 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 = 1.0d0 / (2.0d0 + (beta + alpha))
if (beta <= 3.4d+16) then
tmp = t_0 / (((2.0d0 + beta) * (beta + 3.0d0)) / (1.0d0 + beta))
else
tmp = t_0 / ((3.0d0 + (beta + alpha)) / (1.0d0 + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 1.0 / (2.0 + (beta + alpha));
double tmp;
if (beta <= 3.4e+16) {
tmp = t_0 / (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta));
} else {
tmp = t_0 / ((3.0 + (beta + alpha)) / (1.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 1.0 / (2.0 + (beta + alpha)) tmp = 0 if beta <= 3.4e+16: tmp = t_0 / (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)) else: tmp = t_0 / ((3.0 + (beta + alpha)) / (1.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(1.0 / Float64(2.0 + Float64(beta + alpha))) tmp = 0.0 if (beta <= 3.4e+16) tmp = Float64(t_0 / Float64(Float64(Float64(2.0 + beta) * Float64(beta + 3.0)) / Float64(1.0 + beta))); else tmp = Float64(t_0 / Float64(Float64(3.0 + Float64(beta + alpha)) / Float64(1.0 + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 1.0 / (2.0 + (beta + alpha));
tmp = 0.0;
if (beta <= 3.4e+16)
tmp = t_0 / (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta));
else
tmp = t_0 / ((3.0 + (beta + alpha)) / (1.0 + 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[(1.0 / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.4e+16], N[(t$95$0 / N[(N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{1}{2 + \left(\beta + \alpha\right)}\\
\mathbf{if}\;\beta \leq 3.4 \cdot 10^{+16}:\\
\;\;\;\;\frac{t\_0}{\frac{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\frac{3 + \left(\beta + \alpha\right)}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 3.4e16Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
clear-num99.9%
inv-pow99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
distribute-rgt1-in99.9%
fma-define99.9%
Applied egg-rr99.9%
unpow-199.9%
associate-/r/99.9%
Simplified99.9%
inv-pow99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
unpow-prod-down99.8%
inv-pow99.8%
inv-pow99.8%
times-frac99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
associate-*r/99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
Simplified99.9%
*-rgt-identity99.9%
associate-+l+99.9%
Applied egg-rr99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 68.3%
if 3.4e16 < beta Initial program 84.4%
associate-/l/77.6%
+-commutative77.6%
associate-+l+77.6%
*-commutative77.6%
metadata-eval77.6%
associate-+l+77.6%
metadata-eval77.6%
+-commutative77.6%
+-commutative77.6%
+-commutative77.6%
metadata-eval77.6%
metadata-eval77.6%
associate-+l+77.6%
Simplified77.6%
clear-num77.6%
inv-pow77.6%
*-commutative77.6%
associate-+r+77.6%
+-commutative77.6%
distribute-rgt1-in77.6%
fma-define77.6%
Applied egg-rr77.6%
unpow-177.6%
associate-/r/77.6%
Simplified77.6%
inv-pow77.6%
*-commutative77.6%
associate-+r+77.6%
+-commutative77.6%
+-commutative77.6%
unpow-prod-down77.6%
inv-pow77.6%
inv-pow77.6%
times-frac99.6%
associate-+r+99.6%
+-commutative99.6%
+-commutative99.6%
Applied egg-rr99.6%
associate-*r/99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
Simplified99.7%
*-rgt-identity99.7%
associate-+l+99.7%
Applied egg-rr99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 85.4%
Final simplification73.4%
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 2.65e+17)
(/ 1.0 (* t_0 (/ (* (+ 2.0 beta) (+ beta 3.0)) (+ 1.0 beta))))
(/ (/ 1.0 t_0) (/ (+ 3.0 (+ beta alpha)) (+ 1.0 alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 2.65e+17) {
tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)));
} else {
tmp = (1.0 / t_0) / ((3.0 + (beta + alpha)) / (1.0 + 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 <= 2.65d+17) then
tmp = 1.0d0 / (t_0 * (((2.0d0 + beta) * (beta + 3.0d0)) / (1.0d0 + beta)))
else
tmp = (1.0d0 / t_0) / ((3.0d0 + (beta + alpha)) / (1.0d0 + 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 <= 2.65e+17) {
tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)));
} else {
tmp = (1.0 / t_0) / ((3.0 + (beta + alpha)) / (1.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 2.65e+17: tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta))) else: tmp = (1.0 / t_0) / ((3.0 + (beta + alpha)) / (1.0 + 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 <= 2.65e+17) tmp = Float64(1.0 / Float64(t_0 * Float64(Float64(Float64(2.0 + beta) * Float64(beta + 3.0)) / Float64(1.0 + beta)))); else tmp = Float64(Float64(1.0 / t_0) / Float64(Float64(3.0 + Float64(beta + alpha)) / Float64(1.0 + 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 <= 2.65e+17)
tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)));
else
tmp = (1.0 / t_0) / ((3.0 + (beta + alpha)) / (1.0 + 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, 2.65e+17], N[(1.0 / N[(t$95$0 * N[(N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + 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 2.65 \cdot 10^{+17}:\\
\;\;\;\;\frac{1}{t\_0 \cdot \frac{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{\frac{3 + \left(\beta + \alpha\right)}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 2.65e17Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
clear-num99.9%
inv-pow99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
distribute-rgt1-in99.9%
fma-define99.9%
Applied egg-rr99.9%
unpow-199.9%
associate-/r/99.9%
Simplified99.9%
Taylor expanded in alpha around 0 68.3%
if 2.65e17 < beta Initial program 84.4%
associate-/l/77.6%
+-commutative77.6%
associate-+l+77.6%
*-commutative77.6%
metadata-eval77.6%
associate-+l+77.6%
metadata-eval77.6%
+-commutative77.6%
+-commutative77.6%
+-commutative77.6%
metadata-eval77.6%
metadata-eval77.6%
associate-+l+77.6%
Simplified77.6%
clear-num77.6%
inv-pow77.6%
*-commutative77.6%
associate-+r+77.6%
+-commutative77.6%
distribute-rgt1-in77.6%
fma-define77.6%
Applied egg-rr77.6%
unpow-177.6%
associate-/r/77.6%
Simplified77.6%
inv-pow77.6%
*-commutative77.6%
associate-+r+77.6%
+-commutative77.6%
+-commutative77.6%
unpow-prod-down77.6%
inv-pow77.6%
inv-pow77.6%
times-frac99.6%
associate-+r+99.6%
+-commutative99.6%
+-commutative99.6%
Applied egg-rr99.6%
associate-*r/99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
Simplified99.7%
*-rgt-identity99.7%
associate-+l+99.7%
Applied egg-rr99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 85.4%
Final simplification73.4%
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 1.7e+16)
(/ 1.0 (* t_0 (/ (* (+ 2.0 beta) (+ beta 3.0)) (+ 1.0 beta))))
(/ (/ (+ 1.0 alpha) t_0) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1.7e+16) {
tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)));
} else {
tmp = ((1.0 + alpha) / t_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) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (beta + alpha)
if (beta <= 1.7d+16) then
tmp = 1.0d0 / (t_0 * (((2.0d0 + beta) * (beta + 3.0d0)) / (1.0d0 + beta)))
else
tmp = ((1.0d0 + alpha) / t_0) / beta
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 <= 1.7e+16) {
tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)));
} else {
tmp = ((1.0 + alpha) / t_0) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 1.7e+16: tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta))) else: tmp = ((1.0 + alpha) / t_0) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 1.7e+16) tmp = Float64(1.0 / Float64(t_0 * Float64(Float64(Float64(2.0 + beta) * Float64(beta + 3.0)) / Float64(1.0 + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) / beta); 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 <= 1.7e+16)
tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)));
else
tmp = ((1.0 + alpha) / t_0) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.7e+16], N[(1.0 / N[(t$95$0 * N[(N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 1.7 \cdot 10^{+16}:\\
\;\;\;\;\frac{1}{t\_0 \cdot \frac{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0}}{\beta}\\
\end{array}
\end{array}
if beta < 1.7e16Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
clear-num99.9%
inv-pow99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
distribute-rgt1-in99.9%
fma-define99.9%
Applied egg-rr99.9%
unpow-199.9%
associate-/r/99.9%
Simplified99.9%
Taylor expanded in alpha around 0 68.3%
if 1.7e16 < beta Initial program 84.4%
Simplified64.7%
times-frac89.0%
+-commutative89.0%
Applied egg-rr89.0%
Taylor expanded in beta around inf 84.8%
un-div-inv84.9%
+-commutative84.9%
+-commutative84.9%
+-commutative84.9%
associate-+r+84.9%
Applied egg-rr84.9%
Final simplification73.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ (/ (+ 1.0 alpha) (+ 2.0 alpha)) (* (+ 2.0 alpha) (+ 3.0 (+ beta alpha)))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.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 <= 4.5d0) then
tmp = ((1.0d0 + alpha) / (2.0d0 + alpha)) / ((2.0d0 + alpha) * (3.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (3.0 + (beta + alpha))) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + alpha)) / Float64(Float64(2.0 + alpha) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.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 <= 4.5)
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (3.0 + (beta + alpha)));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.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, 4.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + alpha), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \alpha}}{\left(2 + \alpha\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 99.5%
if 4.5 < beta Initial program 85.5%
Taylor expanded in beta around inf 80.0%
Final simplification93.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ (/ (+ 1.0 alpha) (+ 2.0 alpha)) (* (+ 2.0 alpha) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.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 <= 4.5d0) then
tmp = ((1.0d0 + alpha) / (2.0d0 + alpha)) / ((2.0d0 + alpha) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + alpha)) / Float64(Float64(2.0 + alpha) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.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 <= 4.5)
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.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, 4.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + alpha), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \alpha}}{\left(2 + \alpha\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
if 4.5 < beta Initial program 85.5%
Taylor expanded in beta around inf 80.0%
Final simplification92.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) (/ 0.25 (+ beta 3.0)) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.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 <= 4.0d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
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.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.25 / (beta + 3.0) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.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 <= 4.0)
tmp = 0.25 / (beta + 3.0);
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.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, 4.0], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 99.5%
Taylor expanded in alpha around 0 67.8%
if 4 < beta Initial program 85.5%
Taylor expanded in beta around inf 80.0%
Final simplification71.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.25 (+ beta 3.0)) (/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.25 / (beta + 3.0) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 0.25 / (beta + 3.0);
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 99.5%
Taylor expanded in alpha around 0 67.8%
if 4.5 < beta Initial program 85.5%
Simplified67.2%
times-frac89.8%
+-commutative89.8%
Applied egg-rr89.8%
Taylor expanded in beta around inf 79.9%
un-div-inv80.0%
+-commutative80.0%
+-commutative80.0%
+-commutative80.0%
associate-+r+80.0%
Applied egg-rr80.0%
Final simplification71.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.2) (/ 0.25 (+ beta 3.0)) (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) * (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 <= 6.2d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = 0.25 / (beta + 3.0) else: tmp = ((1.0 + alpha) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.2) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * 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 <= 6.2)
tmp = 0.25 / (beta + 3.0);
else
tmp = ((1.0 + alpha) / beta) * (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, 6.2], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.2:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 99.5%
Taylor expanded in alpha around 0 67.8%
if 6.20000000000000018 < beta Initial program 85.5%
Simplified67.2%
times-frac89.8%
+-commutative89.8%
Applied egg-rr89.8%
Taylor expanded in beta around inf 79.9%
Taylor expanded in beta around inf 79.7%
Final simplification71.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.25 (+ beta 3.0)) (/ (/ 1.0 beta) (+ 2.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = (1.0 / beta) / (2.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 <= 4.5d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = (1.0d0 / beta) / (2.0d0 + beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = (1.0 / beta) / (2.0 + beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.25 / (beta + 3.0) else: tmp = (1.0 / beta) / (2.0 + beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(Float64(1.0 / beta) / Float64(2.0 + beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 0.25 / (beta + 3.0);
else
tmp = (1.0 / beta) / (2.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, 4.5], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{2 + \beta}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 99.5%
Taylor expanded in alpha around 0 67.8%
if 4.5 < beta Initial program 85.5%
Simplified67.2%
times-frac89.8%
+-commutative89.8%
Applied egg-rr89.8%
Taylor expanded in beta around inf 79.9%
Taylor expanded in alpha around 0 68.9%
associate-/r*70.0%
Simplified70.0%
Final simplification68.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.25 (+ beta 3.0)) (/ 1.0 (* beta (+ 2.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = 1.0 / (beta * (2.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 <= 4.5d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = 1.0d0 / (beta * (2.0d0 + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.25 / (beta + 3.0) else: tmp = 1.0 / (beta * (2.0 + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(1.0 / Float64(beta * Float64(2.0 + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 0.25 / (beta + 3.0);
else
tmp = 1.0 / (beta * (2.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, 4.5], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 99.5%
Taylor expanded in alpha around 0 67.8%
if 4.5 < beta Initial program 85.5%
Simplified67.2%
times-frac89.8%
+-commutative89.8%
Applied egg-rr89.8%
Taylor expanded in beta around inf 79.9%
Taylor expanded in alpha around 0 68.9%
Final simplification68.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 12.0) 0.08333333333333333 (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 12.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 12.0: tmp = 0.08333333333333333 else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 12.0) tmp = 0.08333333333333333; else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 12.0)
tmp = 0.08333333333333333;
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 12.0], 0.08333333333333333, N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 12:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 12Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in alpha around 0 66.9%
+-commutative66.9%
+-commutative66.9%
Simplified66.9%
Taylor expanded in beta around 0 67.0%
if 12 < beta Initial program 85.5%
Simplified67.2%
times-frac89.8%
+-commutative89.8%
Applied egg-rr89.8%
Taylor expanded in beta around inf 79.9%
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 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 95.2%
associate-/l/93.2%
+-commutative93.2%
associate-+l+93.2%
*-commutative93.2%
metadata-eval93.2%
associate-+l+93.2%
metadata-eval93.2%
+-commutative93.2%
+-commutative93.2%
+-commutative93.2%
metadata-eval93.2%
metadata-eval93.2%
associate-+l+93.2%
Simplified93.2%
Taylor expanded in beta around 0 85.7%
Taylor expanded in beta around 0 74.2%
Taylor expanded in alpha around 0 48.0%
Final simplification48.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 95.2%
associate-/l/93.2%
+-commutative93.2%
associate-+l+93.2%
*-commutative93.2%
metadata-eval93.2%
associate-+l+93.2%
metadata-eval93.2%
+-commutative93.2%
+-commutative93.2%
+-commutative93.2%
metadata-eval93.2%
metadata-eval93.2%
associate-+l+93.2%
Simplified93.2%
Taylor expanded in beta around 0 85.7%
Taylor expanded in alpha around 0 61.2%
+-commutative61.2%
+-commutative61.2%
Simplified61.2%
Taylor expanded in beta around 0 46.6%
herbie shell --seed 2024114
(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)))