
(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 (+ beta 2.0))) (t_1 (+ (+ alpha beta) 2.0)))
(if (<= beta 5.5e+153)
(/
1.0
(*
(/ (+ alpha (+ beta 3.0)) (/ (* (+ 1.0 alpha) (+ 1.0 beta)) t_0))
t_0))
(/
(/ 1.0 (/ t_1 (* (+ 1.0 alpha) (+ 1.0 (/ (- -1.0 alpha) beta)))))
(+ 1.0 t_1)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double t_1 = (alpha + beta) + 2.0;
double tmp;
if (beta <= 5.5e+153) {
tmp = 1.0 / (((alpha + (beta + 3.0)) / (((1.0 + alpha) * (1.0 + beta)) / t_0)) * t_0);
} else {
tmp = (1.0 / (t_1 / ((1.0 + alpha) * (1.0 + ((-1.0 - alpha) / beta))))) / (1.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 + 2.0d0)
t_1 = (alpha + beta) + 2.0d0
if (beta <= 5.5d+153) then
tmp = 1.0d0 / (((alpha + (beta + 3.0d0)) / (((1.0d0 + alpha) * (1.0d0 + beta)) / t_0)) * t_0)
else
tmp = (1.0d0 / (t_1 / ((1.0d0 + alpha) * (1.0d0 + (((-1.0d0) - alpha) / beta))))) / (1.0d0 + t_1)
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 t_1 = (alpha + beta) + 2.0;
double tmp;
if (beta <= 5.5e+153) {
tmp = 1.0 / (((alpha + (beta + 3.0)) / (((1.0 + alpha) * (1.0 + beta)) / t_0)) * t_0);
} else {
tmp = (1.0 / (t_1 / ((1.0 + alpha) * (1.0 + ((-1.0 - alpha) / beta))))) / (1.0 + t_1);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) t_1 = (alpha + beta) + 2.0 tmp = 0 if beta <= 5.5e+153: tmp = 1.0 / (((alpha + (beta + 3.0)) / (((1.0 + alpha) * (1.0 + beta)) / t_0)) * t_0) else: tmp = (1.0 / (t_1 / ((1.0 + alpha) * (1.0 + ((-1.0 - alpha) / beta))))) / (1.0 + t_1) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) t_1 = Float64(Float64(alpha + beta) + 2.0) tmp = 0.0 if (beta <= 5.5e+153) tmp = Float64(1.0 / Float64(Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 + beta)) / t_0)) * t_0)); else tmp = Float64(Float64(1.0 / Float64(t_1 / Float64(Float64(1.0 + alpha) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))))) / Float64(1.0 + t_1)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
t_1 = (alpha + beta) + 2.0;
tmp = 0.0;
if (beta <= 5.5e+153)
tmp = 1.0 / (((alpha + (beta + 3.0)) / (((1.0 + alpha) * (1.0 + beta)) / t_0)) * t_0);
else
tmp = (1.0 / (t_1 / ((1.0 + alpha) * (1.0 + ((-1.0 - alpha) / beta))))) / (1.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 + 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 5.5e+153], N[(1.0 / N[(N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(t$95$1 / N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
t_1 := \left(\alpha + \beta\right) + 2\\
\mathbf{if}\;\beta \leq 5.5 \cdot 10^{+153}:\\
\;\;\;\;\frac{1}{\frac{\alpha + \left(\beta + 3\right)}{\frac{\left(1 + \alpha\right) \cdot \left(1 + \beta\right)}{t\_0}} \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\frac{t\_1}{\left(1 + \alpha\right) \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)}}}{1 + t\_1}\\
\end{array}
\end{array}
if beta < 5.5000000000000003e153Initial program 98.4%
associate-/l/98.0%
+-commutative98.0%
associate-+l+98.0%
*-commutative98.0%
metadata-eval98.0%
associate-+l+98.0%
metadata-eval98.0%
+-commutative98.0%
+-commutative98.0%
+-commutative98.0%
metadata-eval98.0%
metadata-eval98.0%
associate-+l+98.0%
Simplified98.0%
clear-num98.0%
inv-pow98.0%
*-commutative98.0%
associate-+r+98.0%
+-commutative98.0%
distribute-rgt1-in98.0%
fma-define98.0%
Applied egg-rr98.0%
unpow-198.0%
associate-/l*98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
fma-undefine98.5%
+-commutative98.5%
*-commutative98.5%
+-commutative98.5%
associate-+r+98.5%
distribute-lft1-in98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
Simplified98.5%
if 5.5000000000000003e153 < beta Initial program 57.8%
clear-num57.8%
inv-pow57.8%
metadata-eval57.8%
associate-+r+57.8%
+-commutative57.8%
*-commutative57.8%
associate-+r+57.8%
+-commutative57.8%
distribute-rgt1-in57.8%
fma-define57.8%
metadata-eval57.8%
associate-+r+57.8%
Applied egg-rr57.8%
unpow-157.8%
associate-/r/57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
fma-undefine57.7%
+-commutative57.7%
*-commutative57.7%
+-commutative57.7%
associate-+r+57.7%
distribute-lft1-in57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
Simplified57.7%
clear-num57.8%
inv-pow57.8%
associate-+l+57.8%
Applied egg-rr57.8%
unpow-157.8%
associate-/l*100.0%
+-commutative100.0%
+-commutative100.0%
+-commutative100.0%
Simplified100.0%
associate-*l/100.0%
*-un-lft-identity100.0%
associate-+l+100.0%
+-commutative100.0%
+-commutative100.0%
*-commutative100.0%
+-commutative100.0%
+-commutative100.0%
+-commutative100.0%
+-commutative100.0%
Applied egg-rr100.0%
associate-+r+100.0%
+-commutative100.0%
associate-*l/57.8%
associate-/l*100.0%
+-commutative100.0%
associate-+r+100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in beta around inf 88.2%
associate-*r/88.2%
mul-1-neg88.2%
Simplified88.2%
Final simplification96.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1.15e+154)
(/
1.0
(*
(/ (+ alpha (+ beta 3.0)) (/ (* (+ 1.0 alpha) (+ 1.0 beta)) t_0))
t_0))
(/
(/ 1.0 (* (/ 1.0 (+ 1.0 alpha)) t_0))
(+ 1.0 (+ (+ alpha beta) 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.15e+154) {
tmp = 1.0 / (((alpha + (beta + 3.0)) / (((1.0 + alpha) * (1.0 + beta)) / t_0)) * t_0);
} else {
tmp = (1.0 / ((1.0 / (1.0 + alpha)) * t_0)) / (1.0 + ((alpha + beta) + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.15d+154) then
tmp = 1.0d0 / (((alpha + (beta + 3.0d0)) / (((1.0d0 + alpha) * (1.0d0 + beta)) / t_0)) * t_0)
else
tmp = (1.0d0 / ((1.0d0 / (1.0d0 + alpha)) * t_0)) / (1.0d0 + ((alpha + beta) + 2.0d0))
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 <= 1.15e+154) {
tmp = 1.0 / (((alpha + (beta + 3.0)) / (((1.0 + alpha) * (1.0 + beta)) / t_0)) * t_0);
} else {
tmp = (1.0 / ((1.0 / (1.0 + alpha)) * t_0)) / (1.0 + ((alpha + beta) + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.15e+154: tmp = 1.0 / (((alpha + (beta + 3.0)) / (((1.0 + alpha) * (1.0 + beta)) / t_0)) * t_0) else: tmp = (1.0 / ((1.0 / (1.0 + alpha)) * t_0)) / (1.0 + ((alpha + beta) + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.15e+154) tmp = Float64(1.0 / Float64(Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 + beta)) / t_0)) * t_0)); else tmp = Float64(Float64(1.0 / Float64(Float64(1.0 / Float64(1.0 + alpha)) * t_0)) / Float64(1.0 + Float64(Float64(alpha + beta) + 2.0))); 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 <= 1.15e+154)
tmp = 1.0 / (((alpha + (beta + 3.0)) / (((1.0 + alpha) * (1.0 + beta)) / t_0)) * t_0);
else
tmp = (1.0 / ((1.0 / (1.0 + alpha)) * t_0)) / (1.0 + ((alpha + beta) + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.15e+154], N[(1.0 / N[(N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[(1.0 / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(N[(alpha + beta), $MachinePrecision] + 2.0), $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 1.15 \cdot 10^{+154}:\\
\;\;\;\;\frac{1}{\frac{\alpha + \left(\beta + 3\right)}{\frac{\left(1 + \alpha\right) \cdot \left(1 + \beta\right)}{t\_0}} \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\frac{1}{1 + \alpha} \cdot t\_0}}{1 + \left(\left(\alpha + \beta\right) + 2\right)}\\
\end{array}
\end{array}
if beta < 1.15e154Initial program 98.4%
associate-/l/98.0%
+-commutative98.0%
associate-+l+98.0%
*-commutative98.0%
metadata-eval98.0%
associate-+l+98.0%
metadata-eval98.0%
+-commutative98.0%
+-commutative98.0%
+-commutative98.0%
metadata-eval98.0%
metadata-eval98.0%
associate-+l+98.0%
Simplified98.0%
clear-num98.0%
inv-pow98.0%
*-commutative98.0%
associate-+r+98.0%
+-commutative98.0%
distribute-rgt1-in98.0%
fma-define98.0%
Applied egg-rr98.0%
unpow-198.0%
associate-/l*98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
fma-undefine98.5%
+-commutative98.5%
*-commutative98.5%
+-commutative98.5%
associate-+r+98.5%
distribute-lft1-in98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
Simplified98.5%
if 1.15e154 < beta Initial program 57.8%
clear-num57.8%
inv-pow57.8%
metadata-eval57.8%
associate-+r+57.8%
+-commutative57.8%
*-commutative57.8%
associate-+r+57.8%
+-commutative57.8%
distribute-rgt1-in57.8%
fma-define57.8%
metadata-eval57.8%
associate-+r+57.8%
Applied egg-rr57.8%
unpow-157.8%
associate-/r/57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
fma-undefine57.7%
+-commutative57.7%
*-commutative57.7%
+-commutative57.7%
associate-+r+57.7%
distribute-lft1-in57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
+-commutative57.7%
Simplified57.7%
Taylor expanded in beta around inf 87.9%
+-commutative87.9%
Simplified87.9%
Final simplification96.7%
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)) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 5e+99)
(/ (* (+ 1.0 alpha) (+ 1.0 beta)) (* t_1 (* t_1 (+ alpha (+ beta 3.0)))))
(/ (/ 1.0 (/ t_0 (+ 1.0 alpha))) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+99) {
tmp = ((1.0 + alpha) * (1.0 + beta)) / (t_1 * (t_1 * (alpha + (beta + 3.0))));
} else {
tmp = (1.0 / (t_0 / (1.0 + alpha))) / (1.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) :: t_1
real(8) :: tmp
t_0 = (alpha + beta) + 2.0d0
t_1 = alpha + (beta + 2.0d0)
if (beta <= 5d+99) then
tmp = ((1.0d0 + alpha) * (1.0d0 + beta)) / (t_1 * (t_1 * (alpha + (beta + 3.0d0))))
else
tmp = (1.0d0 / (t_0 / (1.0d0 + alpha))) / (1.0d0 + t_0)
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 t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+99) {
tmp = ((1.0 + alpha) * (1.0 + beta)) / (t_1 * (t_1 * (alpha + (beta + 3.0))));
} else {
tmp = (1.0 / (t_0 / (1.0 + alpha))) / (1.0 + t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + beta) + 2.0 t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 5e+99: tmp = ((1.0 + alpha) * (1.0 + beta)) / (t_1 * (t_1 * (alpha + (beta + 3.0)))) else: tmp = (1.0 / (t_0 / (1.0 + alpha))) / (1.0 + t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + 2.0) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5e+99) tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 + beta)) / Float64(t_1 * Float64(t_1 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(1.0 / Float64(t_0 / Float64(1.0 + alpha))) / Float64(1.0 + t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (alpha + beta) + 2.0;
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 5e+99)
tmp = ((1.0 + alpha) * (1.0 + beta)) / (t_1 * (t_1 * (alpha + (beta + 3.0))));
else
tmp = (1.0 / (t_0 / (1.0 + alpha))) / (1.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 + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+99], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * N[(t$95$1 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(t$95$0 / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+99}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \left(1 + \beta\right)}{t\_1 \cdot \left(t\_1 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\frac{t\_0}{1 + \alpha}}}{1 + t\_0}\\
\end{array}
\end{array}
if beta < 5.00000000000000008e99Initial program 98.8%
Simplified93.6%
if 5.00000000000000008e99 < beta Initial program 69.6%
clear-num69.7%
inv-pow69.7%
metadata-eval69.7%
associate-+r+69.7%
+-commutative69.7%
*-commutative69.7%
associate-+r+69.7%
+-commutative69.7%
distribute-rgt1-in69.7%
fma-define69.7%
metadata-eval69.7%
associate-+r+69.7%
Applied egg-rr69.7%
unpow-169.7%
associate-/r/69.6%
+-commutative69.6%
+-commutative69.6%
+-commutative69.6%
+-commutative69.6%
fma-undefine69.6%
+-commutative69.6%
*-commutative69.6%
+-commutative69.6%
associate-+r+69.6%
distribute-lft1-in69.6%
+-commutative69.6%
+-commutative69.6%
+-commutative69.6%
+-commutative69.6%
+-commutative69.6%
Simplified69.6%
clear-num69.7%
inv-pow69.7%
associate-+l+69.7%
Applied egg-rr69.7%
unpow-169.7%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
*-un-lft-identity99.8%
associate-+l+99.8%
+-commutative99.8%
+-commutative99.8%
*-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
associate-+r+99.8%
+-commutative99.8%
associate-*l/69.7%
associate-/l*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 88.7%
Final simplification92.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) 2.0))) (/ (/ 1.0 (/ t_0 (* (+ 1.0 alpha) (/ (+ 1.0 beta) t_0)))) (+ 1.0 t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
return (1.0 / (t_0 / ((1.0 + alpha) * ((1.0 + beta) / t_0)))) / (1.0 + t_0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + 2.0d0
code = (1.0d0 / (t_0 / ((1.0d0 + alpha) * ((1.0d0 + beta) / t_0)))) / (1.0d0 + t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
return (1.0 / (t_0 / ((1.0 + alpha) * ((1.0 + beta) / t_0)))) / (1.0 + t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + beta) + 2.0 return (1.0 / (t_0 / ((1.0 + alpha) * ((1.0 + beta) / t_0)))) / (1.0 + t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + 2.0) return Float64(Float64(1.0 / Float64(t_0 / Float64(Float64(1.0 + alpha) * Float64(Float64(1.0 + beta) / t_0)))) / Float64(1.0 + t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (alpha + beta) + 2.0;
tmp = (1.0 / (t_0 / ((1.0 + alpha) * ((1.0 + beta) / t_0)))) / (1.0 + t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, N[(N[(1.0 / N[(t$95$0 / N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2\\
\frac{\frac{1}{\frac{t\_0}{\left(1 + \alpha\right) \cdot \frac{1 + \beta}{t\_0}}}}{1 + t\_0}
\end{array}
\end{array}
Initial program 91.7%
clear-num91.7%
inv-pow91.7%
metadata-eval91.7%
associate-+r+91.7%
+-commutative91.7%
*-commutative91.7%
associate-+r+91.7%
+-commutative91.7%
distribute-rgt1-in91.7%
fma-define91.7%
metadata-eval91.7%
associate-+r+91.7%
Applied egg-rr91.7%
unpow-191.7%
associate-/r/91.7%
+-commutative91.7%
+-commutative91.7%
+-commutative91.7%
+-commutative91.7%
fma-undefine91.7%
+-commutative91.7%
*-commutative91.7%
+-commutative91.7%
associate-+r+91.7%
distribute-lft1-in91.7%
+-commutative91.7%
+-commutative91.7%
+-commutative91.7%
+-commutative91.7%
+-commutative91.7%
Simplified91.7%
clear-num91.7%
inv-pow91.7%
associate-+l+91.7%
Applied egg-rr91.7%
unpow-191.7%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
*-un-lft-identity99.8%
associate-+l+99.8%
+-commutative99.8%
+-commutative99.8%
*-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
associate-+r+99.8%
+-commutative99.8%
associate-*l/91.7%
associate-/l*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 65.0)
(/
(/ 1.0 (* (+ alpha (+ beta 2.0)) (/ (+ alpha 2.0) (+ 1.0 alpha))))
(+ alpha 3.0))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 65.0) {
tmp = (1.0 / ((alpha + (beta + 2.0)) * ((alpha + 2.0) / (1.0 + alpha)))) / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 65.0d0) then
tmp = (1.0d0 / ((alpha + (beta + 2.0d0)) * ((alpha + 2.0d0) / (1.0d0 + alpha)))) / (alpha + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 65.0) {
tmp = (1.0 / ((alpha + (beta + 2.0)) * ((alpha + 2.0) / (1.0 + alpha)))) / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 65.0: tmp = (1.0 / ((alpha + (beta + 2.0)) * ((alpha + 2.0) / (1.0 + alpha)))) / (alpha + 3.0) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 65.0) tmp = Float64(Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(alpha + 2.0) / Float64(1.0 + alpha)))) / Float64(alpha + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 65.0)
tmp = (1.0 / ((alpha + (beta + 2.0)) * ((alpha + 2.0) / (1.0 + alpha)))) / (alpha + 3.0);
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 65.0], N[(N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 65:\\
\;\;\;\;\frac{\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \frac{\alpha + 2}{1 + \alpha}}}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 65Initial program 99.8%
clear-num99.8%
inv-pow99.8%
metadata-eval99.8%
associate-+r+99.8%
+-commutative99.8%
*-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
distribute-rgt1-in99.8%
fma-define99.8%
metadata-eval99.8%
associate-+r+99.8%
Applied egg-rr99.8%
unpow-199.8%
associate-/r/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
fma-undefine99.8%
+-commutative99.8%
*-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
distribute-lft1-in99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.9%
+-commutative97.9%
Simplified97.9%
Taylor expanded in beta around 0 97.4%
+-commutative97.4%
Simplified97.4%
if 65 < beta Initial program 76.3%
Taylor expanded in beta around inf 81.9%
Taylor expanded in alpha around 0 81.9%
+-commutative81.9%
associate-+r+81.9%
+-commutative81.9%
Simplified81.9%
Final simplification92.1%
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 18.0)
(/
(/ 1.0 (* (+ alpha (+ beta 2.0)) (/ (+ alpha 2.0) (+ 1.0 alpha))))
(+ alpha 3.0))
(/ (/ 1.0 (/ t_0 (+ 1.0 alpha))) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
double tmp;
if (beta <= 18.0) {
tmp = (1.0 / ((alpha + (beta + 2.0)) * ((alpha + 2.0) / (1.0 + alpha)))) / (alpha + 3.0);
} else {
tmp = (1.0 / (t_0 / (1.0 + alpha))) / (1.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 + beta) + 2.0d0
if (beta <= 18.0d0) then
tmp = (1.0d0 / ((alpha + (beta + 2.0d0)) * ((alpha + 2.0d0) / (1.0d0 + alpha)))) / (alpha + 3.0d0)
else
tmp = (1.0d0 / (t_0 / (1.0d0 + alpha))) / (1.0d0 + t_0)
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 <= 18.0) {
tmp = (1.0 / ((alpha + (beta + 2.0)) * ((alpha + 2.0) / (1.0 + alpha)))) / (alpha + 3.0);
} else {
tmp = (1.0 / (t_0 / (1.0 + alpha))) / (1.0 + t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + beta) + 2.0 tmp = 0 if beta <= 18.0: tmp = (1.0 / ((alpha + (beta + 2.0)) * ((alpha + 2.0) / (1.0 + alpha)))) / (alpha + 3.0) else: tmp = (1.0 / (t_0 / (1.0 + alpha))) / (1.0 + t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + 2.0) tmp = 0.0 if (beta <= 18.0) tmp = Float64(Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(alpha + 2.0) / Float64(1.0 + alpha)))) / Float64(alpha + 3.0)); else tmp = Float64(Float64(1.0 / Float64(t_0 / Float64(1.0 + alpha))) / Float64(1.0 + t_0)); 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 <= 18.0)
tmp = (1.0 / ((alpha + (beta + 2.0)) * ((alpha + 2.0) / (1.0 + alpha)))) / (alpha + 3.0);
else
tmp = (1.0 / (t_0 / (1.0 + alpha))) / (1.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 + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 18.0], N[(N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(t$95$0 / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2\\
\mathbf{if}\;\beta \leq 18:\\
\;\;\;\;\frac{\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \frac{\alpha + 2}{1 + \alpha}}}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\frac{t\_0}{1 + \alpha}}}{1 + t\_0}\\
\end{array}
\end{array}
if beta < 18Initial program 99.8%
clear-num99.8%
inv-pow99.8%
metadata-eval99.8%
associate-+r+99.8%
+-commutative99.8%
*-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
distribute-rgt1-in99.8%
fma-define99.8%
metadata-eval99.8%
associate-+r+99.8%
Applied egg-rr99.8%
unpow-199.8%
associate-/r/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
fma-undefine99.8%
+-commutative99.8%
*-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
distribute-lft1-in99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.9%
+-commutative97.9%
Simplified97.9%
Taylor expanded in beta around 0 97.4%
+-commutative97.4%
Simplified97.4%
if 18 < beta Initial program 76.3%
clear-num76.2%
inv-pow76.2%
metadata-eval76.2%
associate-+r+76.2%
+-commutative76.2%
*-commutative76.2%
associate-+r+76.2%
+-commutative76.2%
distribute-rgt1-in76.3%
fma-define76.3%
metadata-eval76.3%
associate-+r+76.3%
Applied egg-rr76.3%
unpow-176.3%
associate-/r/76.2%
+-commutative76.2%
+-commutative76.2%
+-commutative76.2%
+-commutative76.2%
fma-undefine76.2%
+-commutative76.2%
*-commutative76.2%
+-commutative76.2%
associate-+r+76.2%
distribute-lft1-in76.2%
+-commutative76.2%
+-commutative76.2%
+-commutative76.2%
+-commutative76.2%
+-commutative76.2%
Simplified76.2%
clear-num76.2%
inv-pow76.2%
associate-+l+76.2%
Applied egg-rr76.2%
unpow-176.2%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
*-un-lft-identity99.8%
associate-+l+99.8%
+-commutative99.8%
+-commutative99.8%
*-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
associate-+r+99.8%
+-commutative99.8%
associate-*l/76.3%
associate-/l*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 82.4%
Final simplification92.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.7e+30) (/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.7e+30) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.7d+30) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.7e+30) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.7e+30: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.7e+30) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.7e+30)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.7e+30], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.7 \cdot 10^{+30}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.6999999999999999e30Initial program 99.8%
Simplified94.5%
Taylor expanded in alpha around 0 82.9%
Taylor expanded in alpha around 0 64.6%
+-commutative64.6%
+-commutative64.6%
Simplified64.6%
if 4.6999999999999999e30 < beta Initial program 74.8%
Taylor expanded in beta around inf 84.3%
Taylor expanded in alpha around 0 84.3%
+-commutative84.3%
associate-+r+84.3%
+-commutative84.3%
Simplified84.3%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.8e+30) (/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (+ 6.0 (* beta (+ beta 5.0))))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8e+30) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.8d+30) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8e+30) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.8e+30: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * (beta + 5.0)))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.8e+30) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.8e+30)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * (beta + 5.0))));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.8e+30], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.8 \cdot 10^{+30}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.7999999999999999e30Initial program 99.8%
Simplified94.5%
Taylor expanded in alpha around 0 82.9%
Taylor expanded in alpha around 0 64.6%
+-commutative64.6%
+-commutative64.6%
Simplified64.6%
Taylor expanded in beta around 0 64.6%
+-commutative64.6%
Simplified64.6%
if 4.7999999999999999e30 < beta Initial program 74.8%
Taylor expanded in beta around inf 84.3%
Taylor expanded in alpha around 0 84.3%
+-commutative84.3%
associate-+r+84.3%
+-commutative84.3%
Simplified84.3%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.8) (/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (+ 6.0 (* beta 5.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.8d0) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * (6.0d0 + (beta * 5.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.8: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.8) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(6.0 + Float64(beta * 5.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.8)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.8], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.8:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.79999999999999982Initial program 99.8%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 65.2%
+-commutative65.2%
+-commutative65.2%
Simplified65.2%
Taylor expanded in beta around 0 64.1%
*-commutative64.1%
Simplified64.1%
if 4.79999999999999982 < beta Initial program 76.3%
Taylor expanded in beta around inf 81.9%
Taylor expanded in alpha around 0 81.9%
+-commutative81.9%
associate-+r+81.9%
+-commutative81.9%
Simplified81.9%
Final simplification70.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.16e+35) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.16e+35) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.16d+35) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.16e+35) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.16e+35: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.16e+35) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.16e+35)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.16e+35], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.16 \cdot 10^{+35}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.1600000000000001e35Initial program 99.8%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.7%
+-commutative84.7%
Simplified84.7%
Taylor expanded in alpha around 0 62.9%
if 1.1600000000000001e35 < beta Initial program 74.8%
Taylor expanded in beta around inf 84.3%
Taylor expanded in alpha around 0 84.3%
+-commutative84.3%
associate-+r+84.3%
+-commutative84.3%
Simplified84.3%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ (+ 1.0 beta) (* (+ beta 2.0) (+ 6.0 (* beta 5.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * (6.0d0 + (beta * 5.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * 5.0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(6.0 + Float64(beta * 5.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * 5.0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.8%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 65.2%
+-commutative65.2%
+-commutative65.2%
Simplified65.2%
Taylor expanded in beta around 0 64.1%
*-commutative64.1%
Simplified64.1%
Taylor expanded in alpha around 0 62.5%
if 4.5 < beta Initial program 76.3%
Taylor expanded in beta around inf 81.9%
Taylor expanded in alpha around 0 81.9%
+-commutative81.9%
associate-+r+81.9%
+-commutative81.9%
Simplified81.9%
Final simplification69.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) (+ 0.08333333333333333 (* alpha -0.041666666666666664)) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.041666666666666664d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.08333333333333333 + (alpha * -0.041666666666666664) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.041666666666666664)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.08333333333333333 + N[(alpha * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.8%
Simplified94.3%
Taylor expanded in alpha around 0 82.8%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
+-commutative65.5%
Simplified65.5%
Taylor expanded in beta around 0 63.2%
+-commutative63.2%
Simplified63.2%
Taylor expanded in alpha around 0 61.3%
*-commutative61.3%
Simplified61.3%
if 2.10000000000000009 < beta Initial program 76.5%
Taylor expanded in beta around inf 81.0%
Taylor expanded in alpha around 0 81.0%
+-commutative81.0%
associate-+r+81.0%
+-commutative81.0%
Simplified81.0%
Final simplification68.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.2) (+ 0.08333333333333333 (* alpha -0.041666666666666664)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} 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.2d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.041666666666666664d0))
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.2) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * -0.041666666666666664) 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.2) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.041666666666666664)); 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.2)
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
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.2], N[(0.08333333333333333 + N[(alpha * -0.041666666666666664), $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.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.8%
Simplified94.3%
Taylor expanded in alpha around 0 82.8%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
+-commutative65.5%
Simplified65.5%
Taylor expanded in beta around 0 63.2%
+-commutative63.2%
Simplified63.2%
Taylor expanded in alpha around 0 61.3%
*-commutative61.3%
Simplified61.3%
if 2.2000000000000002 < beta Initial program 76.5%
Taylor expanded in beta around inf 81.0%
Taylor expanded in alpha around 0 73.8%
Final simplification65.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.95) (+ 0.08333333333333333 (* alpha -0.041666666666666664)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.95d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.041666666666666664d0))
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.95: tmp = 0.08333333333333333 + (alpha * -0.041666666666666664) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.95) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.041666666666666664)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.95)
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
else
tmp = ((1.0 + alpha) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.95], N[(0.08333333333333333 + N[(alpha * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.95:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.9500000000000002Initial program 99.8%
Simplified94.3%
Taylor expanded in alpha around 0 82.8%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
+-commutative65.5%
Simplified65.5%
Taylor expanded in beta around 0 63.2%
+-commutative63.2%
Simplified63.2%
Taylor expanded in alpha around 0 61.3%
*-commutative61.3%
Simplified61.3%
if 2.9500000000000002 < beta Initial program 76.5%
Taylor expanded in beta around inf 81.0%
Taylor expanded in beta around inf 80.8%
Final simplification68.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.95) (+ 0.08333333333333333 (* alpha -0.041666666666666664)) (/ 0.2 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.95) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} 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 <= 1.95d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.041666666666666664d0))
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 <= 1.95) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} else {
tmp = 0.2 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.95: tmp = 0.08333333333333333 + (alpha * -0.041666666666666664) else: tmp = 0.2 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.95) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.041666666666666664)); 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 <= 1.95)
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
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, 1.95], N[(0.08333333333333333 + N[(alpha * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(0.2 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.95:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{0.2}{\beta}\\
\end{array}
\end{array}
if beta < 1.94999999999999996Initial program 99.8%
Simplified94.3%
Taylor expanded in alpha around 0 82.8%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
+-commutative65.5%
Simplified65.5%
Taylor expanded in beta around 0 63.2%
+-commutative63.2%
Simplified63.2%
Taylor expanded in alpha around 0 61.3%
*-commutative61.3%
Simplified61.3%
if 1.94999999999999996 < beta Initial program 76.5%
Simplified54.9%
Taylor expanded in alpha around 0 69.2%
Taylor expanded in alpha around 0 66.1%
+-commutative66.1%
+-commutative66.1%
Simplified66.1%
Taylor expanded in beta around 0 46.9%
*-commutative46.9%
Simplified46.9%
Taylor expanded in beta around inf 6.4%
Final simplification42.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.4) 0.08333333333333333 (/ 0.2 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4) {
tmp = 0.08333333333333333;
} 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.4d0) then
tmp = 0.08333333333333333d0
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.4) {
tmp = 0.08333333333333333;
} else {
tmp = 0.2 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.4: tmp = 0.08333333333333333 else: tmp = 0.2 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.4) tmp = 0.08333333333333333; 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.4)
tmp = 0.08333333333333333;
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.4], 0.08333333333333333, N[(0.2 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.4:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.2}{\beta}\\
\end{array}
\end{array}
if beta < 2.39999999999999991Initial program 99.8%
Simplified94.3%
Taylor expanded in alpha around 0 82.8%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
+-commutative65.5%
Simplified65.5%
Taylor expanded in beta around 0 63.2%
+-commutative63.2%
Simplified63.2%
Taylor expanded in alpha around 0 62.0%
if 2.39999999999999991 < beta Initial program 76.5%
Simplified54.9%
Taylor expanded in alpha around 0 69.2%
Taylor expanded in alpha around 0 66.1%
+-commutative66.1%
+-commutative66.1%
Simplified66.1%
Taylor expanded in beta around 0 46.9%
*-commutative46.9%
Simplified46.9%
Taylor expanded in beta around inf 6.4%
Final simplification42.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 91.7%
Simplified80.6%
Taylor expanded in alpha around 0 78.1%
Taylor expanded in alpha around 0 65.8%
+-commutative65.8%
+-commutative65.8%
Simplified65.8%
Taylor expanded in beta around 0 42.9%
+-commutative42.9%
Simplified42.9%
Taylor expanded in alpha around 0 41.7%
Final simplification41.7%
herbie shell --seed 2024081
(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)))