
(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 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (/ (/ (/ (+ 1.0 beta) t_0) (/ t_0 (+ 1.0 alpha))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (t_0 / (1.0 + alpha))) / (alpha + (beta + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((1.0d0 + beta) / t_0) / (t_0 / (1.0d0 + alpha))) / (alpha + (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (t_0 / (1.0 + alpha))) / (alpha + (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + beta) / t_0) / (t_0 / (1.0 + alpha))) / (alpha + (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(t_0 / Float64(1.0 + alpha))) / Float64(alpha + Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + beta) / t_0) / (t_0 / (1.0 + alpha))) / (alpha + (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\frac{1 + \beta}{t\_0}}{\frac{t\_0}{1 + \alpha}}}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 92.9%
Simplified82.7%
times-frac94.7%
+-commutative94.7%
Applied egg-rr94.7%
*-un-lft-identity94.7%
+-commutative94.7%
associate-+r+94.7%
+-commutative94.7%
Applied egg-rr94.7%
*-lft-identity94.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
*-commutative99.8%
clear-num99.8%
un-div-inv99.8%
Applied egg-rr99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 3.7e+68)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_1 t_0)))
(/ (/ (+ 1.0 alpha) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.7e+68) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * t_0));
} else {
tmp = ((1.0 + alpha) / t_0) / t_1;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 3.7d+68) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_1 * t_0))
else
tmp = ((1.0d0 + alpha) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.7e+68) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * t_0));
} else {
tmp = ((1.0 + alpha) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 3.7e+68: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * t_0)) else: tmp = ((1.0 + alpha) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3.7e+68) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 3.7e+68)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * t_0));
else
tmp = ((1.0 + alpha) / t_0) / t_1;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.7e+68], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 3.7 \cdot 10^{+68}:\\
\;\;\;\;\frac{1 + \alpha}{t\_1} \cdot \frac{1 + \beta}{t\_1 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 3.69999999999999998e68Initial program 99.8%
Simplified93.8%
times-frac99.2%
+-commutative99.2%
Applied egg-rr99.2%
if 3.69999999999999998e68 < beta Initial program 73.9%
associate-/l/71.3%
+-commutative71.3%
associate-+l+71.3%
*-commutative71.3%
metadata-eval71.3%
associate-+l+71.3%
metadata-eval71.3%
associate-+l+71.3%
metadata-eval71.3%
metadata-eval71.3%
associate-+l+71.3%
Simplified71.3%
clear-num71.3%
inv-pow71.3%
+-commutative71.3%
distribute-rgt1-in71.3%
fma-define71.3%
Applied egg-rr71.3%
unpow-171.3%
+-commutative71.3%
+-commutative71.3%
+-commutative71.3%
associate-+l+71.3%
fma-undefine71.3%
+-commutative71.3%
*-commutative71.3%
+-commutative71.3%
associate-+r+71.3%
distribute-rgt1-in71.3%
+-commutative71.3%
Simplified71.3%
Taylor expanded in beta around inf 81.0%
*-un-lft-identity81.0%
associate-/r*89.7%
+-commutative89.7%
associate-+l+89.7%
Applied egg-rr89.7%
Final simplification96.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (/ (/ (+ 1.0 beta) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (((1.0d0 + beta) / (beta + (alpha + 2.0d0))) / (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(Float64(1.0 + beta) / Float64(beta + Float64(alpha + 2.0))) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{\frac{1 + \beta}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}
\end{array}
Initial program 92.9%
Simplified82.7%
times-frac94.7%
+-commutative94.7%
Applied egg-rr94.7%
*-un-lft-identity94.7%
+-commutative94.7%
associate-+r+94.7%
+-commutative94.7%
Applied egg-rr94.7%
*-lft-identity94.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (/ (* (/ (+ 1.0 beta) t_0) (/ (+ 1.0 alpha) t_0)) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) * ((1.0 + alpha) / t_0)) / (alpha + (beta + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((1.0d0 + beta) / t_0) * ((1.0d0 + alpha) / t_0)) / (alpha + (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) * ((1.0 + alpha) / t_0)) / (alpha + (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + beta) / t_0) * ((1.0 + alpha) / t_0)) / (alpha + (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(Float64(1.0 + alpha) / t_0)) / Float64(alpha + Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + beta) / t_0) * ((1.0 + alpha) / t_0)) / (alpha + (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{1 + \beta}{t\_0} \cdot \frac{1 + \alpha}{t\_0}}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 92.9%
Simplified82.7%
times-frac94.7%
+-commutative94.7%
Applied egg-rr94.7%
*-un-lft-identity94.7%
+-commutative94.7%
associate-+r+94.7%
+-commutative94.7%
Applied egg-rr94.7%
*-lft-identity94.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1e+19)
(/ (+ 1.0 beta) (* t_0 (* (+ beta 2.0) (+ beta 3.0))))
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+19) {
tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1d+19) then
tmp = (1.0d0 + beta) / (t_0 * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+19) {
tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1e+19: tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1e+19) tmp = Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1e+19)
tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+19], N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 10^{+19}:\\
\;\;\;\;\frac{1 + \beta}{t\_0 \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 1e19Initial program 99.8%
Simplified93.2%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.6%
+-commutative62.6%
+-commutative62.6%
Simplified62.6%
if 1e19 < beta Initial program 79.3%
associate-/l/77.3%
+-commutative77.3%
associate-+l+77.3%
*-commutative77.3%
metadata-eval77.3%
associate-+l+77.3%
metadata-eval77.3%
associate-+l+77.3%
metadata-eval77.3%
metadata-eval77.3%
associate-+l+77.3%
Simplified77.3%
clear-num77.3%
inv-pow77.3%
+-commutative77.3%
distribute-rgt1-in77.2%
fma-define77.2%
Applied egg-rr77.2%
unpow-177.2%
+-commutative77.2%
+-commutative77.2%
+-commutative77.2%
associate-+l+77.2%
fma-undefine77.2%
+-commutative77.2%
*-commutative77.2%
+-commutative77.2%
associate-+r+77.2%
distribute-rgt1-in77.2%
+-commutative77.2%
Simplified77.2%
Taylor expanded in beta around inf 82.8%
*-un-lft-identity82.8%
associate-/r*88.5%
+-commutative88.5%
associate-+l+88.5%
Applied egg-rr88.5%
Final simplification71.3%
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.65e+19)
(/ (+ 1.0 beta) (* t_0 (+ 6.0 (* beta (+ beta 5.0)))))
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.65e+19) {
tmp = (1.0 + beta) / (t_0 * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.65d+19) then
tmp = (1.0d0 + beta) / (t_0 * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.65e+19) {
tmp = (1.0 + beta) / (t_0 * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.65e+19: tmp = (1.0 + beta) / (t_0 * (6.0 + (beta * (beta + 5.0)))) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.65e+19) tmp = Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.65e+19)
tmp = (1.0 + beta) / (t_0 * (6.0 + (beta * (beta + 5.0))));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.65e+19], N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $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.65 \cdot 10^{+19}:\\
\;\;\;\;\frac{1 + \beta}{t\_0 \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.65e19Initial program 99.8%
Simplified93.2%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.6%
+-commutative62.6%
+-commutative62.6%
Simplified62.6%
Taylor expanded in beta around 0 62.6%
+-commutative62.6%
unpow262.6%
distribute-rgt-out62.6%
Simplified62.6%
if 1.65e19 < beta Initial program 79.3%
associate-/l/77.3%
+-commutative77.3%
associate-+l+77.3%
*-commutative77.3%
metadata-eval77.3%
associate-+l+77.3%
metadata-eval77.3%
associate-+l+77.3%
metadata-eval77.3%
metadata-eval77.3%
associate-+l+77.3%
Simplified77.3%
clear-num77.3%
inv-pow77.3%
+-commutative77.3%
distribute-rgt1-in77.2%
fma-define77.2%
Applied egg-rr77.2%
unpow-177.2%
+-commutative77.2%
+-commutative77.2%
+-commutative77.2%
associate-+l+77.2%
fma-undefine77.2%
+-commutative77.2%
*-commutative77.2%
+-commutative77.2%
associate-+r+77.2%
distribute-rgt1-in77.2%
+-commutative77.2%
Simplified77.2%
Taylor expanded in beta around inf 82.8%
*-un-lft-identity82.8%
associate-/r*88.5%
+-commutative88.5%
associate-+l+88.5%
Applied egg-rr88.5%
Final simplification71.3%
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 3.1e+38)
(/ (/ (+ 1.0 beta) (* t_0 (+ beta 3.0))) (+ beta 2.0))
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.1e+38) {
tmp = ((1.0 + beta) / (t_0 * (beta + 3.0))) / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 3.1d+38) then
tmp = ((1.0d0 + beta) / (t_0 * (beta + 3.0d0))) / (beta + 2.0d0)
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.1e+38) {
tmp = ((1.0 + beta) / (t_0 * (beta + 3.0))) / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 3.1e+38: tmp = ((1.0 + beta) / (t_0 * (beta + 3.0))) / (beta + 2.0) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3.1e+38) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(beta + 3.0))) / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 3.1e+38)
tmp = ((1.0 + beta) / (t_0 * (beta + 3.0))) / (beta + 2.0);
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.1e+38], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 3.1 \cdot 10^{+38}:\\
\;\;\;\;\frac{\frac{1 + \beta}{t\_0 \cdot \left(\beta + 3\right)}}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 3.10000000000000018e38Initial program 99.8%
Simplified93.3%
Taylor expanded in alpha around 0 81.3%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
+-commutative63.2%
Simplified63.2%
associate-/r*62.7%
*-un-lft-identity62.7%
times-frac62.7%
Applied egg-rr62.7%
associate-*l/62.7%
*-lft-identity62.7%
associate-/l/62.7%
Simplified62.7%
if 3.10000000000000018e38 < beta Initial program 78.5%
associate-/l/76.4%
+-commutative76.4%
associate-+l+76.4%
*-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
metadata-eval76.4%
associate-+l+76.4%
metadata-eval76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
clear-num76.4%
inv-pow76.4%
+-commutative76.4%
distribute-rgt1-in76.4%
fma-define76.4%
Applied egg-rr76.4%
unpow-176.4%
+-commutative76.4%
+-commutative76.4%
+-commutative76.4%
associate-+l+76.4%
fma-undefine76.4%
+-commutative76.4%
*-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
Simplified76.4%
Taylor expanded in beta around inf 82.2%
*-un-lft-identity82.2%
associate-/r*89.2%
+-commutative89.2%
associate-+l+89.2%
Applied egg-rr89.2%
Final simplification71.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.2e+18) (/ (+ 1.0 beta) (* (+ beta 2.0) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.2e+18) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 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 <= 8.2d+18) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8.2e+18) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.2e+18: tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.2e+18) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.2e+18)
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 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, 8.2e+18], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $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[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.2 \cdot 10^{+18}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 8.2e18Initial program 99.8%
Simplified93.2%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.6%
+-commutative62.6%
+-commutative62.6%
Simplified62.6%
Taylor expanded in alpha around 0 61.5%
+-commutative61.5%
Simplified61.5%
if 8.2e18 < beta Initial program 79.3%
Taylor expanded in beta around inf 88.2%
Taylor expanded in alpha around 0 88.2%
+-commutative88.2%
associate-+r+88.2%
+-commutative88.2%
associate-+r+88.2%
Simplified88.2%
Final simplification70.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9e+23) (/ (+ 1.0 beta) (* (+ beta 2.0) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9e+23) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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) :: tmp
if (beta <= 2.9d+23) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9e+23) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9e+23: tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9e+23) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.9e+23)
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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_] := If[LessEqual[beta, 2.9e+23], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9 \cdot 10^{+23}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 2.90000000000000013e23Initial program 99.8%
Simplified93.2%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.6%
+-commutative62.6%
+-commutative62.6%
Simplified62.6%
Taylor expanded in alpha around 0 61.5%
+-commutative61.5%
Simplified61.5%
if 2.90000000000000013e23 < beta Initial program 79.3%
associate-/l/77.3%
+-commutative77.3%
associate-+l+77.3%
*-commutative77.3%
metadata-eval77.3%
associate-+l+77.3%
metadata-eval77.3%
associate-+l+77.3%
metadata-eval77.3%
metadata-eval77.3%
associate-+l+77.3%
Simplified77.3%
clear-num77.3%
inv-pow77.3%
+-commutative77.3%
distribute-rgt1-in77.2%
fma-define77.2%
Applied egg-rr77.2%
unpow-177.2%
+-commutative77.2%
+-commutative77.2%
+-commutative77.2%
associate-+l+77.2%
fma-undefine77.2%
+-commutative77.2%
*-commutative77.2%
+-commutative77.2%
associate-+r+77.2%
distribute-rgt1-in77.2%
+-commutative77.2%
Simplified77.2%
Taylor expanded in beta around inf 82.8%
*-un-lft-identity82.8%
associate-/r*88.5%
+-commutative88.5%
associate-+l+88.5%
Applied egg-rr88.5%
Final simplification70.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.3)
(/ 0.16666666666666666 (+ alpha 2.0))
(if (<= beta 4.8e+155)
(/ (+ 1.0 alpha) (* beta (+ beta 3.0)))
(/ (/ alpha beta) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 4.8e+155) {
tmp = (1.0 + alpha) / (beta * (beta + 3.0));
} else {
tmp = (alpha / 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.3d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else if (beta <= 4.8d+155) then
tmp = (1.0d0 + alpha) / (beta * (beta + 3.0d0))
else
tmp = (alpha / 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.3) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 4.8e+155) {
tmp = (1.0 + alpha) / (beta * (beta + 3.0));
} else {
tmp = (alpha / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.16666666666666666 / (alpha + 2.0) elif beta <= 4.8e+155: tmp = (1.0 + alpha) / (beta * (beta + 3.0)) else: tmp = (alpha / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.3) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); elseif (beta <= 4.8e+155) tmp = Float64(Float64(1.0 + alpha) / Float64(beta * Float64(beta + 3.0))); else tmp = Float64(Float64(alpha / 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.3)
tmp = 0.16666666666666666 / (alpha + 2.0);
elseif (beta <= 4.8e+155)
tmp = (1.0 + alpha) / (beta * (beta + 3.0));
else
tmp = (alpha / 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.3], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 4.8e+155], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / 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.3:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{elif}\;\beta \leq 4.8 \cdot 10^{+155}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.9%
Simplified93.0%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.1%
+-commutative62.1%
+-commutative62.1%
Simplified62.1%
Taylor expanded in beta around 0 61.3%
if 2.2999999999999998 < beta < 4.80000000000000042e155Initial program 93.7%
Taylor expanded in beta around inf 78.7%
*-un-lft-identity78.7%
associate-/l/80.7%
metadata-eval80.7%
associate-+l+80.7%
metadata-eval80.7%
associate-+r+80.7%
Applied egg-rr80.7%
*-lft-identity80.7%
*-commutative80.7%
+-commutative80.7%
Simplified80.7%
Taylor expanded in alpha around 0 78.5%
if 4.80000000000000042e155 < beta Initial program 64.0%
Taylor expanded in beta around inf 94.0%
Taylor expanded in alpha around 0 94.0%
Taylor expanded in alpha around 0 93.9%
+-commutative93.9%
Simplified93.9%
Taylor expanded in alpha around inf 92.6%
Final simplification69.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.7)
(/ 0.16666666666666666 (+ alpha 2.0))
(if (<= beta 1.05e+160)
(/ (/ 1.0 (+ beta 3.0)) beta)
(/ (/ alpha beta) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 1.05e+160) {
tmp = (1.0 / (beta + 3.0)) / beta;
} else {
tmp = (alpha / 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.7d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else if (beta <= 1.05d+160) then
tmp = (1.0d0 / (beta + 3.0d0)) / beta
else
tmp = (alpha / 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.7) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 1.05e+160) {
tmp = (1.0 / (beta + 3.0)) / beta;
} else {
tmp = (alpha / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7: tmp = 0.16666666666666666 / (alpha + 2.0) elif beta <= 1.05e+160: tmp = (1.0 / (beta + 3.0)) / beta else: tmp = (alpha / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.7) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); elseif (beta <= 1.05e+160) tmp = Float64(Float64(1.0 / Float64(beta + 3.0)) / beta); else tmp = Float64(Float64(alpha / 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.7)
tmp = 0.16666666666666666 / (alpha + 2.0);
elseif (beta <= 1.05e+160)
tmp = (1.0 / (beta + 3.0)) / beta;
else
tmp = (alpha / 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.7], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.05e+160], N[(N[(1.0 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision], N[(N[(alpha / 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.7:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{elif}\;\beta \leq 1.05 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{1}{\beta + 3}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial program 99.9%
Simplified93.0%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.1%
+-commutative62.1%
+-commutative62.1%
Simplified62.1%
Taylor expanded in beta around 0 61.3%
if 2.7000000000000002 < beta < 1.04999999999999998e160Initial program 93.9%
Taylor expanded in beta around inf 79.1%
Taylor expanded in alpha around 0 64.3%
inv-pow64.3%
unpow-prod-down65.2%
inv-pow65.2%
+-commutative65.2%
Applied egg-rr65.2%
associate-*l/65.4%
*-lft-identity65.4%
unpow-165.4%
Simplified65.4%
if 1.04999999999999998e160 < beta Initial program 63.1%
Taylor expanded in beta around inf 93.8%
Taylor expanded in alpha around 0 93.8%
Taylor expanded in alpha around 0 93.7%
+-commutative93.7%
Simplified93.7%
Taylor expanded in alpha around inf 93.7%
Final simplification67.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 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.6d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.6)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 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.6], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.9%
Simplified93.0%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.1%
+-commutative62.1%
+-commutative62.1%
Simplified62.1%
Taylor expanded in beta around 0 61.3%
if 2.60000000000000009 < beta Initial program 80.3%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 85.6%
+-commutative85.6%
associate-+r+85.6%
+-commutative85.6%
associate-+r+85.6%
Simplified85.6%
Final simplification70.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / 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.6d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((1.0d0 + alpha) / 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.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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.6)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = ((1.0 + alpha) / 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.6], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / 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.6:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.9%
Simplified93.0%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.1%
+-commutative62.1%
+-commutative62.1%
Simplified62.1%
Taylor expanded in beta around 0 61.3%
if 2.60000000000000009 < beta Initial program 80.3%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 85.5%
+-commutative85.5%
Simplified85.5%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.16666666666666666 / (alpha + 2.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 <= 2.5d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.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 <= 2.5) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} 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.16666666666666666 / (alpha + 2.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 <= 2.5) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); 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.16666666666666666 / (alpha + 2.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, 2.5], N[(0.16666666666666666 / N[(alpha + 2.0), $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:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
Simplified93.0%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.1%
+-commutative62.1%
+-commutative62.1%
Simplified62.1%
Taylor expanded in beta around 0 61.3%
if 2.5 < beta Initial program 80.3%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 70.5%
Final simplification64.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.3) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.16666666666666666 / (alpha + 2.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 <= 2.3d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.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 <= 2.3) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.16666666666666666 / (alpha + 2.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 <= 2.3) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.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 <= 2.3)
tmp = 0.16666666666666666 / (alpha + 2.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, 2.3], N[(0.16666666666666666 / N[(alpha + 2.0), $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.3:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.9%
Simplified93.0%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.1%
+-commutative62.1%
+-commutative62.1%
Simplified62.1%
Taylor expanded in beta around 0 61.3%
if 2.2999999999999998 < beta Initial program 80.3%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 70.5%
associate-/r*71.1%
Simplified71.1%
Final simplification64.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ 1.0 (+ beta 3.0)) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / (beta + 3.0)) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.6d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = (1.0d0 / (beta + 3.0d0)) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / (beta + 3.0)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = (1.0 / (beta + 3.0)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(1.0 / Float64(beta + 3.0)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.6)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = (1.0 / (beta + 3.0)) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.6], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta + 3}}{\beta}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.9%
Simplified93.0%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 62.1%
+-commutative62.1%
+-commutative62.1%
Simplified62.1%
Taylor expanded in beta around 0 61.3%
if 2.60000000000000009 < beta Initial program 80.3%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around 0 70.5%
inv-pow70.5%
unpow-prod-down71.0%
inv-pow71.0%
+-commutative71.0%
Applied egg-rr71.0%
associate-*l/71.1%
*-lft-identity71.1%
unpow-171.1%
Simplified71.1%
Final simplification64.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ alpha 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (alpha + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (alpha + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(alpha + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (alpha + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\alpha + 2}
\end{array}
Initial program 92.9%
Simplified82.7%
Taylor expanded in alpha around 0 75.7%
Taylor expanded in alpha around 0 63.5%
+-commutative63.5%
+-commutative63.5%
Simplified63.5%
Taylor expanded in beta around 0 41.4%
Final simplification41.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.3333333333333333d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\beta}
\end{array}
Initial program 92.9%
Taylor expanded in beta around inf 32.1%
Taylor expanded in alpha around 0 26.8%
Taylor expanded in beta around 0 4.2%
Final simplification4.2%
herbie shell --seed 2024067
(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)))