
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ beta alpha) 2.0))) (/ (/ (* (+ 1.0 beta) (/ (- -1.0 alpha) t_0)) t_0) (- -1.0 t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
return (((1.0 + beta) * ((-1.0 - alpha) / t_0)) / t_0) / (-1.0 - t_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 = (beta + alpha) + 2.0d0
code = (((1.0d0 + beta) * (((-1.0d0) - alpha) / t_0)) / t_0) / ((-1.0d0) - t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
return (((1.0 + beta) * ((-1.0 - alpha) / t_0)) / t_0) / (-1.0 - t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + alpha) + 2.0 return (((1.0 + beta) * ((-1.0 - alpha) / t_0)) / t_0) / (-1.0 - t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) return Float64(Float64(Float64(Float64(1.0 + beta) * Float64(Float64(-1.0 - alpha) / t_0)) / t_0) / Float64(-1.0 - t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (beta + alpha) + 2.0;
tmp = (((1.0 + beta) * ((-1.0 - alpha) / t_0)) / t_0) / (-1.0 - t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(-1.0 - alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(-1.0 - t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\frac{\frac{\left(1 + \beta\right) \cdot \frac{-1 - \alpha}{t\_0}}{t\_0}}{-1 - t\_0}
\end{array}
\end{array}
Initial program 94.1%
frac-2neg94.1%
div-inv94.1%
neg-sub094.1%
associate-+l+94.1%
*-commutative94.1%
metadata-eval94.1%
associate-+r+94.1%
neg-sub094.1%
metadata-eval94.1%
associate-+r+94.1%
Applied egg-rr94.1%
associate-*r/94.1%
*-rgt-identity94.1%
Simplified99.9%
Final simplification99.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0)))
(if (<= beta 2.2e+98)
(* (+ 1.0 alpha) (/ (+ 1.0 beta) (* t_0 (* t_0 (+ (+ beta alpha) 3.0)))))
(/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 2.2e+98) {
tmp = (1.0 + alpha) * ((1.0 + beta) / (t_0 * (t_0 * ((beta + alpha) + 3.0))));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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) :: t_0
real(8) :: tmp
t_0 = (beta + alpha) + 2.0d0
if (beta <= 2.2d+98) then
tmp = (1.0d0 + alpha) * ((1.0d0 + beta) / (t_0 * (t_0 * ((beta + alpha) + 3.0d0))))
else
tmp = ((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 2.2e+98) {
tmp = (1.0 + alpha) * ((1.0 + beta) / (t_0 * (t_0 * ((beta + alpha) + 3.0))));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + alpha) + 2.0 tmp = 0 if beta <= 2.2e+98: tmp = (1.0 + alpha) * ((1.0 + beta) / (t_0 * (t_0 * ((beta + alpha) + 3.0)))) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 2.2e+98) tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + alpha) + 2.0;
tmp = 0.0;
if (beta <= 2.2e+98)
tmp = (1.0 + alpha) * ((1.0 + beta) / (t_0 * (t_0 * ((beta + alpha) + 3.0))));
else
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 2.2e+98], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 2.2 \cdot 10^{+98}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{1 + \beta}{t\_0 \cdot \left(t\_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.20000000000000009e98Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
associate-+r+99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
*-commutative99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
*-un-lft-identity99.7%
associate-+r+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-/r*99.9%
+-commutative99.9%
metadata-eval99.9%
associate-+r+99.9%
metadata-eval99.9%
Applied egg-rr99.9%
*-lft-identity99.9%
associate-/r*99.7%
associate-/l/92.6%
associate-/l*92.6%
+-commutative92.6%
*-commutative92.6%
associate-+r+92.6%
+-commutative92.6%
associate-+r+92.6%
associate-+r+92.6%
+-commutative92.6%
+-commutative92.6%
+-commutative92.6%
Simplified92.6%
if 2.20000000000000009e98 < beta Initial program 74.5%
associate-/l/73.7%
+-commutative73.7%
+-commutative73.7%
associate-+r+73.7%
associate-+r+73.7%
associate-+r+73.7%
distribute-rgt1-in73.7%
+-commutative73.7%
*-commutative73.7%
distribute-rgt1-in73.7%
+-commutative73.7%
metadata-eval73.7%
associate-+l+73.7%
Simplified73.7%
Taylor expanded in beta around inf 82.8%
*-un-lft-identity82.8%
associate-+r+82.8%
+-commutative82.8%
associate-+l+82.8%
associate-+l+82.8%
Applied egg-rr82.8%
*-lft-identity82.8%
associate-/r*92.1%
+-commutative92.1%
+-commutative92.1%
+-commutative92.1%
Simplified92.1%
Final simplification92.5%
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) (+ alpha (+ beta 3.0))) (/ (/ (+ 1.0 beta) t_0) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / (alpha + (beta + 3.0))) * (((1.0 + beta) / t_0) / t_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 = alpha + (beta + 2.0d0)
code = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) * (((1.0d0 + beta) / t_0) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / (alpha + (beta + 3.0))) * (((1.0 + beta) / t_0) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((1.0 + alpha) / (alpha + (beta + 3.0))) * (((1.0 + beta) / t_0) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(Float64(1.0 + beta) / t_0) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) * (((1.0 + beta) / t_0) / t_0);
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[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)} \cdot \frac{\frac{1 + \beta}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 94.1%
associate-/l/93.8%
+-commutative93.8%
+-commutative93.8%
associate-+r+93.8%
associate-+r+93.8%
associate-+r+93.8%
distribute-rgt1-in93.8%
+-commutative93.8%
*-commutative93.8%
distribute-rgt1-in93.8%
+-commutative93.8%
metadata-eval93.8%
associate-+l+93.8%
Simplified93.8%
associate-+r+93.8%
metadata-eval93.8%
associate-/l*95.8%
associate-+r+95.8%
metadata-eval95.8%
metadata-eval95.8%
associate-+l+95.8%
metadata-eval95.8%
*-commutative95.8%
times-frac99.8%
Applied egg-rr99.9%
Final simplification99.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 9.5)
(/
(/ (+ 1.0 alpha) (* (+ alpha 2.0) (+ alpha 2.0)))
(+ 1.0 (+ (+ beta alpha) 2.0)))
(/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.5) {
tmp = ((1.0 + alpha) / ((alpha + 2.0) * (alpha + 2.0))) / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 9.5d0) then
tmp = ((1.0d0 + alpha) / ((alpha + 2.0d0) * (alpha + 2.0d0))) / (1.0d0 + ((beta + alpha) + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.5) {
tmp = ((1.0 + alpha) / ((alpha + 2.0) * (alpha + 2.0))) / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.5: tmp = ((1.0 + alpha) / ((alpha + 2.0) * (alpha + 2.0))) / (1.0 + ((beta + alpha) + 2.0)) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0))) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.5)
tmp = ((1.0 + alpha) / ((alpha + 2.0) * (alpha + 2.0))) / (1.0 + ((beta + alpha) + 2.0));
else
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 9.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 9.5Initial program 99.9%
Taylor expanded in beta around 0 99.3%
unpow299.3%
Simplified99.3%
if 9.5 < beta Initial program 81.8%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
associate-+r+81.2%
associate-+r+81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
metadata-eval81.2%
associate-+l+81.2%
Simplified81.2%
Taylor expanded in beta around inf 80.8%
*-un-lft-identity80.8%
associate-+r+80.8%
+-commutative80.8%
associate-+l+80.8%
associate-+l+80.8%
Applied egg-rr80.8%
*-lft-identity80.8%
associate-/r*84.1%
+-commutative84.1%
+-commutative84.1%
+-commutative84.1%
Simplified84.1%
Final simplification94.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 10.5) (/ (+ 1.0 alpha) (* (* (+ alpha 2.0) (+ alpha 2.0)) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 10.5) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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 <= 10.5d0) then
tmp = (1.0d0 + alpha) / (((alpha + 2.0d0) * (alpha + 2.0d0)) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / (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 <= 10.5) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 10.5: tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 10.5) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0)) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / 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 <= 10.5)
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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, 10.5], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $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 10.5:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 10.5Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
associate-+r+99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
*-commutative99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 91.6%
unpow291.6%
+-commutative91.6%
Simplified91.6%
if 10.5 < beta Initial program 81.8%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
associate-+r+81.2%
associate-+r+81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
metadata-eval81.2%
associate-+l+81.2%
Simplified81.2%
Taylor expanded in beta around inf 80.8%
*-un-lft-identity80.8%
associate-+r+80.8%
+-commutative80.8%
associate-+l+80.8%
associate-+l+80.8%
Applied egg-rr80.8%
*-lft-identity80.8%
associate-/r*84.1%
+-commutative84.1%
+-commutative84.1%
+-commutative84.1%
Simplified84.1%
Final simplification89.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 16.0) (/ (+ 1.0 alpha) (* (* (+ alpha 2.0) (+ alpha 2.0)) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ (+ beta alpha) 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 16.0) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + ((beta + alpha) + 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 <= 16.0d0) then
tmp = (1.0d0 + alpha) / (((alpha + 2.0d0) * (alpha + 2.0d0)) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + ((beta + alpha) + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 16.0) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 16.0: tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (1.0 + ((beta + alpha) + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 16.0) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0)) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 16.0)
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + ((beta + alpha) + 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, 16.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 16:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\end{array}
\end{array}
if beta < 16Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
associate-+r+99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
*-commutative99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 91.6%
unpow291.6%
+-commutative91.6%
Simplified91.6%
if 16 < beta Initial program 81.8%
Taylor expanded in beta around inf 83.6%
Final simplification89.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 20.0) (/ (+ 1.0 alpha) (* (* (+ alpha 2.0) (+ alpha 2.0)) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 20.0) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (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 <= 20.0d0) then
tmp = (1.0d0 + alpha) / (((alpha + 2.0d0) * (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 <= 20.0) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (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 <= 20.0: tmp = (1.0 + alpha) / (((alpha + 2.0) * (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 <= 20.0) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha + 2.0) * 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 <= 20.0)
tmp = (1.0 + alpha) / (((alpha + 2.0) * (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, 20.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $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 20:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 20Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
associate-+r+99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
*-commutative99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 91.6%
unpow291.6%
+-commutative91.6%
Simplified91.6%
if 20 < beta Initial program 81.8%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
associate-+r+81.2%
associate-+r+81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
metadata-eval81.2%
associate-+l+81.2%
Simplified81.2%
Taylor expanded in beta around inf 75.7%
unpow275.7%
Simplified75.7%
associate-/r*83.4%
Applied egg-rr83.4%
Final simplification89.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.3)
(+
0.08333333333333333
(*
alpha
(-
(* alpha (- (* alpha 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} 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 <= 3.3d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * ((alpha * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
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 <= 3.3) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3: tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * Float64(Float64(alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.3)
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
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, 3.3], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * N[(N[(alpha * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot \left(\alpha \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.9%
frac-2neg99.9%
div-inv99.9%
neg-sub099.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+r+99.9%
neg-sub099.9%
metadata-eval99.9%
associate-+r+99.9%
Applied egg-rr99.9%
associate-*r/99.9%
*-rgt-identity99.9%
Simplified99.9%
Taylor expanded in beta around 0 91.6%
associate-/r*98.5%
unpow298.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
Simplified98.5%
Taylor expanded in alpha around 0 67.6%
if 3.2999999999999998 < beta Initial program 81.8%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
associate-+r+81.2%
associate-+r+81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
metadata-eval81.2%
associate-+l+81.2%
Simplified81.2%
Taylor expanded in beta around inf 75.7%
unpow275.7%
Simplified75.7%
associate-/r*83.4%
Applied egg-rr83.4%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.3) (/ (+ 0.25 (* (* alpha alpha) -0.0625)) (+ alpha 3.0)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (0.25 + ((alpha * alpha) * -0.0625)) / (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 <= 3.3d0) then
tmp = (0.25d0 + ((alpha * alpha) * (-0.0625d0))) / (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 <= 3.3) {
tmp = (0.25 + ((alpha * alpha) * -0.0625)) / (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 <= 3.3: tmp = (0.25 + ((alpha * alpha) * -0.0625)) / (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 <= 3.3) tmp = Float64(Float64(0.25 + Float64(Float64(alpha * alpha) * -0.0625)) / 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 <= 3.3)
tmp = (0.25 + ((alpha * alpha) * -0.0625)) / (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, 3.3], N[(N[(0.25 + N[(N[(alpha * alpha), $MachinePrecision] * -0.0625), $MachinePrecision]), $MachinePrecision] / N[(alpha + 3.0), $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 3.3:\\
\;\;\;\;\frac{0.25 + \left(\alpha \cdot \alpha\right) \cdot -0.0625}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.9%
frac-2neg99.9%
div-inv99.9%
neg-sub099.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+r+99.9%
neg-sub099.9%
metadata-eval99.9%
associate-+r+99.9%
Applied egg-rr99.9%
associate-*r/99.9%
*-rgt-identity99.9%
Simplified99.9%
Taylor expanded in beta around 0 91.6%
associate-/r*98.5%
unpow298.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
Simplified98.5%
Taylor expanded in alpha around 0 67.4%
*-commutative67.4%
unpow267.4%
Simplified67.4%
if 3.2999999999999998 < beta Initial program 81.8%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
associate-+r+81.2%
associate-+r+81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
metadata-eval81.2%
associate-+l+81.2%
Simplified81.2%
Taylor expanded in beta around inf 75.7%
unpow275.7%
Simplified75.7%
associate-/r*83.4%
Applied egg-rr83.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.0)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} 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 <= 3.0d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
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 <= 3.0) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); 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 <= 3.0)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
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, 3.0], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $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 3:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3Initial program 99.9%
frac-2neg99.9%
div-inv99.9%
neg-sub099.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+r+99.9%
neg-sub099.9%
metadata-eval99.9%
associate-+r+99.9%
Applied egg-rr99.9%
associate-*r/99.9%
*-rgt-identity99.9%
Simplified99.9%
Taylor expanded in beta around 0 91.6%
associate-/r*98.5%
unpow298.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
Simplified98.5%
Taylor expanded in alpha around 0 67.4%
if 3 < beta Initial program 81.8%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
associate-+r+81.2%
associate-+r+81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
metadata-eval81.2%
associate-+l+81.2%
Simplified81.2%
Taylor expanded in beta around inf 75.7%
unpow275.7%
Simplified75.7%
associate-/r*83.4%
Applied egg-rr83.4%
Final simplification72.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} 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 <= 3.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
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 <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); 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 <= 3.1)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
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, 3.1], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $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 3.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.10000000000000009Initial program 99.9%
frac-2neg99.9%
div-inv99.9%
neg-sub099.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+r+99.9%
neg-sub099.9%
metadata-eval99.9%
associate-+r+99.9%
Applied egg-rr99.9%
associate-*r/99.9%
*-rgt-identity99.9%
Simplified99.9%
Taylor expanded in beta around 0 91.6%
associate-/r*98.5%
unpow298.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
Simplified98.5%
Taylor expanded in alpha around 0 67.4%
if 3.10000000000000009 < beta Initial program 81.8%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
associate-+r+81.2%
associate-+r+81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
metadata-eval81.2%
associate-+l+81.2%
Simplified81.2%
Taylor expanded in beta around inf 75.7%
unpow275.7%
Simplified75.7%
associate-/r*83.4%
Applied egg-rr83.4%
Final simplification72.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} 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 <= 3.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
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 <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.1)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
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, 3.1], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.10000000000000009Initial program 99.9%
frac-2neg99.9%
div-inv99.9%
neg-sub099.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+r+99.9%
neg-sub099.9%
metadata-eval99.9%
associate-+r+99.9%
Applied egg-rr99.9%
associate-*r/99.9%
*-rgt-identity99.9%
Simplified99.9%
Taylor expanded in beta around 0 91.6%
associate-/r*98.5%
unpow298.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
Simplified98.5%
Taylor expanded in alpha around 0 67.4%
if 3.10000000000000009 < beta Initial program 81.8%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
associate-+r+81.2%
associate-+r+81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
metadata-eval81.2%
associate-+l+81.2%
Simplified81.2%
Taylor expanded in beta around inf 75.7%
unpow275.7%
Simplified75.7%
Final simplification70.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.0d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.0], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3Initial program 99.9%
frac-2neg99.9%
div-inv99.9%
neg-sub099.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+r+99.9%
neg-sub099.9%
metadata-eval99.9%
associate-+r+99.9%
Applied egg-rr99.9%
associate-*r/99.9%
*-rgt-identity99.9%
Simplified99.9%
Taylor expanded in beta around 0 91.6%
associate-/r*98.5%
unpow298.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
Simplified98.5%
Taylor expanded in alpha around 0 67.4%
if 3 < beta Initial program 81.8%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
associate-+r+81.2%
associate-+r+81.2%
associate-+r+81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
metadata-eval81.2%
associate-+l+81.2%
Simplified81.2%
Taylor expanded in beta around inf 75.7%
unpow275.7%
Simplified75.7%
Taylor expanded in alpha around 0 72.0%
unpow272.0%
Simplified72.0%
Final simplification68.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 94.1%
frac-2neg94.1%
div-inv94.1%
neg-sub094.1%
associate-+l+94.1%
*-commutative94.1%
metadata-eval94.1%
associate-+r+94.1%
neg-sub094.1%
metadata-eval94.1%
associate-+r+94.1%
Applied egg-rr94.1%
associate-*r/94.1%
*-rgt-identity94.1%
Simplified99.9%
Taylor expanded in beta around 0 72.2%
unpow272.2%
+-commutative72.2%
+-commutative72.2%
Simplified72.2%
Taylor expanded in alpha around 0 49.0%
+-commutative49.0%
Simplified49.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ alpha 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (alpha + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.25d0 / (alpha + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (alpha + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (alpha + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(alpha + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (alpha + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\alpha + 3}
\end{array}
Initial program 94.1%
frac-2neg94.1%
div-inv94.1%
neg-sub094.1%
associate-+l+94.1%
*-commutative94.1%
metadata-eval94.1%
associate-+r+94.1%
neg-sub094.1%
metadata-eval94.1%
associate-+r+94.1%
Applied egg-rr94.1%
associate-*r/94.1%
*-rgt-identity94.1%
Simplified99.9%
Taylor expanded in beta around 0 66.2%
associate-/r*70.9%
unpow270.9%
+-commutative70.9%
+-commutative70.9%
+-commutative70.9%
Simplified70.9%
Taylor expanded in alpha around 0 48.5%
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 94.1%
frac-2neg94.1%
div-inv94.1%
neg-sub094.1%
associate-+l+94.1%
*-commutative94.1%
metadata-eval94.1%
associate-+r+94.1%
neg-sub094.1%
metadata-eval94.1%
associate-+r+94.1%
Applied egg-rr94.1%
associate-*r/94.1%
*-rgt-identity94.1%
Simplified99.9%
Taylor expanded in beta around 0 66.2%
associate-/r*70.9%
unpow270.9%
+-commutative70.9%
+-commutative70.9%
+-commutative70.9%
Simplified70.9%
Taylor expanded in alpha around 0 46.9%
Final simplification46.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 94.1%
associate-/l/93.8%
+-commutative93.8%
+-commutative93.8%
associate-+r+93.8%
associate-+r+93.8%
associate-+r+93.8%
distribute-rgt1-in93.8%
+-commutative93.8%
*-commutative93.8%
distribute-rgt1-in93.8%
+-commutative93.8%
metadata-eval93.8%
associate-+l+93.8%
Simplified93.8%
Taylor expanded in alpha around 0 84.6%
+-commutative84.6%
Simplified84.6%
Taylor expanded in alpha around 0 70.6%
+-commutative70.6%
+-commutative70.6%
Simplified70.6%
Taylor expanded in beta around 0 47.5%
herbie shell --seed 2024107
(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)))