
(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 (+ (+ alpha 2.0) beta))) (/ (/ (/ (+ 1.0 alpha) t_0) (/ (+ beta (+ alpha 3.0)) (+ 1.0 beta))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
return (((1.0 + alpha) / t_0) / ((beta + (alpha + 3.0)) / (1.0 + beta))) / 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 + 2.0d0) + beta
code = (((1.0d0 + alpha) / t_0) / ((beta + (alpha + 3.0d0)) / (1.0d0 + beta))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
return (((1.0 + alpha) / t_0) / ((beta + (alpha + 3.0)) / (1.0 + beta))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 2.0) + beta return (((1.0 + alpha) / t_0) / ((beta + (alpha + 3.0)) / (1.0 + beta))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 2.0) + beta) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(Float64(beta + Float64(alpha + 3.0)) / Float64(1.0 + beta))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (alpha + 2.0) + beta;
tmp = (((1.0 + alpha) / t_0) / ((beta + (alpha + 3.0)) / (1.0 + beta))) / 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[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + 2\right) + \beta\\
\frac{\frac{\frac{1 + \alpha}{t_0}}{\frac{\beta + \left(\alpha + 3\right)}{1 + \beta}}}{t_0}
\end{array}
\end{array}
Initial program 94.8%
Simplified96.1%
associate-*l/96.1%
+-commutative96.1%
associate-+r+96.1%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
clear-num99.2%
inv-pow99.2%
associate-+r+99.2%
+-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
Applied egg-rr99.2%
unpow-199.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
associate-*l/99.2%
*-commutative99.2%
associate-/l*99.2%
associate-/r/99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
expm1-log1p-u99.2%
expm1-udef70.9%
Applied egg-rr70.9%
expm1-def99.7%
expm1-log1p99.7%
associate-*l/99.7%
*-lft-identity99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 50000000000000.0)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_0 t_1)))
(* (/ beta t_1) (/ (/ (+ 1.0 alpha) t_0) t_1)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 50000000000000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = (beta / t_1) * (((1.0 + alpha) / t_0) / t_1);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (2.0d0 + beta)
if (beta <= 50000000000000.0d0) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_0 * t_1))
else
tmp = (beta / t_1) * (((1.0d0 + alpha) / t_0) / t_1)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 50000000000000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = (beta / t_1) * (((1.0 + alpha) / t_0) / t_1);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (2.0 + beta) tmp = 0 if beta <= 50000000000000.0: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1)) else: tmp = (beta / t_1) * (((1.0 + alpha) / t_0) / t_1) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 50000000000000.0) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_0 * t_1))); else tmp = Float64(Float64(beta / t_1) * Float64(Float64(Float64(1.0 + alpha) / t_0) / t_1)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 50000000000000.0)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
else
tmp = (beta / t_1) * (((1.0 + alpha) / t_0) / t_1);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 50000000000000.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(beta / t$95$1), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 50000000000000:\\
\;\;\;\;\frac{1 + \alpha}{t_1} \cdot \frac{1 + \beta}{t_0 \cdot t_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta}{t_1} \cdot \frac{\frac{1 + \alpha}{t_0}}{t_1}\\
\end{array}
\end{array}
if beta < 5e13Initial program 99.9%
Simplified99.9%
if 5e13 < beta Initial program 83.6%
Simplified60.6%
Taylor expanded in beta around inf 60.6%
times-frac87.7%
*-commutative87.7%
Applied egg-rr87.7%
+-commutative87.7%
+-commutative87.7%
+-commutative87.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= beta 2.3e+14)
(/ (/ (+ 1.0 beta) (* (+ beta 3.0) (+ 2.0 beta))) (+ (+ alpha 2.0) beta))
(* (/ beta t_0) (/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 2.3e+14) {
tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / ((alpha + 2.0) + beta);
} else {
tmp = (beta / t_0) * (((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
if (beta <= 2.3d+14) then
tmp = ((1.0d0 + beta) / ((beta + 3.0d0) * (2.0d0 + beta))) / ((alpha + 2.0d0) + beta)
else
tmp = (beta / t_0) * (((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 2.3e+14) {
tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / ((alpha + 2.0) + beta);
} else {
tmp = (beta / t_0) * (((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 2.3e+14: tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / ((alpha + 2.0) + beta) else: tmp = (beta / t_0) * (((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 2.3e+14) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))) / Float64(Float64(alpha + 2.0) + beta)); else tmp = Float64(Float64(beta / t_0) * Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 2.3e+14)
tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / ((alpha + 2.0) + beta);
else
tmp = (beta / t_0) * (((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.3e+14], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]), $MachinePrecision], N[(N[(beta / t$95$0), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 2.3 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}}{\left(\alpha + 2\right) + \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta}{t_0} \cdot \frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{t_0}\\
\end{array}
\end{array}
if beta < 2.3e14Initial program 99.9%
Simplified99.9%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 71.6%
+-commutative71.6%
+-commutative71.6%
Simplified71.6%
if 2.3e14 < beta Initial program 83.6%
Simplified60.6%
Taylor expanded in beta around inf 60.6%
times-frac87.7%
*-commutative87.7%
Applied egg-rr87.7%
+-commutative87.7%
+-commutative87.7%
+-commutative87.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification80.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ alpha 2.0) beta)))
(if (<= beta 2.85e+17)
(/ (/ (+ 1.0 beta) (* (+ beta 3.0) (+ 2.0 beta))) t_0)
(/
(* (+ 1.0 alpha) (/ (- 1.0 (/ alpha beta)) (+ alpha (+ beta 3.0))))
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
double tmp;
if (beta <= 2.85e+17) {
tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / t_0;
} else {
tmp = ((1.0 + alpha) * ((1.0 - (alpha / beta)) / (alpha + (beta + 3.0)))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (alpha + 2.0d0) + beta
if (beta <= 2.85d+17) then
tmp = ((1.0d0 + beta) / ((beta + 3.0d0) * (2.0d0 + beta))) / t_0
else
tmp = ((1.0d0 + alpha) * ((1.0d0 - (alpha / beta)) / (alpha + (beta + 3.0d0)))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
double tmp;
if (beta <= 2.85e+17) {
tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / t_0;
} else {
tmp = ((1.0 + alpha) * ((1.0 - (alpha / beta)) / (alpha + (beta + 3.0)))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 2.0) + beta tmp = 0 if beta <= 2.85e+17: tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / t_0 else: tmp = ((1.0 + alpha) * ((1.0 - (alpha / beta)) / (alpha + (beta + 3.0)))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 2.0) + beta) tmp = 0.0 if (beta <= 2.85e+17) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(1.0 - Float64(alpha / beta)) / Float64(alpha + Float64(beta + 3.0)))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (alpha + 2.0) + beta;
tmp = 0.0;
if (beta <= 2.85e+17)
tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / t_0;
else
tmp = ((1.0 + alpha) * ((1.0 - (alpha / beta)) / (alpha + (beta + 3.0)))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]}, If[LessEqual[beta, 2.85e+17], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(1.0 - N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + 2\right) + \beta\\
\mathbf{if}\;\beta \leq 2.85 \cdot 10^{+17}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1 - \frac{\alpha}{\beta}}{\alpha + \left(\beta + 3\right)}}{t_0}\\
\end{array}
\end{array}
if beta < 2.85e17Initial program 99.9%
Simplified99.9%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 71.6%
+-commutative71.6%
+-commutative71.6%
Simplified71.6%
if 2.85e17 < beta Initial program 83.6%
Simplified87.7%
associate-*l/87.6%
+-commutative87.6%
associate-+r+87.6%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 84.6%
mul-1-neg84.6%
unsub-neg84.6%
Simplified84.6%
Taylor expanded in alpha around inf 84.6%
Final simplification75.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha 2.0) beta))) (* (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0))) (/ (+ 1.0 alpha) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / 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 + 2.0d0) + beta
code = (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + alpha) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 2.0) + beta return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 2.0) + beta) return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + alpha) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (alpha + 2.0) + beta;
tmp = (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / 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[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + 2\right) + \beta\\
\frac{\frac{1 + \beta}{t_0}}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{t_0}
\end{array}
\end{array}
Initial program 94.8%
Simplified84.1%
frac-times96.1%
*-commutative96.1%
associate-+r+96.1%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha 2.0) beta))) (/ (* (+ 1.0 alpha) (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0)))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
return ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.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 + 2.0d0) + beta
code = ((1.0d0 + alpha) * (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0)))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
return ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 2.0) + beta return ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 2.0) + beta) return Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0)))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (alpha + 2.0) + beta;
tmp = ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.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[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + 2\right) + \beta\\
\frac{\left(1 + \alpha\right) \cdot \frac{\frac{1 + \beta}{t_0}}{\alpha + \left(\beta + 3\right)}}{t_0}
\end{array}
\end{array}
Initial program 94.8%
Simplified96.1%
associate-*l/96.1%
+-commutative96.1%
associate-+r+96.1%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6e+17) (/ (/ (+ 1.0 beta) (* (+ beta 3.0) (+ 2.0 beta))) (+ (+ alpha 2.0) beta)) (/ (/ (- alpha -1.0) (+ alpha (+ 2.0 beta))) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6e+17) {
tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / ((alpha + 2.0) + beta);
} else {
tmp = ((alpha - -1.0) / (alpha + (2.0 + beta))) / (3.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 <= 6d+17) then
tmp = ((1.0d0 + beta) / ((beta + 3.0d0) * (2.0d0 + beta))) / ((alpha + 2.0d0) + beta)
else
tmp = ((alpha - (-1.0d0)) / (alpha + (2.0d0 + beta))) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6e+17) {
tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / ((alpha + 2.0) + beta);
} else {
tmp = ((alpha - -1.0) / (alpha + (2.0 + beta))) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6e+17: tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / ((alpha + 2.0) + beta) else: tmp = ((alpha - -1.0) / (alpha + (2.0 + beta))) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6e+17) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))) / Float64(Float64(alpha + 2.0) + beta)); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(alpha + Float64(2.0 + beta))) / Float64(3.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 <= 6e+17)
tmp = ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) / ((alpha + 2.0) + beta);
else
tmp = ((alpha - -1.0) / (alpha + (2.0 + beta))) / (3.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, 6e+17], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6 \cdot 10^{+17}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}}{\left(\alpha + 2\right) + \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\alpha + \left(2 + \beta\right)}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 6e17Initial program 99.9%
Simplified99.9%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 71.6%
+-commutative71.6%
+-commutative71.6%
Simplified71.6%
if 6e17 < beta Initial program 83.6%
associate-/l/75.8%
+-commutative75.8%
associate-+l+75.8%
*-commutative75.8%
metadata-eval75.8%
associate-+l+75.8%
metadata-eval75.8%
+-commutative75.8%
metadata-eval75.8%
metadata-eval75.8%
associate-+l+75.8%
Simplified75.8%
Taylor expanded in beta around -inf 86.3%
mul-1-neg86.3%
sub-neg86.3%
mul-1-neg86.3%
distribute-neg-in86.3%
+-commutative86.3%
mul-1-neg86.3%
distribute-lft-in86.3%
metadata-eval86.3%
mul-1-neg86.3%
unsub-neg86.3%
Simplified86.3%
expm1-log1p-u86.3%
expm1-udef52.1%
associate-+r+52.1%
*-commutative52.1%
+-commutative52.1%
Applied egg-rr52.1%
expm1-def86.3%
expm1-log1p86.3%
associate-/r*84.4%
+-commutative84.4%
+-commutative84.4%
associate-+r+84.4%
Simplified84.4%
Final simplification75.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.65e+16) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ beta 3.0) (+ 2.0 beta))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ 2.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.65e+16) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (2.0 + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.65d+16) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((beta + 3.0d0) * (2.0d0 + beta))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (2.0d0 + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.65e+16) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (2.0 + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.65e+16: tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (2.0 + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.65e+16) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(2.0 + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.65e+16)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (2.0 + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.65e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.65 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 2.65e16Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.3%
Taylor expanded in alpha around 0 70.9%
+-commutative70.9%
+-commutative70.9%
Simplified70.9%
if 2.65e16 < beta Initial program 83.6%
Simplified87.7%
Taylor expanded in beta around inf 83.9%
associate-*l/84.0%
+-commutative84.0%
Applied egg-rr84.0%
associate-*r/84.0%
*-rgt-identity84.0%
+-commutative84.0%
+-commutative84.0%
+-commutative84.0%
Simplified84.0%
Final simplification75.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1e+19) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ beta 3.0) (+ 2.0 beta))) (/ (/ (- alpha -1.0) (+ alpha (+ 2.0 beta))) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+19) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta));
} else {
tmp = ((alpha - -1.0) / (alpha + (2.0 + beta))) / (3.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 <= 1d+19) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((beta + 3.0d0) * (2.0d0 + beta))
else
tmp = ((alpha - (-1.0d0)) / (alpha + (2.0d0 + beta))) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+19) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta));
} else {
tmp = ((alpha - -1.0) / (alpha + (2.0 + beta))) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1e+19: tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta)) else: tmp = ((alpha - -1.0) / (alpha + (2.0 + beta))) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1e+19) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(alpha + Float64(2.0 + beta))) / Float64(3.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 <= 1e+19)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((beta + 3.0) * (2.0 + beta));
else
tmp = ((alpha - -1.0) / (alpha + (2.0 + beta))) / (3.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, 1e+19], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10^{+19}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\alpha + \left(2 + \beta\right)}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 1e19Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.3%
Taylor expanded in alpha around 0 70.9%
+-commutative70.9%
+-commutative70.9%
Simplified70.9%
if 1e19 < beta Initial program 83.6%
associate-/l/75.8%
+-commutative75.8%
associate-+l+75.8%
*-commutative75.8%
metadata-eval75.8%
associate-+l+75.8%
metadata-eval75.8%
+-commutative75.8%
metadata-eval75.8%
metadata-eval75.8%
associate-+l+75.8%
Simplified75.8%
Taylor expanded in beta around -inf 86.3%
mul-1-neg86.3%
sub-neg86.3%
mul-1-neg86.3%
distribute-neg-in86.3%
+-commutative86.3%
mul-1-neg86.3%
distribute-lft-in86.3%
metadata-eval86.3%
mul-1-neg86.3%
unsub-neg86.3%
Simplified86.3%
expm1-log1p-u86.3%
expm1-udef52.1%
associate-+r+52.1%
*-commutative52.1%
+-commutative52.1%
Applied egg-rr52.1%
expm1-def86.3%
expm1-log1p86.3%
associate-/r*84.4%
+-commutative84.4%
+-commutative84.4%
associate-+r+84.4%
Simplified84.4%
Final simplification75.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ 2.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (2.0 + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (2.0d0 + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (2.0 + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) / (alpha + (2.0 + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(2.0 + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((1.0 + alpha) / beta) / (alpha + (2.0 + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.3%
Taylor expanded in alpha around 0 70.4%
+-commutative70.4%
*-commutative70.4%
Simplified70.4%
Taylor expanded in beta around 0 70.4%
*-commutative70.4%
Simplified70.4%
if 2.5 < beta Initial program 84.2%
Simplified88.1%
Taylor expanded in beta around inf 82.4%
associate-*l/82.5%
+-commutative82.5%
Applied egg-rr82.5%
associate-*r/82.5%
*-rgt-identity82.5%
+-commutative82.5%
+-commutative82.5%
+-commutative82.5%
Simplified82.5%
Final simplification74.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.3%
Taylor expanded in alpha around 0 70.4%
+-commutative70.4%
*-commutative70.4%
Simplified70.4%
Taylor expanded in beta around 0 70.4%
*-commutative70.4%
Simplified70.4%
if 2.7999999999999998 < beta Initial program 84.2%
Simplified88.1%
Taylor expanded in beta around inf 82.4%
Taylor expanded in beta around inf 82.1%
Final simplification74.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta (+ 2.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (2.0d0 + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * (2.0 + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(2.0 + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * (2.0 + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.3%
Taylor expanded in alpha around 0 70.4%
+-commutative70.4%
*-commutative70.4%
Simplified70.4%
Taylor expanded in beta around 0 70.4%
*-commutative70.4%
Simplified70.4%
if 2.5 < beta Initial program 84.2%
Simplified88.1%
Taylor expanded in beta around inf 82.4%
Taylor expanded in alpha around 0 75.7%
+-commutative75.7%
Simplified75.7%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ 1.0 beta) (+ 2.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (2.0 + beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / (2.0d0 + beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (2.0 + beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = (1.0 / beta) / (2.0 + beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(1.0 / beta) / Float64(2.0 + beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = (1.0 / beta) / (2.0 + beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{2 + \beta}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.3%
Taylor expanded in alpha around 0 70.4%
+-commutative70.4%
*-commutative70.4%
Simplified70.4%
Taylor expanded in beta around 0 70.4%
*-commutative70.4%
Simplified70.4%
if 2.5 < beta Initial program 84.2%
Simplified88.1%
Taylor expanded in beta around inf 82.4%
expm1-log1p-u82.4%
expm1-udef50.9%
un-div-inv50.9%
+-commutative50.9%
Applied egg-rr50.9%
expm1-def82.5%
expm1-log1p82.5%
associate-/l/81.2%
+-commutative81.2%
+-commutative81.2%
+-commutative81.2%
Simplified81.2%
Taylor expanded in alpha around 0 75.7%
associate-/r*76.9%
+-commutative76.9%
Simplified76.9%
Final simplification72.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 0.2 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.2 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 0.2d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.2 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 0.2 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(0.2 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 0.2 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.2 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.2}{\beta}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.3%
Taylor expanded in alpha around 0 70.4%
+-commutative70.4%
*-commutative70.4%
Simplified70.4%
Taylor expanded in beta around 0 70.4%
*-commutative70.4%
Simplified70.4%
if 2.5 < beta Initial program 84.2%
Simplified88.1%
Taylor expanded in beta around 0 21.8%
Taylor expanded in alpha around 0 43.9%
+-commutative43.9%
*-commutative43.9%
Simplified43.9%
Taylor expanded in beta around inf 6.8%
Final simplification50.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ (+ alpha 2.0) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / ((alpha + 2.0) + beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / ((alpha + 2.0d0) + beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / ((alpha + 2.0) + beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / ((alpha + 2.0) + beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(Float64(alpha + 2.0) + beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / ((alpha + 2.0) + beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(N[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\left(\alpha + 2\right) + \beta}
\end{array}
Initial program 94.8%
Simplified96.1%
associate-*l/96.1%
+-commutative96.1%
associate-+r+96.1%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 73.5%
Taylor expanded in alpha around 0 50.3%
Final simplification50.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ 2.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (2.0d0 + beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (2.0 + beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(2.0 + beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (2.0 + beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{2 + \beta}
\end{array}
Initial program 94.8%
Simplified96.1%
associate-*l/96.1%
+-commutative96.1%
associate-+r+96.1%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 73.5%
Taylor expanded in alpha around 0 49.7%
Final simplification49.7%
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.8%
Simplified96.1%
Taylor expanded in beta around 0 74.5%
Taylor expanded in alpha around 0 61.9%
+-commutative61.9%
*-commutative61.9%
Simplified61.9%
Taylor expanded in beta around 0 48.7%
Final simplification48.7%
herbie shell --seed 2024019
(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)))