
(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 15 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 (+ alpha beta)))) (/ (/ (+ 1.0 alpha) t_0) (* t_0 (/ (+ alpha (+ beta 3.0)) (+ 1.0 beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return ((1.0 + alpha) / t_0) / (t_0 * ((alpha + (beta + 3.0)) / (1.0 + beta)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = 2.0d0 + (alpha + beta)
code = ((1.0d0 + alpha) / t_0) / (t_0 * ((alpha + (beta + 3.0d0)) / (1.0d0 + beta)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return ((1.0 + alpha) / t_0) / (t_0 * ((alpha + (beta + 3.0)) / (1.0 + beta)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) return ((1.0 + alpha) / t_0) / (t_0 * ((alpha + (beta + 3.0)) / (1.0 + beta)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) return Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(t_0 * Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(1.0 + beta)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = ((1.0 + alpha) / t_0) / (t_0 * ((alpha + (beta + 3.0)) / (1.0 + beta)));
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[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\frac{\frac{1 + \alpha}{t\_0}}{t\_0 \cdot \frac{\alpha + \left(\beta + 3\right)}{1 + \beta}}
\end{array}
\end{array}
Initial program 94.1%
Simplified82.1%
times-frac95.2%
+-commutative95.2%
Applied egg-rr95.2%
associate-*r/95.2%
Applied egg-rr95.2%
times-frac99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
*-commutative99.8%
clear-num99.8%
frac-times99.1%
*-un-lft-identity99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
Applied egg-rr99.1%
Final simplification99.1%
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 1e+142)
(* t_1 (/ (+ 1.0 beta) (* (+ alpha (+ beta 3.0)) t_0)))
(* t_1 (/ (- 1.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 <= 1e+142) {
tmp = t_1 * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = t_1 * ((1.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 <= 1d+142) then
tmp = t_1 * ((1.0d0 + beta) / ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = t_1 * ((1.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 <= 1e+142) {
tmp = t_1 * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = t_1 * ((1.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 <= 1e+142: tmp = t_1 * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0)) else: tmp = t_1 * ((1.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 <= 1e+142) tmp = Float64(t_1 * Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(t_1 * Float64(Float64(1.0 - Float64(2.0 * Float64(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 <= 1e+142)
tmp = t_1 * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0));
else
tmp = t_1 * ((1.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, 1e+142], N[(t$95$1 * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(1.0 - N[(2.0 * N[(alpha / beta), $MachinePrecision]), $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 10^{+142}:\\
\;\;\;\;t\_1 \cdot \frac{1 + \beta}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{1 - 2 \cdot \frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.00000000000000005e142Initial program 97.5%
Simplified86.5%
times-frac98.5%
+-commutative98.5%
Applied egg-rr98.5%
if 1.00000000000000005e142 < beta Initial program 78.1%
Simplified61.3%
times-frac79.7%
+-commutative79.7%
Applied egg-rr79.7%
Taylor expanded in beta around inf 86.4%
mul-1-neg86.4%
unsub-neg86.4%
Simplified86.4%
Taylor expanded in alpha around inf 86.4%
Final simplification96.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 360000000.0)
(/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ 2.0 beta) (+ (+ alpha beta) 3.0)))
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 360000000.0) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (alpha * 2.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 <= 360000000.0d0) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((2.0d0 + beta) * ((alpha + beta) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 360000000.0) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 360000000.0: tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0)) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 360000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(2.0 + beta) * Float64(Float64(alpha + beta) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 360000000.0)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (alpha * 2.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, 360000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + 3.0), $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[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 360000000:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(2 + \beta\right) \cdot \left(\left(\alpha + \beta\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.6e8Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 85.7%
+-commutative85.7%
Simplified85.7%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
Simplified71.2%
if 3.6e8 < beta Initial program 81.6%
Simplified54.9%
times-frac87.4%
+-commutative87.4%
Applied egg-rr87.4%
Taylor expanded in beta around inf 77.8%
mul-1-neg77.8%
unsub-neg77.8%
Simplified77.8%
Final simplification73.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ 2.0 (+ alpha beta)))) (* (/ (/ (+ 1.0 alpha) t_0) t_0) (/ (+ 1.0 beta) (+ alpha (+ beta 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = 2.0d0 + (alpha + beta)
code = (((1.0d0 + alpha) / t_0) / t_0) * ((1.0d0 + beta) / (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \frac{1 + \beta}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 94.1%
Simplified82.1%
times-frac95.2%
+-commutative95.2%
Applied egg-rr95.2%
associate-*r/95.2%
Applied egg-rr95.2%
times-frac99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.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 2.6e+16)
(/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ 2.0 beta) (+ (+ alpha beta) 3.0)))
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(/ (- 1.0 (* 2.0 (/ alpha beta))) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6e+16) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.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 <= 2.6d+16) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((2.0d0 + beta) * ((alpha + beta) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * ((1.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 <= 2.6e+16) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - (2.0 * (alpha / beta))) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6e+16: tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0)) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - (2.0 * (alpha / beta))) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6e+16) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(2.0 + beta) * Float64(Float64(alpha + beta) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(Float64(1.0 - Float64(2.0 * 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.6e+16)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.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, 2.6e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(2.0 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(2 + \beta\right) \cdot \left(\left(\alpha + \beta\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \frac{1 - 2 \cdot \frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.6e16Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 85.7%
+-commutative85.7%
Simplified85.7%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
Simplified71.2%
if 2.6e16 < beta Initial program 81.6%
Simplified54.9%
times-frac87.4%
+-commutative87.4%
Applied egg-rr87.4%
Taylor expanded in beta around inf 77.8%
mul-1-neg77.8%
unsub-neg77.8%
Simplified77.8%
Taylor expanded in alpha around inf 77.8%
Final simplification73.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.8e+15) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ 2.0 beta) (+ (+ alpha beta) 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.8e+15) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.8d+15) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((2.0d0 + beta) * ((alpha + beta) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.8e+15) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.8e+15: tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.8e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(2.0 + beta) * Float64(Float64(alpha + beta) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.8e+15)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * ((alpha + beta) + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.8e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(2 + \beta\right) \cdot \left(\left(\alpha + \beta\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.8e15Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 85.7%
+-commutative85.7%
Simplified85.7%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
Simplified71.2%
if 5.8e15 < beta Initial program 81.6%
Taylor expanded in beta around inf 78.1%
div-inv78.1%
+-commutative78.1%
metadata-eval78.1%
associate-+l+78.1%
metadata-eval78.1%
associate-+r+78.1%
Applied egg-rr78.1%
associate-*r/78.1%
*-rgt-identity78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
Simplified78.1%
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 (+ alpha (+ beta 3.0))))
(if (<= beta 5.5e+15)
(/ (+ 1.0 beta) (* (+ 2.0 beta) (* t_0 (+ 2.0 beta))))
(/ (/ (+ 1.0 alpha) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 5.5e+15) {
tmp = (1.0 + beta) / ((2.0 + beta) * (t_0 * (2.0 + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (beta <= 5.5d+15) then
tmp = (1.0d0 + beta) / ((2.0d0 + beta) * (t_0 * (2.0d0 + beta)))
else
tmp = ((1.0d0 + alpha) / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 5.5e+15) {
tmp = (1.0 + beta) / ((2.0 + beta) * (t_0 * (2.0 + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) tmp = 0 if beta <= 5.5e+15: tmp = (1.0 + beta) / ((2.0 + beta) * (t_0 * (2.0 + beta))) else: tmp = ((1.0 + alpha) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 5.5e+15) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(t_0 * Float64(2.0 + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 5.5e+15)
tmp = (1.0 + beta) / ((2.0 + beta) * (t_0 * (2.0 + beta)));
else
tmp = ((1.0 + alpha) / beta) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.5e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(t$95$0 * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 5.5 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(t\_0 \cdot \left(2 + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 5.5e15Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 85.7%
+-commutative85.7%
Simplified85.7%
*-un-lft-identity85.7%
*-commutative85.7%
associate-+r+85.7%
Applied egg-rr85.7%
*-lft-identity85.7%
associate-/l/85.7%
associate-*l*85.7%
associate-+r+85.7%
+-commutative85.7%
+-commutative85.7%
+-commutative85.7%
*-commutative85.7%
+-commutative85.7%
+-commutative85.7%
+-commutative85.7%
+-commutative85.7%
Simplified85.7%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
Simplified71.2%
if 5.5e15 < beta Initial program 81.6%
Taylor expanded in beta around inf 78.1%
div-inv78.1%
+-commutative78.1%
metadata-eval78.1%
associate-+l+78.1%
metadata-eval78.1%
associate-+r+78.1%
Applied egg-rr78.1%
associate-*r/78.1%
*-rgt-identity78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
Simplified78.1%
Final simplification73.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2e+15) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ beta 3.0) (+ 2.0 beta))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2e+15) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.2d+15) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((beta + 3.0d0) * (2.0d0 + beta))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2e+15) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2e+15: tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2e+15)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.2e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.2e15Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 85.7%
+-commutative85.7%
Simplified85.7%
Taylor expanded in alpha around 0 69.6%
+-commutative69.6%
+-commutative69.6%
Simplified69.6%
if 5.2e15 < beta Initial program 81.6%
Taylor expanded in beta around inf 78.1%
div-inv78.1%
+-commutative78.1%
metadata-eval78.1%
associate-+l+78.1%
metadata-eval78.1%
associate-+r+78.1%
Applied egg-rr78.1%
associate-*r/78.1%
*-rgt-identity78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
Simplified78.1%
Final simplification72.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.4) (/ 0.5 (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.4d0) then
tmp = 0.5d0 / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.4: tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.4) tmp = Float64(0.5 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.4)
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.4], N[(0.5 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.4:\\
\;\;\;\;\frac{0.5}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 86.0%
+-commutative86.0%
Simplified86.0%
Taylor expanded in beta around 0 83.8%
if 4.4000000000000004 < beta Initial program 82.3%
Taylor expanded in beta around inf 76.5%
div-inv76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
metadata-eval76.4%
associate-+r+76.4%
Applied egg-rr76.4%
associate-*r/76.5%
*-rgt-identity76.5%
+-commutative76.5%
+-commutative76.5%
+-commutative76.5%
+-commutative76.5%
Simplified76.5%
Final simplification81.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.1) (/ 0.5 (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.1) {
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.1d0) then
tmp = 0.5d0 / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.1) {
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.1: tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.1) tmp = Float64(0.5 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.1)
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.1], N[(0.5 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.1:\\
\;\;\;\;\frac{0.5}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.0999999999999996Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 86.0%
+-commutative86.0%
Simplified86.0%
Taylor expanded in beta around 0 83.8%
if 4.0999999999999996 < beta Initial program 82.3%
Taylor expanded in beta around inf 76.5%
Taylor expanded in alpha around 0 76.2%
+-commutative76.2%
Simplified76.2%
Final simplification81.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.6) (/ 0.5 (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.6) {
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.6d0) then
tmp = 0.5d0 / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.6) {
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.6: tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.6) tmp = Float64(0.5 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.6)
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.6], N[(0.5 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.6:\\
\;\;\;\;\frac{0.5}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 7.5999999999999996Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 86.0%
+-commutative86.0%
Simplified86.0%
Taylor expanded in beta around 0 83.8%
if 7.5999999999999996 < beta Initial program 82.3%
Taylor expanded in beta around inf 76.5%
div-inv76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
metadata-eval76.4%
associate-+r+76.4%
Applied egg-rr76.4%
associate-*r/76.5%
*-rgt-identity76.5%
+-commutative76.5%
+-commutative76.5%
+-commutative76.5%
+-commutative76.5%
Simplified76.5%
Taylor expanded in beta around inf 76.2%
Final simplification81.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ (+ 1.0 alpha) beta) beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((1.0 + alpha) / beta) / beta;
}
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 + alpha) / beta) / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((1.0 + alpha) / beta) / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((1.0 + alpha) / beta) / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(1.0 + alpha) / beta) / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((1.0 + alpha) / beta) / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{1 + \alpha}{\beta}}{\beta}
\end{array}
Initial program 94.1%
Taylor expanded in beta around inf 27.2%
div-inv27.1%
+-commutative27.1%
metadata-eval27.1%
associate-+l+27.1%
metadata-eval27.1%
associate-+r+27.1%
Applied egg-rr27.1%
associate-*r/27.2%
*-rgt-identity27.2%
+-commutative27.2%
+-commutative27.2%
+-commutative27.2%
+-commutative27.2%
Simplified27.2%
Taylor expanded in beta around inf 27.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (+ 1.0 alpha) (* beta beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return (1.0 + alpha) / (beta * beta);
}
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 + alpha) / (beta * beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return (1.0 + alpha) / (beta * beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return (1.0 + alpha) / (beta * beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(1.0 + alpha) / Float64(beta * beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = (1.0 + alpha) / (beta * beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1 + \alpha}{\beta \cdot \beta}
\end{array}
Initial program 94.1%
Taylor expanded in beta around inf 27.2%
*-un-lft-identity27.2%
associate-/l/27.9%
+-commutative27.9%
metadata-eval27.9%
associate-+l+27.9%
metadata-eval27.9%
associate-+r+27.9%
Applied egg-rr27.9%
*-lft-identity27.9%
+-commutative27.9%
*-commutative27.9%
+-commutative27.9%
+-commutative27.9%
+-commutative27.9%
Simplified27.9%
Taylor expanded in beta around inf 26.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (beta * (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 = 1.0d0 / (beta * (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (beta * (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot \left(\beta + 3\right)}
\end{array}
Initial program 94.1%
Taylor expanded in beta around inf 27.2%
Taylor expanded in alpha around 0 24.8%
Final simplification24.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
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.3333333333333333d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\beta}
\end{array}
Initial program 94.1%
Taylor expanded in beta around inf 27.2%
Taylor expanded in alpha around 0 24.8%
Taylor expanded in beta around 0 4.2%
herbie shell --seed 2024144
(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)))