
(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))))
(if (<= beta 1e+142)
(/ (/ (* (+ 1.0 beta) (+ 1.0 alpha)) t_0) (* (+ 3.0 (+ beta alpha)) t_0))
(*
(/ 1.0 (+ 2.0 (+ beta alpha)))
(/ 1.0 (/ (+ beta (+ alpha 3.0)) (+ 1.0 alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+142) {
tmp = (((1.0 + beta) * (1.0 + alpha)) / t_0) / ((3.0 + (beta + alpha)) * t_0);
} else {
tmp = (1.0 / (2.0 + (beta + alpha))) * (1.0 / ((beta + (alpha + 3.0)) / (1.0 + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1d+142) then
tmp = (((1.0d0 + beta) * (1.0d0 + alpha)) / t_0) / ((3.0d0 + (beta + alpha)) * t_0)
else
tmp = (1.0d0 / (2.0d0 + (beta + alpha))) * (1.0d0 / ((beta + (alpha + 3.0d0)) / (1.0d0 + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+142) {
tmp = (((1.0 + beta) * (1.0 + alpha)) / t_0) / ((3.0 + (beta + alpha)) * t_0);
} else {
tmp = (1.0 / (2.0 + (beta + alpha))) * (1.0 / ((beta + (alpha + 3.0)) / (1.0 + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1e+142: tmp = (((1.0 + beta) * (1.0 + alpha)) / t_0) / ((3.0 + (beta + alpha)) * t_0) else: tmp = (1.0 / (2.0 + (beta + alpha))) * (1.0 / ((beta + (alpha + 3.0)) / (1.0 + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1e+142) tmp = Float64(Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / t_0) / Float64(Float64(3.0 + Float64(beta + alpha)) * t_0)); else tmp = Float64(Float64(1.0 / Float64(2.0 + Float64(beta + alpha))) * Float64(1.0 / Float64(Float64(beta + Float64(alpha + 3.0)) / Float64(1.0 + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1e+142)
tmp = (((1.0 + beta) * (1.0 + alpha)) / t_0) / ((3.0 + (beta + alpha)) * t_0);
else
tmp = (1.0 / (2.0 + (beta + alpha))) * (1.0 / ((beta + (alpha + 3.0)) / (1.0 + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+142], N[(N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 10^{+142}:\\
\;\;\;\;\frac{\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{t\_0}}{\left(3 + \left(\beta + \alpha\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{2 + \left(\beta + \alpha\right)} \cdot \frac{1}{\frac{\beta + \left(\alpha + 3\right)}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 1.00000000000000005e142Initial program 99.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%
+-commutative98.0%
associate-+r+98.0%
*-commutative98.0%
associate-+r+98.0%
metadata-eval98.0%
*-un-lft-identity98.0%
+-commutative98.0%
*-commutative98.0%
associate-+r+98.0%
+-commutative98.0%
distribute-rgt1-in98.0%
fma-define98.0%
metadata-eval98.0%
associate-+r+98.0%
Applied egg-rr98.0%
*-lft-identity98.0%
+-commutative98.0%
fma-undefine98.0%
+-commutative98.0%
*-commutative98.0%
+-commutative98.0%
associate-+r+98.0%
distribute-lft1-in98.0%
+-commutative98.0%
+-commutative98.0%
+-commutative98.0%
+-commutative98.0%
+-commutative98.0%
Simplified98.0%
if 1.00000000000000005e142 < beta Initial program 76.6%
associate-/l/72.9%
+-commutative72.9%
associate-+l+72.9%
*-commutative72.9%
metadata-eval72.9%
associate-+l+72.9%
metadata-eval72.9%
+-commutative72.9%
+-commutative72.9%
+-commutative72.9%
metadata-eval72.9%
metadata-eval72.9%
associate-+l+72.9%
Simplified72.9%
clear-num72.9%
inv-pow72.9%
Applied egg-rr72.9%
unpow-172.9%
associate-/l*75.8%
+-commutative75.8%
+-commutative75.8%
+-commutative75.8%
+-commutative75.8%
+-commutative75.8%
+-commutative75.8%
+-commutative75.8%
fma-undefine75.8%
+-commutative75.8%
*-commutative75.8%
+-commutative75.8%
associate-+r+75.8%
distribute-lft1-in75.8%
+-commutative75.8%
+-commutative75.8%
+-commutative75.8%
+-commutative75.8%
Simplified75.8%
Taylor expanded in beta around inf 95.2%
inv-pow95.2%
unpow-prod-down96.0%
inv-pow96.0%
+-commutative96.0%
associate-+r+96.0%
+-commutative96.0%
associate-+l+96.0%
Applied egg-rr96.0%
+-commutative96.0%
+-commutative96.0%
unpow-196.0%
+-commutative96.0%
+-commutative96.0%
Simplified96.0%
Final simplification97.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 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 3.2e+58)
(/ (* (+ 1.0 beta) (+ 1.0 alpha)) (* t_1 (* t_0 t_1)))
(/ (/ (+ 1.0 alpha) beta) t_0))))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.2e+58) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_1 * (t_0 * t_1));
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 3.2d+58) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / (t_1 * (t_0 * t_1))
else
tmp = ((1.0d0 + alpha) / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.2e+58) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_1 * (t_0 * t_1));
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
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.2e+58: tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_1 * (t_0 * t_1)) else: tmp = ((1.0 + alpha) / beta) / t_0 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.2e+58) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(t_1 * Float64(t_0 * t_1))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / t_0); 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.2e+58)
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_1 * (t_0 * t_1));
else
tmp = ((1.0 + alpha) / beta) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.2e+58], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $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.2 \cdot 10^{+58}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{t\_1 \cdot \left(t\_0 \cdot t\_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 3.20000000000000015e58Initial program 99.8%
Simplified94.3%
if 3.20000000000000015e58 < beta Initial program 85.6%
Taylor expanded in beta around inf 90.7%
Taylor expanded in alpha around 0 90.7%
+-commutative90.7%
associate-+r+90.7%
+-commutative90.7%
+-commutative90.7%
+-commutative90.7%
Simplified90.7%
Final simplification93.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.55e+30)
(/
(* (+ 1.0 beta) (/ (+ 1.0 alpha) (+ beta (+ 2.0 alpha))))
(* (+ 3.0 (+ beta alpha)) (+ alpha (+ beta 2.0))))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55e+30) {
tmp = ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha)))) / ((3.0 + (beta + alpha)) * (alpha + (beta + 2.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.55d+30) then
tmp = ((1.0d0 + beta) * ((1.0d0 + alpha) / (beta + (2.0d0 + alpha)))) / ((3.0d0 + (beta + alpha)) * (alpha + (beta + 2.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.55e+30) {
tmp = ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha)))) / ((3.0 + (beta + alpha)) * (alpha + (beta + 2.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.55e+30: tmp = ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha)))) / ((3.0 + (beta + alpha)) * (alpha + (beta + 2.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.55e+30) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) / Float64(beta + Float64(2.0 + alpha)))) / Float64(Float64(3.0 + Float64(beta + alpha)) * Float64(alpha + Float64(beta + 2.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.55e+30)
tmp = ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha)))) / ((3.0 + (beta + alpha)) * (alpha + (beta + 2.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.55e+30], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.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 1.55 \cdot 10^{+30}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \frac{1 + \alpha}{\beta + \left(2 + \alpha\right)}}{\left(3 + \left(\beta + \alpha\right)\right) \cdot \left(\alpha + \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.5499999999999999e30Initial program 99.8%
associate-/l/98.7%
+-commutative98.7%
associate-+l+98.7%
*-commutative98.7%
metadata-eval98.7%
associate-+l+98.7%
metadata-eval98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
metadata-eval98.7%
metadata-eval98.7%
associate-+l+98.7%
Simplified98.7%
+-commutative98.7%
associate-+r+98.7%
*-commutative98.7%
associate-+r+98.7%
metadata-eval98.7%
*-un-lft-identity98.7%
+-commutative98.7%
*-commutative98.7%
associate-+r+98.7%
+-commutative98.7%
distribute-rgt1-in98.7%
fma-define98.7%
metadata-eval98.7%
associate-+r+98.7%
Applied egg-rr98.7%
*-lft-identity98.7%
+-commutative98.7%
fma-undefine98.7%
+-commutative98.7%
*-commutative98.7%
+-commutative98.7%
associate-+r+98.7%
distribute-lft1-in98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
Simplified98.7%
*-un-lft-identity99.2%
associate-+l+99.2%
Applied egg-rr98.7%
*-lft-identity99.2%
associate-*r/99.2%
+-commutative99.2%
+-commutative99.2%
Simplified98.7%
if 1.5499999999999999e30 < beta Initial program 86.4%
Taylor expanded in beta around inf 91.2%
Taylor expanded in alpha around 0 91.2%
+-commutative91.2%
associate-+r+91.2%
+-commutative91.2%
+-commutative91.2%
+-commutative91.2%
Simplified91.2%
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 (+ beta 3.0))
(* (+ 1.0 beta) (* (+ 1.0 alpha) (/ 1.0 (+ beta (+ 2.0 alpha))))))
(+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) * (1.0 / (beta + (2.0 + alpha)))))) * (alpha + (beta + 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 = 1.0d0 / (((alpha + (beta + 3.0d0)) / ((1.0d0 + beta) * ((1.0d0 + alpha) * (1.0d0 / (beta + (2.0d0 + alpha)))))) * (alpha + (beta + 2.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) * (1.0 / (beta + (2.0 + alpha)))))) * (alpha + (beta + 2.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) * (1.0 / (beta + (2.0 + alpha)))))) * (alpha + (beta + 2.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(beta + Float64(2.0 + alpha)))))) * Float64(alpha + Float64(beta + 2.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) * (1.0 / (beta + (2.0 + alpha)))))) * (alpha + (beta + 2.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\frac{\alpha + \left(\beta + 3\right)}{\left(1 + \beta\right) \cdot \left(\left(1 + \alpha\right) \cdot \frac{1}{\beta + \left(2 + \alpha\right)}\right)} \cdot \left(\alpha + \left(\beta + 2\right)\right)}
\end{array}
Initial program 96.0%
associate-/l/94.3%
+-commutative94.3%
associate-+l+94.3%
*-commutative94.3%
metadata-eval94.3%
associate-+l+94.3%
metadata-eval94.3%
+-commutative94.3%
+-commutative94.3%
+-commutative94.3%
metadata-eval94.3%
metadata-eval94.3%
associate-+l+94.3%
Simplified94.3%
clear-num94.3%
inv-pow94.3%
Applied egg-rr94.3%
unpow-194.3%
associate-/l*95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
fma-undefine95.4%
+-commutative95.4%
*-commutative95.4%
+-commutative95.4%
associate-+r+95.4%
distribute-lft1-in95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
Simplified95.4%
div-inv95.3%
associate-+l+95.3%
Applied egg-rr95.3%
associate-*l*99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
Final simplification99.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(/
1.0
(*
(/
(+ alpha (+ beta 3.0))
(* (+ 1.0 beta) (/ (+ 1.0 alpha) (+ beta (+ 2.0 alpha)))))
(+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha))))) * (alpha + (beta + 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 = 1.0d0 / (((alpha + (beta + 3.0d0)) / ((1.0d0 + beta) * ((1.0d0 + alpha) / (beta + (2.0d0 + alpha))))) * (alpha + (beta + 2.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha))))) * (alpha + (beta + 2.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha))))) * (alpha + (beta + 2.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) / Float64(beta + Float64(2.0 + alpha))))) * Float64(alpha + Float64(beta + 2.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha))))) * (alpha + (beta + 2.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\frac{\alpha + \left(\beta + 3\right)}{\left(1 + \beta\right) \cdot \frac{1 + \alpha}{\beta + \left(2 + \alpha\right)}} \cdot \left(\alpha + \left(\beta + 2\right)\right)}
\end{array}
Initial program 96.0%
associate-/l/94.3%
+-commutative94.3%
associate-+l+94.3%
*-commutative94.3%
metadata-eval94.3%
associate-+l+94.3%
metadata-eval94.3%
+-commutative94.3%
+-commutative94.3%
+-commutative94.3%
metadata-eval94.3%
metadata-eval94.3%
associate-+l+94.3%
Simplified94.3%
clear-num94.3%
inv-pow94.3%
Applied egg-rr94.3%
unpow-194.3%
associate-/l*95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
fma-undefine95.4%
+-commutative95.4%
*-commutative95.4%
+-commutative95.4%
associate-+r+95.4%
distribute-lft1-in95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
Simplified95.4%
*-un-lft-identity95.4%
associate-+l+95.4%
Applied egg-rr95.4%
*-lft-identity95.4%
associate-*r/99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
Final simplification99.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.2e+15) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ alpha (+ 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 <= 8.2e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (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 <= 8.2d+15) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((alpha + (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 <= 8.2e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (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 <= 8.2e+15: tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (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 <= 8.2e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(alpha + 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 <= 8.2e+15)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (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, 8.2e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $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 8.2 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 8.2e15Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 83.1%
+-commutative83.1%
Simplified83.1%
Taylor expanded in alpha around 0 65.2%
if 8.2e15 < beta Initial program 87.3%
Taylor expanded in beta around inf 89.7%
Taylor expanded in alpha around 0 89.7%
+-commutative89.7%
associate-+r+89.7%
+-commutative89.7%
+-commutative89.7%
+-commutative89.7%
Simplified89.7%
Final simplification72.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.8e+15) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 3.0) (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.8e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 3.0) * (beta + 2.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 <= 6.8d+15) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 3.0d0) * (beta + 2.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 <= 6.8e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 3.0) * (beta + 2.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 <= 6.8e+15: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 3.0) * (beta + 2.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 <= 6.8e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 3.0) * Float64(beta + 2.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 <= 6.8e+15)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 3.0) * (beta + 2.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, 6.8e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.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 6.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 6.8e15Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in alpha around 0 83.1%
+-commutative83.1%
Simplified83.1%
Taylor expanded in alpha around 0 64.2%
if 6.8e15 < beta Initial program 87.3%
Taylor expanded in beta around inf 89.7%
Taylor expanded in alpha around 0 89.7%
+-commutative89.7%
associate-+r+89.7%
+-commutative89.7%
+-commutative89.7%
+-commutative89.7%
Simplified89.7%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.5) (* (/ 1.0 (+ 2.0 (+ beta alpha))) (/ 1.0 (- 6.0 alpha))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5) {
tmp = (1.0 / (2.0 + (beta + alpha))) * (1.0 / (6.0 - alpha));
} 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 <= 5.5d0) then
tmp = (1.0d0 / (2.0d0 + (beta + alpha))) * (1.0d0 / (6.0d0 - alpha))
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 <= 5.5) {
tmp = (1.0 / (2.0 + (beta + alpha))) * (1.0 / (6.0 - alpha));
} 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 <= 5.5: tmp = (1.0 / (2.0 + (beta + alpha))) * (1.0 / (6.0 - alpha)) 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 <= 5.5) tmp = Float64(Float64(1.0 / Float64(2.0 + Float64(beta + alpha))) * Float64(1.0 / Float64(6.0 - alpha))); 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 <= 5.5)
tmp = (1.0 / (2.0 + (beta + alpha))) * (1.0 / (6.0 - alpha));
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, 5.5], N[(N[(1.0 / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(6.0 - alpha), $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 5.5:\\
\;\;\;\;\frac{1}{2 + \left(\beta + \alpha\right)} \cdot \frac{1}{6 - \alpha}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.5Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
clear-num99.2%
inv-pow99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-/l*99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
fma-undefine99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
distribute-lft1-in99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/l*98.3%
+-commutative98.3%
+-commutative98.3%
Simplified98.3%
Taylor expanded in alpha around 0 81.4%
mul-1-neg81.4%
Simplified81.4%
inv-pow81.4%
unpow-prod-down81.4%
inv-pow81.4%
+-commutative81.4%
associate-+r+81.4%
+-commutative81.4%
unsub-neg81.4%
Applied egg-rr81.4%
unpow-181.4%
*-commutative81.4%
+-commutative81.4%
+-commutative81.4%
Simplified81.4%
if 5.5 < beta Initial program 87.5%
Taylor expanded in beta around inf 88.7%
Taylor expanded in alpha around 0 88.7%
+-commutative88.7%
associate-+r+88.7%
+-commutative88.7%
+-commutative88.7%
+-commutative88.7%
Simplified88.7%
Final simplification83.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (/ 1.0 (* (+ alpha (+ beta 2.0)) (- 6.0 alpha))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (6.0 - alpha));
} 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 <= 6.0d0) then
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * (6.0d0 - alpha))
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 <= 6.0) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (6.0 - alpha));
} 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 <= 6.0: tmp = 1.0 / ((alpha + (beta + 2.0)) * (6.0 - alpha)) 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 <= 6.0) tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(6.0 - alpha))); 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 <= 6.0)
tmp = 1.0 / ((alpha + (beta + 2.0)) * (6.0 - alpha));
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, 6.0], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(6.0 - alpha), $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 6:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(6 - \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 6Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
clear-num99.2%
inv-pow99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-/l*99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
fma-undefine99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
distribute-lft1-in99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/l*98.3%
+-commutative98.3%
+-commutative98.3%
Simplified98.3%
Taylor expanded in alpha around 0 81.4%
mul-1-neg81.4%
Simplified81.4%
if 6 < beta Initial program 87.5%
Taylor expanded in beta around inf 88.7%
Taylor expanded in alpha around 0 88.7%
+-commutative88.7%
associate-+r+88.7%
+-commutative88.7%
+-commutative88.7%
+-commutative88.7%
Simplified88.7%
Final simplification83.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.3) (/ 1.0 (* (+ 2.0 alpha) (- 6.0 alpha))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 1.0 / ((2.0 + alpha) * (6.0 - alpha));
} 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.3d0) then
tmp = 1.0d0 / ((2.0d0 + alpha) * (6.0d0 - alpha))
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.3) {
tmp = 1.0 / ((2.0 + alpha) * (6.0 - alpha));
} 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.3: tmp = 1.0 / ((2.0 + alpha) * (6.0 - alpha)) 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.3) tmp = Float64(1.0 / Float64(Float64(2.0 + alpha) * Float64(6.0 - alpha))); 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.3)
tmp = 1.0 / ((2.0 + alpha) * (6.0 - alpha));
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.3], N[(1.0 / N[(N[(2.0 + alpha), $MachinePrecision] * N[(6.0 - alpha), $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 2.3:\\
\;\;\;\;\frac{1}{\left(2 + \alpha\right) \cdot \left(6 - \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
clear-num99.2%
inv-pow99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-/l*99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
fma-undefine99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
distribute-lft1-in99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.7%
associate-/l*98.7%
+-commutative98.7%
+-commutative98.7%
Simplified98.7%
Taylor expanded in alpha around 0 81.7%
mul-1-neg81.7%
Simplified81.7%
Taylor expanded in beta around 0 81.7%
+-commutative81.7%
Simplified81.7%
if 2.2999999999999998 < beta Initial program 87.6%
Taylor expanded in beta around inf 87.8%
Taylor expanded in alpha around 0 87.8%
+-commutative87.8%
associate-+r+87.8%
+-commutative87.8%
+-commutative87.8%
+-commutative87.8%
Simplified87.8%
Final simplification83.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.2) (/ 1.0 (* (+ 2.0 alpha) (- 6.0 alpha))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 1.0 / ((2.0 + alpha) * (6.0 - alpha));
} 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.2d0) then
tmp = 1.0d0 / ((2.0d0 + alpha) * (6.0d0 - alpha))
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.2) {
tmp = 1.0 / ((2.0 + alpha) * (6.0 - alpha));
} 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.2: tmp = 1.0 / ((2.0 + alpha) * (6.0 - alpha)) 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.2) tmp = Float64(1.0 / Float64(Float64(2.0 + alpha) * Float64(6.0 - alpha))); 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.2)
tmp = 1.0 / ((2.0 + alpha) * (6.0 - alpha));
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.2], N[(1.0 / N[(N[(2.0 + alpha), $MachinePrecision] * N[(6.0 - alpha), $MachinePrecision]), $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.2:\\
\;\;\;\;\frac{1}{\left(2 + \alpha\right) \cdot \left(6 - \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
clear-num99.2%
inv-pow99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-/l*99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
fma-undefine99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
distribute-lft1-in99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.7%
associate-/l*98.7%
+-commutative98.7%
+-commutative98.7%
Simplified98.7%
Taylor expanded in alpha around 0 81.7%
mul-1-neg81.7%
Simplified81.7%
Taylor expanded in beta around 0 81.7%
+-commutative81.7%
Simplified81.7%
if 2.2000000000000002 < beta Initial program 87.6%
Taylor expanded in beta around inf 87.8%
Taylor expanded in alpha around 0 87.7%
+-commutative87.7%
Simplified87.7%
Final simplification83.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.3) (/ 1.0 (* (+ 2.0 alpha) (- 6.0 alpha))) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 1.0 / ((2.0 + alpha) * (6.0 - alpha));
} 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 = 1.0d0 / ((2.0d0 + alpha) * (6.0d0 - alpha))
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 = 1.0 / ((2.0 + alpha) * (6.0 - alpha));
} 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 = 1.0 / ((2.0 + alpha) * (6.0 - alpha)) 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(1.0 / Float64(Float64(2.0 + alpha) * Float64(6.0 - alpha))); 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 = 1.0 / ((2.0 + alpha) * (6.0 - alpha));
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[(1.0 / N[(N[(2.0 + alpha), $MachinePrecision] * N[(6.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.3:\\
\;\;\;\;\frac{1}{\left(2 + \alpha\right) \cdot \left(6 - \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
clear-num99.2%
inv-pow99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-/l*99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
fma-undefine99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
distribute-lft1-in99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.7%
associate-/l*98.7%
+-commutative98.7%
+-commutative98.7%
Simplified98.7%
Taylor expanded in alpha around 0 81.7%
mul-1-neg81.7%
Simplified81.7%
Taylor expanded in beta around 0 81.7%
+-commutative81.7%
Simplified81.7%
if 2.2999999999999998 < beta Initial program 87.6%
Taylor expanded in beta around inf 87.8%
clear-num87.3%
inv-pow87.3%
metadata-eval87.3%
associate-+l+87.3%
metadata-eval87.3%
associate-+l+87.3%
Applied egg-rr87.3%
unpow-187.3%
associate-/r/87.4%
+-commutative87.4%
Simplified87.4%
Taylor expanded in alpha around 0 75.0%
associate-/r*75.4%
Simplified75.4%
Final simplification79.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.4) (/ 1.0 (* (+ beta 2.0) 6.0)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4) {
tmp = 1.0 / ((beta + 2.0) * 6.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 <= 5.4d0) then
tmp = 1.0d0 / ((beta + 2.0d0) * 6.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 <= 5.4) {
tmp = 1.0 / ((beta + 2.0) * 6.0);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.4: tmp = 1.0 / ((beta + 2.0) * 6.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 <= 5.4) tmp = Float64(1.0 / Float64(Float64(beta + 2.0) * 6.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 <= 5.4)
tmp = 1.0 / ((beta + 2.0) * 6.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, 5.4], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * 6.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 5.4:\\
\;\;\;\;\frac{1}{\left(\beta + 2\right) \cdot 6}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 5.4000000000000004Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
clear-num99.2%
inv-pow99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-/l*99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
fma-undefine99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
distribute-lft1-in99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/l*98.3%
+-commutative98.3%
+-commutative98.3%
Simplified98.3%
Taylor expanded in alpha around 0 63.8%
if 5.4000000000000004 < beta Initial program 87.5%
Taylor expanded in beta around inf 88.7%
clear-num88.1%
inv-pow88.1%
metadata-eval88.1%
associate-+l+88.1%
metadata-eval88.1%
associate-+l+88.1%
Applied egg-rr88.1%
unpow-188.1%
associate-/r/88.2%
+-commutative88.2%
Simplified88.2%
Taylor expanded in alpha around 0 75.7%
associate-/r*76.1%
Simplified76.1%
Final simplification67.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.4) (/ 1.0 (* (+ beta 2.0) 6.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4) {
tmp = 1.0 / ((beta + 2.0) * 6.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 <= 5.4d0) then
tmp = 1.0d0 / ((beta + 2.0d0) * 6.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 <= 5.4) {
tmp = 1.0 / ((beta + 2.0) * 6.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.4: tmp = 1.0 / ((beta + 2.0) * 6.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 <= 5.4) tmp = Float64(1.0 / Float64(Float64(beta + 2.0) * 6.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 <= 5.4)
tmp = 1.0 / ((beta + 2.0) * 6.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, 5.4], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * 6.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 5.4:\\
\;\;\;\;\frac{1}{\left(\beta + 2\right) \cdot 6}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.4000000000000004Initial program 99.8%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
clear-num99.2%
inv-pow99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-/l*99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
fma-undefine99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
distribute-lft1-in99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/l*98.3%
+-commutative98.3%
+-commutative98.3%
Simplified98.3%
Taylor expanded in alpha around 0 63.8%
if 5.4000000000000004 < beta Initial program 87.5%
Taylor expanded in beta around inf 88.7%
Taylor expanded in alpha around 0 75.7%
Final simplification67.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* (+ beta 2.0) 6.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / ((beta + 2.0) * 6.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 / ((beta + 2.0d0) * 6.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / ((beta + 2.0) * 6.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / ((beta + 2.0) * 6.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(Float64(beta + 2.0) * 6.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / ((beta + 2.0) * 6.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * 6.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\left(\beta + 2\right) \cdot 6}
\end{array}
Initial program 96.0%
associate-/l/94.3%
+-commutative94.3%
associate-+l+94.3%
*-commutative94.3%
metadata-eval94.3%
associate-+l+94.3%
metadata-eval94.3%
+-commutative94.3%
+-commutative94.3%
+-commutative94.3%
metadata-eval94.3%
metadata-eval94.3%
associate-+l+94.3%
Simplified94.3%
clear-num94.3%
inv-pow94.3%
Applied egg-rr94.3%
unpow-194.3%
associate-/l*95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
fma-undefine95.4%
+-commutative95.4%
*-commutative95.4%
+-commutative95.4%
associate-+r+95.4%
distribute-lft1-in95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
Simplified95.4%
Taylor expanded in beta around 0 71.6%
associate-/l*71.6%
+-commutative71.6%
+-commutative71.6%
Simplified71.6%
Taylor expanded in alpha around 0 46.0%
Final simplification46.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 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 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (beta + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 96.0%
associate-/l/94.3%
+-commutative94.3%
associate-+l+94.3%
*-commutative94.3%
metadata-eval94.3%
associate-+l+94.3%
metadata-eval94.3%
+-commutative94.3%
+-commutative94.3%
+-commutative94.3%
metadata-eval94.3%
metadata-eval94.3%
associate-+l+94.3%
Simplified94.3%
clear-num94.3%
inv-pow94.3%
Applied egg-rr94.3%
unpow-194.3%
associate-/l*95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
fma-undefine95.4%
+-commutative95.4%
*-commutative95.4%
+-commutative95.4%
associate-+r+95.4%
distribute-lft1-in95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
Simplified95.4%
Taylor expanded in beta around 0 71.6%
associate-/l*71.6%
+-commutative71.6%
+-commutative71.6%
Simplified71.6%
Taylor expanded in alpha around 0 46.0%
Final simplification46.0%
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 96.0%
associate-/l/94.3%
+-commutative94.3%
associate-+l+94.3%
*-commutative94.3%
metadata-eval94.3%
associate-+l+94.3%
metadata-eval94.3%
+-commutative94.3%
+-commutative94.3%
+-commutative94.3%
metadata-eval94.3%
metadata-eval94.3%
associate-+l+94.3%
Simplified94.3%
clear-num94.3%
inv-pow94.3%
Applied egg-rr94.3%
unpow-194.3%
associate-/l*95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
fma-undefine95.4%
+-commutative95.4%
*-commutative95.4%
+-commutative95.4%
associate-+r+95.4%
distribute-lft1-in95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
Simplified95.4%
Taylor expanded in beta around 0 71.6%
associate-/l*71.6%
+-commutative71.6%
+-commutative71.6%
Simplified71.6%
Taylor expanded in alpha around 0 46.0%
Taylor expanded in beta around 0 45.1%
herbie shell --seed 2024148
(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)))