
(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 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 4.8e+115)
(/ (/ (* (+ 1.0 alpha) (+ beta 1.0)) t_0) (* (+ alpha (+ beta 3.0)) t_0))
(/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4.8e+115) {
tmp = (((1.0 + alpha) * (beta + 1.0)) / t_0) / ((alpha + (beta + 3.0)) * t_0);
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 4.8d+115) then
tmp = (((1.0d0 + alpha) * (beta + 1.0d0)) / t_0) / ((alpha + (beta + 3.0d0)) * t_0)
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4.8e+115) {
tmp = (((1.0 + alpha) * (beta + 1.0)) / t_0) / ((alpha + (beta + 3.0)) * t_0);
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 4.8e+115: tmp = (((1.0 + alpha) * (beta + 1.0)) / t_0) / ((alpha + (beta + 3.0)) * t_0) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 4.8e+115) tmp = Float64(Float64(Float64(Float64(1.0 + alpha) * Float64(beta + 1.0)) / t_0) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 4.8e+115)
tmp = (((1.0 + alpha) * (beta + 1.0)) / t_0) / ((alpha + (beta + 3.0)) * t_0);
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.8e+115], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 4.8 \cdot 10^{+115}:\\
\;\;\;\;\frac{\frac{\left(1 + \alpha\right) \cdot \left(\beta + 1\right)}{t\_0}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4.8000000000000001e115Initial program 98.5%
associate-/l/97.8%
+-commutative97.8%
associate-+l+97.8%
*-commutative97.8%
metadata-eval97.8%
associate-+l+97.8%
metadata-eval97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
metadata-eval97.8%
metadata-eval97.8%
associate-+l+97.8%
Simplified97.8%
div-inv97.8%
+-commutative97.8%
associate-+r+97.8%
*-commutative97.8%
associate-+r+97.8%
metadata-eval97.8%
+-commutative97.8%
*-commutative97.8%
associate-+r+97.8%
+-commutative97.8%
distribute-rgt1-in97.8%
fma-define97.8%
metadata-eval97.8%
associate-+r+97.8%
Applied egg-rr97.8%
associate-*r/97.8%
*-rgt-identity97.8%
+-commutative97.8%
fma-undefine97.8%
+-commutative97.8%
*-commutative97.8%
+-commutative97.8%
associate-+r+97.8%
distribute-lft1-in97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
Simplified97.8%
if 4.8000000000000001e115 < beta Initial program 65.0%
Taylor expanded in beta around inf 83.2%
Final simplification95.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 4e+59)
(/ (* (+ 1.0 alpha) (+ beta 1.0)) (* t_0 (* (+ alpha (+ beta 3.0)) t_0)))
(/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4e+59) {
tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 4d+59) then
tmp = ((1.0d0 + alpha) * (beta + 1.0d0)) / (t_0 * ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4e+59) {
tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 4e+59: tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * ((alpha + (beta + 3.0)) * t_0)) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 4e+59) tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(beta + 1.0)) / Float64(t_0 * Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 4e+59)
tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * ((alpha + (beta + 3.0)) * t_0));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+59], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+59}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \left(\beta + 1\right)}{t\_0 \cdot \left(\left(\alpha + \left(\beta + 3\right)\right) \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 3.99999999999999989e59Initial program 98.8%
Simplified90.8%
if 3.99999999999999989e59 < beta Initial program 75.0%
Taylor expanded in beta around inf 81.6%
Final simplification88.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.5)
(* 0.25 (/ 1.0 (+ beta (+ alpha 3.0))))
(if (<= beta 1.35e+154)
(/ (+ 1.0 alpha) (* (+ alpha (+ beta 3.0)) (+ alpha (+ beta 2.0))))
(/ (/ alpha beta) (+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.5) {
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
} else if (beta <= 1.35e+154) {
tmp = (1.0 + alpha) / ((alpha + (beta + 3.0)) * (alpha + (beta + 2.0)));
} else {
tmp = (alpha / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.5d0) then
tmp = 0.25d0 * (1.0d0 / (beta + (alpha + 3.0d0)))
else if (beta <= 1.35d+154) then
tmp = (1.0d0 + alpha) / ((alpha + (beta + 3.0d0)) * (alpha + (beta + 2.0d0)))
else
tmp = (alpha / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.5) {
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
} else if (beta <= 1.35e+154) {
tmp = (1.0 + alpha) / ((alpha + (beta + 3.0)) * (alpha + (beta + 2.0)));
} else {
tmp = (alpha / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.5: tmp = 0.25 * (1.0 / (beta + (alpha + 3.0))) elif beta <= 1.35e+154: tmp = (1.0 + alpha) / ((alpha + (beta + 3.0)) * (alpha + (beta + 2.0))) else: tmp = (alpha / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.5) tmp = Float64(0.25 * Float64(1.0 / Float64(beta + Float64(alpha + 3.0)))); elseif (beta <= 1.35e+154) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(alpha + Float64(beta + 2.0)))); else tmp = Float64(Float64(alpha / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.5)
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
elseif (beta <= 1.35e+154)
tmp = (1.0 + alpha) / ((alpha + (beta + 3.0)) * (alpha + (beta + 2.0)));
else
tmp = (alpha / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.5], N[(0.25 * N[(1.0 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.35e+154], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.5:\\
\;\;\;\;0.25 \cdot \frac{1}{\beta + \left(\alpha + 3\right)}\\
\mathbf{elif}\;\beta \leq 1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(\alpha + \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1.5Initial program 99.9%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
div-inv65.5%
div-inv65.5%
pow-flip65.5%
metadata-eval65.5%
metadata-eval65.5%
associate-+l+65.5%
metadata-eval65.5%
associate-+l+65.5%
+-commutative65.5%
associate-+l+65.5%
+-commutative65.5%
Applied egg-rr65.5%
Taylor expanded in beta around 0 65.5%
if 1.5 < beta < 1.35000000000000003e154Initial program 89.5%
associate-/l/89.3%
+-commutative89.3%
associate-+l+89.3%
*-commutative89.3%
metadata-eval89.3%
associate-+l+89.3%
metadata-eval89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
metadata-eval89.3%
metadata-eval89.3%
associate-+l+89.3%
Simplified89.3%
div-inv89.3%
+-commutative89.3%
associate-+r+89.3%
*-commutative89.3%
associate-+r+89.3%
metadata-eval89.3%
+-commutative89.3%
*-commutative89.3%
associate-+r+89.3%
+-commutative89.3%
distribute-rgt1-in89.3%
fma-define89.3%
metadata-eval89.3%
associate-+r+89.3%
Applied egg-rr89.3%
associate-*r/89.3%
*-rgt-identity89.3%
+-commutative89.3%
fma-undefine89.3%
+-commutative89.3%
*-commutative89.3%
+-commutative89.3%
associate-+r+89.3%
distribute-lft1-in89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
Simplified89.3%
Taylor expanded in beta around inf 84.6%
if 1.35000000000000003e154 < beta Initial program 60.6%
Taylor expanded in beta around inf 83.9%
Taylor expanded in alpha around inf 83.9%
Final simplification71.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 3.0))))
(if (<= beta 4.4)
(* 0.25 (/ 1.0 t_0))
(if (<= beta 1.35e+154)
(/ (+ 1.0 alpha) (* beta t_0))
(/ (/ alpha beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 3.0);
double tmp;
if (beta <= 4.4) {
tmp = 0.25 * (1.0 / t_0);
} else if (beta <= 1.35e+154) {
tmp = (1.0 + alpha) / (beta * t_0);
} else {
tmp = (alpha / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = beta + (alpha + 3.0d0)
if (beta <= 4.4d0) then
tmp = 0.25d0 * (1.0d0 / t_0)
else if (beta <= 1.35d+154) then
tmp = (1.0d0 + alpha) / (beta * t_0)
else
tmp = (alpha / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 3.0);
double tmp;
if (beta <= 4.4) {
tmp = 0.25 * (1.0 / t_0);
} else if (beta <= 1.35e+154) {
tmp = (1.0 + alpha) / (beta * t_0);
} else {
tmp = (alpha / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 3.0) tmp = 0 if beta <= 4.4: tmp = 0.25 * (1.0 / t_0) elif beta <= 1.35e+154: tmp = (1.0 + alpha) / (beta * t_0) else: tmp = (alpha / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 3.0)) tmp = 0.0 if (beta <= 4.4) tmp = Float64(0.25 * Float64(1.0 / t_0)); elseif (beta <= 1.35e+154) tmp = Float64(Float64(1.0 + alpha) / Float64(beta * t_0)); else tmp = Float64(Float64(alpha / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 3.0);
tmp = 0.0;
if (beta <= 4.4)
tmp = 0.25 * (1.0 / t_0);
elseif (beta <= 1.35e+154)
tmp = (1.0 + alpha) / (beta * t_0);
else
tmp = (alpha / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.4], N[(0.25 * N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.35e+154], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 3\right)\\
\mathbf{if}\;\beta \leq 4.4:\\
\;\;\;\;0.25 \cdot \frac{1}{t\_0}\\
\mathbf{elif}\;\beta \leq 1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.9%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
div-inv65.5%
div-inv65.5%
pow-flip65.5%
metadata-eval65.5%
metadata-eval65.5%
associate-+l+65.5%
metadata-eval65.5%
associate-+l+65.5%
+-commutative65.5%
associate-+l+65.5%
+-commutative65.5%
Applied egg-rr65.5%
Taylor expanded in beta around 0 65.5%
if 4.4000000000000004 < beta < 1.35000000000000003e154Initial program 89.5%
Taylor expanded in beta around inf 70.1%
*-un-lft-identity70.1%
associate-/l/76.4%
metadata-eval76.4%
associate-+l+76.4%
metadata-eval76.4%
associate-+l+76.4%
+-commutative76.4%
associate-+l+76.4%
+-commutative76.4%
Applied egg-rr76.4%
*-lft-identity76.4%
*-commutative76.4%
+-commutative76.4%
Simplified76.4%
if 1.35000000000000003e154 < beta Initial program 60.6%
Taylor expanded in beta around inf 83.9%
Taylor expanded in alpha around inf 83.9%
Final simplification70.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.3e+20) (/ (/ (+ beta 1.0) (+ beta 2.0)) (+ 6.0 (* beta (+ beta 5.0)))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.3e+20) {
tmp = ((beta + 1.0) / (beta + 2.0)) / (6.0 + (beta * (beta + 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.3d+20) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / (6.0d0 + (beta * (beta + 5.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.3e+20) {
tmp = ((beta + 1.0) / (beta + 2.0)) / (6.0 + (beta * (beta + 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.3e+20: tmp = ((beta + 1.0) / (beta + 2.0)) / (6.0 + (beta * (beta + 5.0))) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.3e+20) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(6.0 + Float64(beta * Float64(beta + 5.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.3e+20)
tmp = ((beta + 1.0) / (beta + 2.0)) / (6.0 + (beta * (beta + 5.0)));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.3e+20], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+20}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{6 + \beta \cdot \left(\beta + 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1.3e20Initial program 99.9%
Simplified91.8%
Taylor expanded in beta around 0 91.8%
Taylor expanded in alpha around 0 64.1%
associate-/r*64.1%
+-commutative64.1%
+-commutative64.1%
+-commutative64.1%
Simplified64.1%
if 1.3e20 < beta Initial program 76.5%
Taylor expanded in beta around inf 76.3%
Final simplification67.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (* 0.25 (/ 1.0 (+ beta (+ alpha 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = 0.25d0 * (1.0d0 / (beta + (alpha + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.25 * (1.0 / (beta + (alpha + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(0.25 * Float64(1.0 / Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(0.25 * N[(1.0 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;0.25 \cdot \frac{1}{\beta + \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
div-inv65.5%
div-inv65.5%
pow-flip65.5%
metadata-eval65.5%
metadata-eval65.5%
associate-+l+65.5%
metadata-eval65.5%
associate-+l+65.5%
+-commutative65.5%
associate-+l+65.5%
+-commutative65.5%
Applied egg-rr65.5%
Taylor expanded in beta around 0 65.5%
if 4.5 < beta Initial program 77.3%
Taylor expanded in beta around inf 76.0%
Final simplification68.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 3.0)))) (if (<= beta 4.4) (* 0.25 (/ 1.0 t_0)) (/ (+ 1.0 alpha) (* beta t_0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 3.0);
double tmp;
if (beta <= 4.4) {
tmp = 0.25 * (1.0 / t_0);
} else {
tmp = (1.0 + alpha) / (beta * t_0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = beta + (alpha + 3.0d0)
if (beta <= 4.4d0) then
tmp = 0.25d0 * (1.0d0 / t_0)
else
tmp = (1.0d0 + alpha) / (beta * t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 3.0);
double tmp;
if (beta <= 4.4) {
tmp = 0.25 * (1.0 / t_0);
} else {
tmp = (1.0 + alpha) / (beta * t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 3.0) tmp = 0 if beta <= 4.4: tmp = 0.25 * (1.0 / t_0) else: tmp = (1.0 + alpha) / (beta * t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 3.0)) tmp = 0.0 if (beta <= 4.4) tmp = Float64(0.25 * Float64(1.0 / t_0)); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 3.0);
tmp = 0.0;
if (beta <= 4.4)
tmp = 0.25 * (1.0 / t_0);
else
tmp = (1.0 + alpha) / (beta * t_0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.4], N[(0.25 * N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 3\right)\\
\mathbf{if}\;\beta \leq 4.4:\\
\;\;\;\;0.25 \cdot \frac{1}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot t\_0}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.9%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
div-inv65.5%
div-inv65.5%
pow-flip65.5%
metadata-eval65.5%
metadata-eval65.5%
associate-+l+65.5%
metadata-eval65.5%
associate-+l+65.5%
+-commutative65.5%
associate-+l+65.5%
+-commutative65.5%
Applied egg-rr65.5%
Taylor expanded in beta around 0 65.5%
if 4.4000000000000004 < beta Initial program 77.3%
Taylor expanded in beta around inf 76.0%
*-un-lft-identity76.0%
associate-/l/80.9%
metadata-eval80.9%
associate-+l+80.9%
metadata-eval80.9%
associate-+l+80.9%
+-commutative80.9%
associate-+l+80.9%
+-commutative80.9%
Applied egg-rr80.9%
*-lft-identity80.9%
*-commutative80.9%
+-commutative80.9%
Simplified80.9%
Final simplification70.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.4) (* 0.25 (/ 1.0 (+ beta (+ alpha 3.0)))) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.4d0) then
tmp = 0.25d0 * (1.0d0 / (beta + (alpha + 3.0d0)))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.4: tmp = 0.25 * (1.0 / (beta + (alpha + 3.0))) else: tmp = (1.0 / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.4) tmp = Float64(0.25 * Float64(1.0 / Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.4)
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.4], N[(0.25 * N[(1.0 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.4:\\
\;\;\;\;0.25 \cdot \frac{1}{\beta + \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.9%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
div-inv65.5%
div-inv65.5%
pow-flip65.5%
metadata-eval65.5%
metadata-eval65.5%
associate-+l+65.5%
metadata-eval65.5%
associate-+l+65.5%
+-commutative65.5%
associate-+l+65.5%
+-commutative65.5%
Applied egg-rr65.5%
Taylor expanded in beta around 0 65.5%
if 4.4000000000000004 < beta Initial program 77.3%
Taylor expanded in alpha around 0 79.2%
+-commutative79.2%
Simplified79.2%
Taylor expanded in beta around inf 79.3%
*-un-lft-identity79.3%
associate-/l/80.2%
metadata-eval80.2%
associate-+l+80.2%
+-commutative80.2%
metadata-eval80.2%
associate-+r+80.2%
Applied egg-rr80.2%
*-lft-identity80.2%
associate-/r*79.3%
*-lft-identity79.3%
associate-*l/79.1%
associate-*r/79.3%
*-rgt-identity79.3%
+-commutative79.3%
Simplified79.3%
Taylor expanded in alpha around 0 76.3%
associate-/r*76.4%
Simplified76.4%
Final simplification69.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.2) (* 0.25 (/ 1.0 (+ beta (+ alpha 3.0)))) (/ (/ 1.0 (+ beta 2.0)) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
} else {
tmp = (1.0 / (beta + 2.0)) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.2d0) then
tmp = 0.25d0 * (1.0d0 / (beta + (alpha + 3.0d0)))
else
tmp = (1.0d0 / (beta + 2.0d0)) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
} else {
tmp = (1.0 / (beta + 2.0)) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.25 * (1.0 / (beta + (alpha + 3.0))) else: tmp = (1.0 / (beta + 2.0)) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.25 * Float64(1.0 / Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.25 * (1.0 / (beta + (alpha + 3.0)));
else
tmp = (1.0 / (beta + 2.0)) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.2], N[(0.25 * N[(1.0 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.25 \cdot \frac{1}{\beta + \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta + 2}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
div-inv65.5%
div-inv65.5%
pow-flip65.5%
metadata-eval65.5%
metadata-eval65.5%
associate-+l+65.5%
metadata-eval65.5%
associate-+l+65.5%
+-commutative65.5%
associate-+l+65.5%
+-commutative65.5%
Applied egg-rr65.5%
Taylor expanded in beta around 0 65.5%
if 2.2000000000000002 < beta Initial program 77.3%
associate-/l/76.9%
+-commutative76.9%
associate-+l+76.9%
*-commutative76.9%
metadata-eval76.9%
associate-+l+76.9%
metadata-eval76.9%
+-commutative76.9%
+-commutative76.9%
+-commutative76.9%
metadata-eval76.9%
metadata-eval76.9%
associate-+l+76.9%
Simplified76.9%
div-inv76.9%
+-commutative76.9%
associate-+r+76.9%
*-commutative76.9%
associate-+r+76.9%
metadata-eval76.9%
+-commutative76.9%
*-commutative76.9%
associate-+r+76.9%
+-commutative76.9%
distribute-rgt1-in76.9%
fma-define76.9%
metadata-eval76.9%
associate-+r+76.9%
Applied egg-rr76.9%
associate-*r/76.9%
*-rgt-identity76.9%
+-commutative76.9%
fma-undefine76.9%
+-commutative76.9%
*-commutative76.9%
+-commutative76.9%
associate-+r+76.9%
distribute-lft1-in76.9%
+-commutative76.9%
+-commutative76.9%
+-commutative76.9%
+-commutative76.9%
+-commutative76.9%
+-commutative76.9%
+-commutative76.9%
+-commutative76.9%
+-commutative76.9%
+-commutative76.9%
Simplified76.9%
Taylor expanded in beta around inf 85.7%
Taylor expanded in alpha around 0 76.3%
associate-/r*76.4%
+-commutative76.4%
Simplified76.4%
Final simplification69.0%
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 (+ beta 3.0)))))
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 * (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 <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
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 * (beta + 3.0)) 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(beta + 3.0))); 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 * (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, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $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(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
Simplified91.7%
Taylor expanded in beta around 0 91.7%
Taylor expanded in alpha around 0 64.0%
associate-/r*64.1%
+-commutative64.1%
+-commutative64.1%
+-commutative64.1%
Simplified64.1%
Taylor expanded in beta around 0 64.0%
*-commutative64.0%
Simplified64.0%
if 2.5 < beta Initial program 77.3%
Taylor expanded in beta around inf 76.0%
Taylor expanded in alpha around 0 76.3%
+-commutative76.3%
Simplified76.3%
Final simplification68.0%
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) (+ beta 3.0))))
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) / (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 <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
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) / (beta + 3.0) 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(beta + 3.0)); 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) / (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, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $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}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
Simplified91.7%
Taylor expanded in beta around 0 91.7%
Taylor expanded in alpha around 0 64.0%
associate-/r*64.1%
+-commutative64.1%
+-commutative64.1%
+-commutative64.1%
Simplified64.1%
Taylor expanded in beta around 0 64.0%
*-commutative64.0%
Simplified64.0%
if 2.5 < beta Initial program 77.3%
Taylor expanded in alpha around 0 79.2%
+-commutative79.2%
Simplified79.2%
Taylor expanded in beta around inf 79.3%
*-un-lft-identity79.3%
associate-/l/80.2%
metadata-eval80.2%
associate-+l+80.2%
+-commutative80.2%
metadata-eval80.2%
associate-+r+80.2%
Applied egg-rr80.2%
*-lft-identity80.2%
associate-/r*79.3%
*-lft-identity79.3%
associate-*l/79.1%
associate-*r/79.3%
*-rgt-identity79.3%
+-commutative79.3%
Simplified79.3%
Taylor expanded in alpha around 0 76.3%
associate-/r*76.4%
Simplified76.4%
Final simplification68.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.8) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / 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.8d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.8: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.8) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.8)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 0.3333333333333333 / 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.8], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.8:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 3.7999999999999998Initial program 99.9%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
Taylor expanded in beta around 0 65.0%
Taylor expanded in alpha around 0 63.1%
*-commutative63.1%
Simplified63.1%
if 3.7999999999999998 < beta Initial program 77.3%
Taylor expanded in beta around inf 76.0%
Taylor expanded in beta around 0 20.5%
associate-/r*6.7%
Simplified6.7%
Taylor expanded in alpha around 0 6.7%
Final simplification44.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.7) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / 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.7d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.7) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.7)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 0.3333333333333333 / 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.7], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.7:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial program 99.9%
Simplified91.7%
Taylor expanded in beta around 0 91.7%
Taylor expanded in alpha around 0 64.0%
associate-/r*64.1%
+-commutative64.1%
+-commutative64.1%
+-commutative64.1%
Simplified64.1%
Taylor expanded in beta around 0 64.0%
*-commutative64.0%
Simplified64.0%
if 2.7000000000000002 < beta Initial program 77.3%
Taylor expanded in beta around inf 76.0%
Taylor expanded in beta around 0 20.5%
associate-/r*6.7%
Simplified6.7%
Taylor expanded in alpha around 0 6.7%
Final simplification45.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5e+108) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta alpha))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+108) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * alpha);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5d+108) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / (beta * alpha)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+108) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * alpha);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5e+108: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / (beta * alpha) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5e+108) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(beta * alpha)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5e+108)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 1.0 / (beta * alpha);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5e+108], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * alpha), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5 \cdot 10^{+108}:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \alpha}\\
\end{array}
\end{array}
if beta < 4.99999999999999991e108Initial program 98.4%
Taylor expanded in alpha around 0 65.9%
+-commutative65.9%
Simplified65.9%
Taylor expanded in beta around 0 55.3%
if 4.99999999999999991e108 < beta Initial program 67.8%
Taylor expanded in alpha around 0 87.1%
+-commutative87.1%
Simplified87.1%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around inf 22.9%
*-commutative22.9%
Simplified22.9%
Final simplification49.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) 0.08333333333333333 (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.08333333333333333 else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = 0.08333333333333333; else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.08333333333333333;
else
tmp = 0.3333333333333333 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], 0.08333333333333333, N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
Taylor expanded in beta around 0 65.0%
Taylor expanded in alpha around 0 63.5%
if 4 < beta Initial program 77.3%
Taylor expanded in beta around inf 76.0%
Taylor expanded in beta around 0 20.5%
associate-/r*6.7%
Simplified6.7%
Taylor expanded in alpha around 0 6.7%
Final simplification45.1%
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 92.6%
Taylor expanded in alpha around 0 69.9%
+-commutative69.9%
Simplified69.9%
Taylor expanded in beta around 0 45.6%
Taylor expanded in alpha around 0 44.2%
Final simplification44.2%
herbie shell --seed 2024074
(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)))