
(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 (+ alpha (+ beta 2.0)))) (* (/ (/ (+ 1.0 alpha) t_0) t_0) (/ (+ 1.0 beta) (+ 3.0 (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + 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 = alpha + (beta + 2.0d0)
code = (((1.0d0 + alpha) / t_0) / t_0) * ((1.0d0 + beta) / (3.0d0 + (alpha + beta)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / Float64(3.0 + Float64(alpha + beta)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (3.0 + (alpha + beta)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \frac{1 + \beta}{3 + \left(\alpha + \beta\right)}
\end{array}
\end{array}
Initial program 95.6%
Simplified86.2%
times-frac95.9%
+-commutative95.9%
Applied egg-rr95.9%
associate-*r/95.9%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.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
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 5e+21)
(/ (+ 1.0 beta) (* (+ beta 2.0) (+ 6.0 (* beta (+ beta 5.0)))))
(* (/ (/ (+ 1.0 alpha) t_0) t_0) (+ 1.0 (/ (- -2.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+21) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 5d+21) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = (((1.0d0 + alpha) / t_0) / t_0) * (1.0d0 + (((-2.0d0) - alpha) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+21) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 5e+21: tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0)))) else: tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5e+21) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(1.0 + Float64(Float64(-2.0 - alpha) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 5e+21)
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
else
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+21], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 + N[(N[(-2.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+21}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \left(1 + \frac{-2 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 5e21Initial program 99.8%
associate-/l/99.4%
+-commutative99.4%
associate-+l+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.2%
+-commutative83.2%
Simplified83.2%
Taylor expanded in beta around 0 83.2%
Taylor expanded in alpha around 0 64.8%
+-commutative64.8%
+-commutative64.8%
Simplified64.8%
if 5e21 < beta Initial program 84.0%
Simplified63.4%
times-frac86.3%
+-commutative86.3%
Applied egg-rr86.3%
associate-*r/86.3%
times-frac99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 87.3%
associate-*r/87.3%
distribute-lft-in87.3%
metadata-eval87.3%
mul-1-neg87.3%
Simplified87.3%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.8e+21)
(/ (+ 1.0 beta) (* (+ beta 2.0) (+ 6.0 (* beta (+ beta 5.0)))))
(*
(/ (+ 1.0 beta) (+ 3.0 (+ alpha beta)))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8e+21) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + beta) / (3.0 + (alpha + beta))) * (((1.0 + alpha) / beta) / (alpha + (beta + 2.0)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d+21) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((1.0d0 + beta) / (3.0d0 + (alpha + beta))) * (((1.0d0 + alpha) / beta) / (alpha + (beta + 2.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8e+21) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + beta) / (3.0 + (alpha + beta))) * (((1.0 + alpha) / beta) / (alpha + (beta + 2.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8e+21: tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0)))) else: tmp = ((1.0 + beta) / (3.0 + (alpha + beta))) * (((1.0 + alpha) / beta) / (alpha + (beta + 2.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8e+21) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(1.0 + beta) / Float64(3.0 + Float64(alpha + beta))) * Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 2.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8e+21)
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
else
tmp = ((1.0 + beta) / (3.0 + (alpha + beta))) * (((1.0 + alpha) / beta) / (alpha + (beta + 2.0)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8e+21], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8 \cdot 10^{+21}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \beta}{3 + \left(\alpha + \beta\right)} \cdot \frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 2.8e21Initial program 99.8%
associate-/l/99.4%
+-commutative99.4%
associate-+l+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.2%
+-commutative83.2%
Simplified83.2%
Taylor expanded in beta around 0 83.2%
Taylor expanded in alpha around 0 64.8%
+-commutative64.8%
+-commutative64.8%
Simplified64.8%
if 2.8e21 < beta Initial program 84.0%
Simplified63.4%
times-frac86.3%
+-commutative86.3%
Applied egg-rr86.3%
associate-*r/86.3%
times-frac99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 87.8%
Final simplification70.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5e+28) (/ (+ 1.0 beta) (* (+ beta 2.0) (+ 6.0 (* beta (+ beta 5.0))))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+28) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5d+28) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (alpha + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+28) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5e+28: tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0)))) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (alpha + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5e+28) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5e+28)
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (alpha + beta)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5e+28], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5 \cdot 10^{+28}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\end{array}
\end{array}
if beta < 4.99999999999999957e28Initial program 99.8%
associate-/l/99.4%
+-commutative99.4%
associate-+l+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 82.8%
+-commutative82.8%
Simplified82.8%
Taylor expanded in beta around 0 82.8%
Taylor expanded in alpha around 0 64.5%
+-commutative64.5%
+-commutative64.5%
Simplified64.5%
if 4.99999999999999957e28 < beta Initial program 83.8%
Taylor expanded in beta around inf 88.7%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1e+31) (/ (+ 1.0 beta) (* (+ beta 2.0) (+ 6.0 (* beta (+ beta 5.0))))) (/ 1.0 (* (+ alpha (+ beta 2.0)) (/ beta (+ 1.0 alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+31) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (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) :: tmp
if (beta <= 1d+31) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * (beta / (1.0d0 + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+31) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (1.0 + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1e+31: tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0)))) else: tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (1.0 + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1e+31) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(beta / Float64(1.0 + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1e+31)
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
else
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (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_] := If[LessEqual[beta, 1e+31], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10^{+31}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 9.9999999999999996e30Initial program 99.8%
associate-/l/99.4%
+-commutative99.4%
associate-+l+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 82.9%
+-commutative82.9%
Simplified82.9%
Taylor expanded in beta around 0 82.9%
Taylor expanded in alpha around 0 64.2%
+-commutative64.2%
+-commutative64.2%
Simplified64.2%
if 9.9999999999999996e30 < beta Initial program 83.5%
associate-/l/76.2%
+-commutative76.2%
associate-+l+76.2%
*-commutative76.2%
metadata-eval76.2%
associate-+l+76.2%
metadata-eval76.2%
associate-+l+76.2%
metadata-eval76.2%
metadata-eval76.2%
associate-+l+76.2%
Simplified76.2%
Taylor expanded in beta around inf 85.9%
clear-num85.9%
inv-pow85.9%
associate-+r+85.9%
*-commutative85.9%
Applied egg-rr85.9%
unpow-185.9%
associate-/l*86.0%
+-commutative86.0%
+-commutative86.0%
Simplified86.0%
Taylor expanded in beta around inf 85.7%
Final simplification69.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.7) (/ (+ 1.0 alpha) (+ 12.0 (* alpha (+ 16.0 (* alpha (+ alpha 7.0)))))) (/ 1.0 (* (+ alpha (+ beta 2.0)) (/ beta (+ 1.0 alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = (1.0 + alpha) / (12.0 + (alpha * (16.0 + (alpha * (alpha + 7.0)))));
} else {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (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) :: tmp
if (beta <= 2.7d0) then
tmp = (1.0d0 + alpha) / (12.0d0 + (alpha * (16.0d0 + (alpha * (alpha + 7.0d0)))))
else
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * (beta / (1.0d0 + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = (1.0 + alpha) / (12.0 + (alpha * (16.0 + (alpha * (alpha + 7.0)))));
} else {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (1.0 + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7: tmp = (1.0 + alpha) / (12.0 + (alpha * (16.0 + (alpha * (alpha + 7.0))))) else: tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (1.0 + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.7) tmp = Float64(Float64(1.0 + alpha) / Float64(12.0 + Float64(alpha * Float64(16.0 + Float64(alpha * Float64(alpha + 7.0)))))); else tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(beta / Float64(1.0 + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.7)
tmp = (1.0 + alpha) / (12.0 + (alpha * (16.0 + (alpha * (alpha + 7.0)))));
else
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (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_] := If[LessEqual[beta, 2.7], N[(N[(1.0 + alpha), $MachinePrecision] / N[(12.0 + N[(alpha * N[(16.0 + N[(alpha * N[(alpha + 7.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.7:\\
\;\;\;\;\frac{1 + \alpha}{12 + \alpha \cdot \left(16 + \alpha \cdot \left(\alpha + 7\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial program 99.8%
Simplified94.3%
associate-+r+94.3%
*-commutative94.3%
distribute-lft-in94.3%
associate-+r+94.3%
associate-+r+94.3%
Applied egg-rr94.3%
Taylor expanded in beta around 0 93.3%
distribute-rgt-out93.3%
*-commutative93.3%
+-commutative93.3%
Simplified93.3%
Taylor expanded in alpha around 0 93.4%
+-commutative93.4%
Simplified93.4%
if 2.7000000000000002 < beta Initial program 85.3%
associate-/l/78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
metadata-eval78.8%
associate-+l+78.8%
Simplified78.8%
Taylor expanded in beta around inf 83.5%
clear-num83.5%
inv-pow83.5%
associate-+r+83.5%
*-commutative83.5%
Applied egg-rr83.5%
unpow-183.5%
associate-/l*79.9%
+-commutative79.9%
+-commutative79.9%
Simplified79.9%
Taylor expanded in beta around inf 79.3%
Final simplification89.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.4) (/ (+ 1.0 alpha) (* (+ alpha 2.0) (* (+ alpha 2.0) (+ alpha 3.0)))) (/ 1.0 (* (+ alpha (+ beta 2.0)) (/ beta (+ 1.0 alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (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) :: tmp
if (beta <= 4.4d0) then
tmp = (1.0d0 + alpha) / ((alpha + 2.0d0) * ((alpha + 2.0d0) * (alpha + 3.0d0)))
else
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * (beta / (1.0d0 + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (1.0 + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.4: tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0))) else: tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (1.0 + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.4) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + 2.0) * Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))); else tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(beta / Float64(1.0 + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.4)
tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 2.0) * (alpha + 3.0)));
else
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (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_] := If[LessEqual[beta, 4.4], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.4:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha + 2\right) \cdot \left(\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.8%
Simplified94.3%
associate-+r+94.3%
*-commutative94.3%
distribute-lft-in94.3%
associate-+r+94.3%
associate-+r+94.3%
Applied egg-rr94.3%
Taylor expanded in beta around 0 93.3%
distribute-rgt-out93.3%
*-commutative93.3%
+-commutative93.3%
Simplified93.3%
if 4.4000000000000004 < beta Initial program 85.3%
associate-/l/78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
metadata-eval78.8%
associate-+l+78.8%
Simplified78.8%
Taylor expanded in beta around inf 83.5%
clear-num83.5%
inv-pow83.5%
associate-+r+83.5%
*-commutative83.5%
Applied egg-rr83.5%
unpow-183.5%
associate-/l*79.9%
+-commutative79.9%
+-commutative79.9%
Simplified79.9%
Taylor expanded in beta around inf 79.3%
Final simplification89.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.4)
(+
0.08333333333333333
(*
alpha
(-
(* alpha (- (* alpha 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ 1.0 (* (+ alpha (+ beta 2.0)) (/ beta (+ 1.0 alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (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) :: tmp
if (beta <= 2.4d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * ((alpha * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * (beta / (1.0d0 + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (1.0 + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.4: tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (1.0 + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.4) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * Float64(Float64(alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(beta / Float64(1.0 + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.4)
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
else
tmp = 1.0 / ((alpha + (beta + 2.0)) * (beta / (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_] := If[LessEqual[beta, 2.4], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * N[(N[(alpha * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.4:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot \left(\alpha \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 2.39999999999999991Initial program 99.8%
Simplified94.3%
associate-+r+94.3%
*-commutative94.3%
distribute-lft-in94.3%
associate-+r+94.3%
associate-+r+94.3%
Applied egg-rr94.3%
Taylor expanded in beta around 0 93.3%
distribute-rgt-out93.3%
*-commutative93.3%
+-commutative93.3%
Simplified93.3%
Taylor expanded in alpha around 0 64.3%
if 2.39999999999999991 < beta Initial program 85.3%
associate-/l/78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
metadata-eval78.8%
associate-+l+78.8%
Simplified78.8%
Taylor expanded in beta around inf 83.5%
clear-num83.5%
inv-pow83.5%
associate-+r+83.5%
*-commutative83.5%
Applied egg-rr83.5%
unpow-183.5%
associate-/l*79.9%
+-commutative79.9%
+-commutative79.9%
Simplified79.9%
Taylor expanded in beta around inf 79.3%
Final simplification68.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 0.98)
(+
0.08333333333333333
(*
alpha
(-
(* alpha (- (* alpha 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ (+ 1.0 alpha) (* (+ beta 2.0) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 0.98) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = (1.0 + alpha) / ((beta + 2.0) * (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 <= 0.98d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * ((alpha * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = (1.0d0 + alpha) / ((beta + 2.0d0) * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 0.98) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = (1.0 + alpha) / ((beta + 2.0) * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 0.98: tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = (1.0 + alpha) / ((beta + 2.0) * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 0.98) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * Float64(Float64(alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(beta + 2.0) * 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 <= 0.98)
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
else
tmp = (1.0 + alpha) / ((beta + 2.0) * (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, 0.98], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * N[(N[(alpha * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 0.98:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot \left(\alpha \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 0.97999999999999998Initial program 99.8%
Simplified94.3%
associate-+r+94.3%
*-commutative94.3%
distribute-lft-in94.3%
associate-+r+94.3%
associate-+r+94.3%
Applied egg-rr94.3%
Taylor expanded in beta around 0 93.3%
distribute-rgt-out93.3%
*-commutative93.3%
+-commutative93.3%
Simplified93.3%
Taylor expanded in alpha around 0 64.3%
if 0.97999999999999998 < beta Initial program 85.3%
associate-/l/78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
metadata-eval78.8%
associate-+l+78.8%
Simplified78.8%
Taylor expanded in beta around inf 83.5%
Taylor expanded in alpha around 0 75.6%
+-commutative75.6%
Simplified75.6%
Final simplification67.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 0.95)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (+ 1.0 alpha) (* (+ beta 2.0) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 0.95) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = (1.0 + alpha) / ((beta + 2.0) * (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 <= 0.95d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = (1.0d0 + alpha) / ((beta + 2.0d0) * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 0.95) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = (1.0 + alpha) / ((beta + 2.0) * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 0.95: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = (1.0 + alpha) / ((beta + 2.0) * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 0.95) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(beta + 2.0) * 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 <= 0.95)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = (1.0 + alpha) / ((beta + 2.0) * (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, 0.95], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 0.95:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 0.94999999999999996Initial program 99.8%
Simplified94.3%
associate-+r+94.3%
*-commutative94.3%
distribute-lft-in94.3%
associate-+r+94.3%
associate-+r+94.3%
Applied egg-rr94.3%
Taylor expanded in beta around 0 93.3%
distribute-rgt-out93.3%
*-commutative93.3%
+-commutative93.3%
Simplified93.3%
Taylor expanded in alpha around 0 63.8%
if 0.94999999999999996 < beta Initial program 85.3%
associate-/l/78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
metadata-eval78.8%
associate-+l+78.8%
Simplified78.8%
Taylor expanded in beta around inf 83.5%
Taylor expanded in alpha around 0 75.6%
+-commutative75.6%
Simplified75.6%
Final simplification67.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 0.95)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ 1.0 (* (+ beta 2.0) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 0.95) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = 1.0 / ((beta + 2.0) * (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 <= 0.95d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = 1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 0.95) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 0.95: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = 1.0 / ((beta + 2.0) * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 0.95) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(1.0 / Float64(Float64(beta + 2.0) * 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 <= 0.95)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = 1.0 / ((beta + 2.0) * (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, 0.95], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 0.95:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 0.94999999999999996Initial program 99.8%
Simplified94.3%
associate-+r+94.3%
*-commutative94.3%
distribute-lft-in94.3%
associate-+r+94.3%
associate-+r+94.3%
Applied egg-rr94.3%
Taylor expanded in beta around 0 93.3%
distribute-rgt-out93.3%
*-commutative93.3%
+-commutative93.3%
Simplified93.3%
Taylor expanded in alpha around 0 63.8%
if 0.94999999999999996 < beta Initial program 85.3%
associate-/l/78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
metadata-eval78.8%
associate-+l+78.8%
Simplified78.8%
Taylor expanded in beta around inf 83.5%
Taylor expanded in alpha around 0 71.6%
+-commutative71.6%
Simplified71.6%
Final simplification66.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.5 (* (+ alpha 2.0) (+ alpha 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.5 / ((alpha + 2.0) * (alpha + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.5d0 / ((alpha + 2.0d0) * (alpha + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.5 / ((alpha + 2.0) * (alpha + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.5 / ((alpha + 2.0) * (alpha + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.5 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.5 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.5}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}
\end{array}
Initial program 95.6%
associate-/l/93.4%
+-commutative93.4%
associate-+l+93.4%
*-commutative93.4%
metadata-eval93.4%
associate-+l+93.4%
metadata-eval93.4%
associate-+l+93.4%
metadata-eval93.4%
metadata-eval93.4%
associate-+l+93.4%
Simplified93.4%
Taylor expanded in alpha around 0 82.4%
+-commutative82.4%
Simplified82.4%
Taylor expanded in beta around 0 62.7%
+-commutative62.7%
Simplified62.7%
Final simplification62.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (+ 0.08333333333333333 (* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
}
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 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)
\end{array}
Initial program 95.6%
Simplified86.2%
associate-+r+86.2%
*-commutative86.2%
distribute-lft-in86.2%
associate-+r+86.2%
associate-+r+86.2%
Applied egg-rr86.2%
Taylor expanded in beta around 0 71.0%
distribute-rgt-out71.0%
*-commutative71.0%
+-commutative71.0%
Simplified71.0%
Taylor expanded in alpha around 0 46.3%
Final simplification46.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (+ 0.08333333333333333 (* alpha -0.027777777777777776)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333 + (alpha * -0.027777777777777776);
}
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 + (alpha * (-0.027777777777777776d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333 + (alpha * -0.027777777777777776);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333 + (alpha * -0.027777777777777776)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333 + \alpha \cdot -0.027777777777777776
\end{array}
Initial program 95.6%
Simplified86.2%
associate-+r+86.2%
*-commutative86.2%
distribute-lft-in86.2%
associate-+r+86.2%
associate-+r+86.2%
Applied egg-rr86.2%
Taylor expanded in beta around 0 71.0%
distribute-rgt-out71.0%
*-commutative71.0%
+-commutative71.0%
Simplified71.0%
Taylor expanded in alpha around 0 46.3%
*-commutative46.3%
Simplified46.3%
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.6%
associate-/l/93.4%
+-commutative93.4%
associate-+l+93.4%
*-commutative93.4%
metadata-eval93.4%
associate-+l+93.4%
metadata-eval93.4%
associate-+l+93.4%
metadata-eval93.4%
metadata-eval93.4%
associate-+l+93.4%
Simplified93.4%
Taylor expanded in alpha around 0 82.4%
+-commutative82.4%
Simplified82.4%
Taylor expanded in beta around 0 62.7%
+-commutative62.7%
Simplified62.7%
Taylor expanded in alpha around 0 46.8%
herbie shell --seed 2024086
(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)))