
(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 19 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 (+ beta (+ alpha 2.0)))) (/ (* (/ (+ 1.0 beta) (+ beta (+ alpha 3.0))) (/ (+ 1.0 alpha) t_0)) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + beta) / (beta + (alpha + 3.0))) * ((1.0 + alpha) / t_0)) / t_0;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = beta + (alpha + 2.0d0)
code = (((1.0d0 + beta) / (beta + (alpha + 3.0d0))) * ((1.0d0 + alpha) / t_0)) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + beta) / (beta + (alpha + 3.0))) * ((1.0 + alpha) / t_0)) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return (((1.0 + beta) / (beta + (alpha + 3.0))) * ((1.0 + alpha) / t_0)) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) / Float64(beta + Float64(alpha + 3.0))) * Float64(Float64(1.0 + alpha) / t_0)) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = (((1.0 + beta) / (beta + (alpha + 3.0))) * ((1.0 + alpha) / t_0)) / t_0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\frac{\frac{1 + \beta}{\beta + \left(\alpha + 3\right)} \cdot \frac{1 + \alpha}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 94.1%
Simplified85.5%
Taylor expanded in alpha around 0 85.6%
times-frac97.3%
+-commutative97.3%
+-commutative97.3%
associate-+r+97.3%
+-commutative97.3%
associate-+l+97.3%
+-commutative97.3%
+-commutative97.3%
*-commutative97.3%
associate-+l+97.3%
+-commutative97.3%
associate-+l+97.3%
Applied egg-rr97.3%
*-commutative97.3%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*l/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.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
(if (<= beta 2.45e+62)
(/
(* (+ 1.0 beta) (+ 1.0 alpha))
(* (+ alpha (+ beta 2.0)) (* (+ beta 3.0) (+ beta 2.0))))
(/ (/ (- alpha -1.0) (+ alpha (+ beta 3.0))) (+ 2.0 (+ beta alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.45e+62) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.45d+62) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / ((alpha + (beta + 2.0d0)) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha - (-1.0d0)) / (alpha + (beta + 3.0d0))) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.45e+62) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.45e+62: tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.45e+62) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.45e+62)
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.45e+62], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.45 \cdot 10^{+62}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\alpha + \left(\beta + 3\right)}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 2.4499999999999998e62Initial program 99.3%
Simplified94.7%
Taylor expanded in alpha around 0 68.5%
+-commutative68.5%
+-commutative68.5%
Simplified68.5%
if 2.4499999999999998e62 < beta Initial program 80.5%
associate-/l/76.2%
+-commutative76.2%
associate-+l+76.2%
*-commutative76.2%
metadata-eval76.2%
associate-+l+76.2%
metadata-eval76.2%
+-commutative76.2%
+-commutative76.2%
+-commutative76.2%
metadata-eval76.2%
metadata-eval76.2%
associate-+l+76.2%
Simplified76.2%
Taylor expanded in beta around -inf 86.0%
mul-1-neg86.0%
sub-neg86.0%
mul-1-neg86.0%
distribute-neg-in86.0%
+-commutative86.0%
mul-1-neg86.0%
distribute-lft-in86.0%
metadata-eval86.0%
mul-1-neg86.0%
unsub-neg86.0%
Simplified86.0%
*-un-lft-identity86.0%
associate-+l+86.0%
associate-+r+86.0%
+-commutative86.0%
associate-+r+86.0%
Applied egg-rr86.0%
*-lft-identity86.0%
associate-/r*86.8%
+-commutative86.8%
+-commutative86.8%
+-commutative86.8%
associate-+r+86.8%
Simplified86.8%
Final simplification73.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.8e+62)
(/
(* (+ 1.0 beta) (+ 1.0 alpha))
(* (+ alpha (+ beta 2.0)) (* (+ beta 3.0) (+ beta 2.0))))
(*
(/ (+ 1.0 alpha) (+ beta (+ alpha 2.0)))
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8e+62) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.8d+62) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / ((alpha + (beta + 2.0d0)) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8e+62) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.8e+62: tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.8e+62) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.8e+62)
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.8e+62], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.8 \cdot 10^{+62}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.8e62Initial program 99.3%
Simplified94.7%
Taylor expanded in alpha around 0 68.5%
+-commutative68.5%
+-commutative68.5%
Simplified68.5%
if 1.8e62 < beta Initial program 80.5%
Simplified61.6%
Taylor expanded in alpha around 0 61.6%
times-frac91.1%
+-commutative91.1%
+-commutative91.1%
associate-+r+91.1%
+-commutative91.1%
associate-+l+91.1%
+-commutative91.1%
+-commutative91.1%
*-commutative91.1%
associate-+l+91.1%
+-commutative91.1%
associate-+l+91.1%
Applied egg-rr91.1%
*-commutative91.1%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 86.1%
mul-1-neg86.1%
*-commutative86.1%
Simplified86.1%
Final simplification73.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ beta (+ alpha 2.0)))) (* (/ (/ (+ 1.0 beta) (+ beta (+ alpha 3.0))) t_0) (/ (+ 1.0 alpha) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + beta) / (beta + (alpha + 3.0))) / t_0) * ((1.0 + alpha) / t_0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = beta + (alpha + 2.0d0)
code = (((1.0d0 + beta) / (beta + (alpha + 3.0d0))) / t_0) * ((1.0d0 + alpha) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + beta) / (beta + (alpha + 3.0))) / t_0) * ((1.0 + alpha) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return (((1.0 + beta) / (beta + (alpha + 3.0))) / t_0) * ((1.0 + alpha) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) / Float64(beta + Float64(alpha + 3.0))) / t_0) * Float64(Float64(1.0 + alpha) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = (((1.0 + beta) / (beta + (alpha + 3.0))) / t_0) * ((1.0 + alpha) / t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\frac{\frac{1 + \beta}{\beta + \left(\alpha + 3\right)}}{t\_0} \cdot \frac{1 + \alpha}{t\_0}
\end{array}
\end{array}
Initial program 94.1%
Simplified85.5%
Taylor expanded in alpha around 0 85.6%
times-frac97.3%
+-commutative97.3%
+-commutative97.3%
associate-+r+97.3%
+-commutative97.3%
associate-+l+97.3%
+-commutative97.3%
+-commutative97.3%
*-commutative97.3%
associate-+l+97.3%
+-commutative97.3%
associate-+l+97.3%
Applied egg-rr97.3%
*-commutative97.3%
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 3.0))))
(if (<= beta 2e+37)
(/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (* (+ beta 2.0) t_0)))
(/ (/ (- alpha -1.0) t_0) (+ 2.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 2e+37) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * t_0));
} else {
tmp = ((alpha - -1.0) / t_0) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (beta <= 2d+37) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * ((beta + 2.0d0) * t_0))
else
tmp = ((alpha - (-1.0d0)) / t_0) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 2e+37) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * t_0));
} else {
tmp = ((alpha - -1.0) / t_0) / (2.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) tmp = 0 if beta <= 2e+37: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * t_0)) else: tmp = ((alpha - -1.0) / t_0) / (2.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 2e+37) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 2.0) * t_0))); else tmp = Float64(Float64(Float64(alpha - -1.0) / t_0) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 2e+37)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * t_0));
else
tmp = ((alpha - -1.0) / t_0) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+37], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+37}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 2\right) \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{t\_0}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 1.99999999999999991e37Initial program 99.9%
Simplified96.2%
Taylor expanded in alpha around 0 85.6%
+-commutative85.6%
Simplified85.6%
Taylor expanded in alpha around 0 87.3%
if 1.99999999999999991e37 < beta Initial program 80.5%
associate-/l/76.4%
+-commutative76.4%
associate-+l+76.4%
*-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
metadata-eval76.4%
+-commutative76.4%
+-commutative76.4%
+-commutative76.4%
metadata-eval76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
Taylor expanded in beta around -inf 83.2%
mul-1-neg83.2%
sub-neg83.2%
mul-1-neg83.2%
distribute-neg-in83.2%
+-commutative83.2%
mul-1-neg83.2%
distribute-lft-in83.2%
metadata-eval83.2%
mul-1-neg83.2%
unsub-neg83.2%
Simplified83.2%
*-un-lft-identity83.2%
associate-+l+83.2%
associate-+r+83.2%
+-commutative83.2%
associate-+r+83.2%
Applied egg-rr83.2%
*-lft-identity83.2%
associate-/r*82.9%
+-commutative82.9%
+-commutative82.9%
+-commutative82.9%
associate-+r+82.9%
Simplified82.9%
Final simplification86.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.06e+32)
(/
(/ (+ 1.0 beta) (+ beta 2.0))
(* (+ alpha (+ beta 2.0)) (+ 3.0 (+ beta alpha))))
(/ (/ (- alpha -1.0) (+ alpha (+ beta 3.0))) (+ 2.0 (+ beta alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.06e+32) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha)));
} else {
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.06d+32) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((alpha + (beta + 2.0d0)) * (3.0d0 + (beta + alpha)))
else
tmp = ((alpha - (-1.0d0)) / (alpha + (beta + 3.0d0))) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.06e+32) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha)));
} else {
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.06e+32: tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha))) else: tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.06e+32) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.06e+32)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha)));
else
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.06e+32], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.06 \cdot 10^{+32}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\alpha + \left(\beta + 3\right)}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 1.0600000000000001e32Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in alpha around 0 87.1%
+-commutative87.1%
Simplified87.1%
if 1.0600000000000001e32 < beta Initial program 80.9%
associate-/l/77.0%
+-commutative77.0%
associate-+l+77.0%
*-commutative77.0%
metadata-eval77.0%
associate-+l+77.0%
metadata-eval77.0%
+-commutative77.0%
+-commutative77.0%
+-commutative77.0%
metadata-eval77.0%
metadata-eval77.0%
associate-+l+77.0%
Simplified77.0%
Taylor expanded in beta around -inf 83.6%
mul-1-neg83.6%
sub-neg83.6%
mul-1-neg83.6%
distribute-neg-in83.6%
+-commutative83.6%
mul-1-neg83.6%
distribute-lft-in83.6%
metadata-eval83.6%
mul-1-neg83.6%
unsub-neg83.6%
Simplified83.6%
*-un-lft-identity83.6%
associate-+l+83.6%
associate-+r+83.6%
+-commutative83.6%
associate-+r+83.6%
Applied egg-rr83.6%
*-lft-identity83.6%
associate-/r*83.3%
+-commutative83.3%
+-commutative83.3%
+-commutative83.3%
associate-+r+83.3%
Simplified83.3%
Final simplification86.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ beta (+ alpha 2.0)))) (* (/ (+ 1.0 alpha) t_0) (/ (/ (+ 1.0 beta) (+ beta 3.0)) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return ((1.0 + alpha) / t_0) * (((1.0 + beta) / (beta + 3.0)) / t_0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = beta + (alpha + 2.0d0)
code = ((1.0d0 + alpha) / t_0) * (((1.0d0 + beta) / (beta + 3.0d0)) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return ((1.0 + alpha) / t_0) * (((1.0 + beta) / (beta + 3.0)) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return ((1.0 + alpha) / t_0) * (((1.0 + beta) / (beta + 3.0)) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(Float64(1.0 + beta) / Float64(beta + 3.0)) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = ((1.0 + alpha) / t_0) * (((1.0 + beta) / (beta + 3.0)) / t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\frac{1 + \alpha}{t\_0} \cdot \frac{\frac{1 + \beta}{\beta + 3}}{t\_0}
\end{array}
\end{array}
Initial program 94.1%
Simplified85.5%
Taylor expanded in alpha around 0 85.6%
times-frac97.3%
+-commutative97.3%
+-commutative97.3%
associate-+r+97.3%
+-commutative97.3%
associate-+l+97.3%
+-commutative97.3%
+-commutative97.3%
*-commutative97.3%
associate-+l+97.3%
+-commutative97.3%
associate-+l+97.3%
Applied egg-rr97.3%
*-commutative97.3%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 73.9%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ beta (+ alpha 2.0)))) (/ (* (/ (+ 1.0 alpha) t_0) (/ (+ 1.0 beta) (+ beta 3.0))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + alpha) / t_0) * ((1.0 + beta) / (beta + 3.0))) / t_0;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = beta + (alpha + 2.0d0)
code = (((1.0d0 + alpha) / t_0) * ((1.0d0 + beta) / (beta + 3.0d0))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + alpha) / t_0) * ((1.0 + beta) / (beta + 3.0))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return (((1.0 + alpha) / t_0) * ((1.0 + beta) / (beta + 3.0))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 + beta) / Float64(beta + 3.0))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = (((1.0 + alpha) / t_0) * ((1.0 + beta) / (beta + 3.0))) / t_0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / 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 := \beta + \left(\alpha + 2\right)\\
\frac{\frac{1 + \alpha}{t\_0} \cdot \frac{1 + \beta}{\beta + 3}}{t\_0}
\end{array}
\end{array}
Initial program 94.1%
Simplified85.5%
Taylor expanded in alpha around 0 85.6%
times-frac97.3%
+-commutative97.3%
+-commutative97.3%
associate-+r+97.3%
+-commutative97.3%
associate-+l+97.3%
+-commutative97.3%
+-commutative97.3%
*-commutative97.3%
associate-+l+97.3%
+-commutative97.3%
associate-+l+97.3%
Applied egg-rr97.3%
*-commutative97.3%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*l/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 73.9%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.05) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 2.0) (+ 3.0 (+ beta alpha)))) (/ (/ (- alpha -1.0) (+ alpha (+ beta 3.0))) (+ 2.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.05) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.05d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (3.0d0 + (beta + alpha)))
else
tmp = ((alpha - (-1.0d0)) / (alpha + (beta + 3.0d0))) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.05) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.05: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (beta + alpha))) else: tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.05) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.05)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (beta + alpha)));
else
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.05], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.05:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\alpha + \left(\beta + 3\right)}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 2.0499999999999998Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.2%
Taylor expanded in beta around 0 98.7%
if 2.0499999999999998 < beta Initial program 82.4%
associate-/l/78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
+-commutative78.8%
+-commutative78.8%
+-commutative78.8%
metadata-eval78.8%
metadata-eval78.8%
associate-+l+78.8%
Simplified78.8%
Taylor expanded in beta around -inf 81.2%
mul-1-neg81.2%
sub-neg81.2%
mul-1-neg81.2%
distribute-neg-in81.2%
+-commutative81.2%
mul-1-neg81.2%
distribute-lft-in81.2%
metadata-eval81.2%
mul-1-neg81.2%
unsub-neg81.2%
Simplified81.2%
*-un-lft-identity81.2%
associate-+l+81.2%
associate-+r+81.2%
+-commutative81.2%
associate-+r+81.2%
Applied egg-rr81.2%
*-lft-identity81.2%
associate-/r*79.8%
+-commutative79.8%
+-commutative79.8%
+-commutative79.8%
associate-+r+79.8%
Simplified79.8%
Final simplification92.5%
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) (+ alpha 2.0)) (* (+ alpha 3.0) (+ alpha 2.0))) (/ (/ (+ 1.0 alpha) (+ 3.0 (+ beta alpha))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.0d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 3.0d0) * (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + alpha))) / beta
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) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0)) else: tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + alpha))) / beta); 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) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.7%
Taylor expanded in beta around 0 97.7%
+-commutative97.7%
+-commutative97.7%
Simplified97.7%
if 6 < beta Initial program 82.3%
Taylor expanded in beta around inf 79.9%
div-inv79.9%
metadata-eval79.9%
associate-+l+79.9%
metadata-eval79.9%
associate-+r+79.9%
+-commutative79.9%
associate-+l+79.9%
Applied egg-rr79.9%
associate-*l/79.9%
+-commutative79.9%
Applied egg-rr79.9%
associate-*r/79.9%
*-rgt-identity79.9%
+-commutative79.9%
+-commutative79.9%
associate-+r+79.9%
Simplified79.9%
Final simplification91.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.8) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 3.0) (+ alpha 2.0))) (/ (/ (- alpha -1.0) (+ alpha (+ beta 3.0))) (+ 2.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.8d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 3.0d0) * (alpha + 2.0d0))
else
tmp = ((alpha - (-1.0d0)) / (alpha + (beta + 3.0d0))) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.8: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0)) else: tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.8) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.8)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
else
tmp = ((alpha - -1.0) / (alpha + (beta + 3.0))) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.8], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.8:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\alpha + \left(\beta + 3\right)}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 1.80000000000000004Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 98.2%
Taylor expanded in beta around 0 98.2%
+-commutative98.2%
+-commutative98.2%
Simplified98.2%
if 1.80000000000000004 < beta Initial program 82.4%
associate-/l/78.8%
+-commutative78.8%
associate-+l+78.8%
*-commutative78.8%
metadata-eval78.8%
associate-+l+78.8%
metadata-eval78.8%
+-commutative78.8%
+-commutative78.8%
+-commutative78.8%
metadata-eval78.8%
metadata-eval78.8%
associate-+l+78.8%
Simplified78.8%
Taylor expanded in beta around -inf 81.2%
mul-1-neg81.2%
sub-neg81.2%
mul-1-neg81.2%
distribute-neg-in81.2%
+-commutative81.2%
mul-1-neg81.2%
distribute-lft-in81.2%
metadata-eval81.2%
mul-1-neg81.2%
unsub-neg81.2%
Simplified81.2%
*-un-lft-identity81.2%
associate-+l+81.2%
associate-+r+81.2%
+-commutative81.2%
associate-+r+81.2%
Applied egg-rr81.2%
*-lft-identity81.2%
associate-/r*79.8%
+-commutative79.8%
+-commutative79.8%
+-commutative79.8%
associate-+r+79.8%
Simplified79.8%
Final simplification92.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 19.0) (* 0.5 (/ (+ 1.0 alpha) (* (+ alpha 3.0) (+ alpha 2.0)))) (/ (/ (+ 1.0 alpha) (+ 3.0 (+ beta alpha))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 19.0) {
tmp = 0.5 * ((1.0 + alpha) / ((alpha + 3.0) * (alpha + 2.0)));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 19.0d0) then
tmp = 0.5d0 * ((1.0d0 + alpha) / ((alpha + 3.0d0) * (alpha + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + alpha))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 19.0) {
tmp = 0.5 * ((1.0 + alpha) / ((alpha + 3.0) * (alpha + 2.0)));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 19.0: tmp = 0.5 * ((1.0 + alpha) / ((alpha + 3.0) * (alpha + 2.0))) else: tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 19.0) tmp = Float64(0.5 * Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + alpha))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 19.0)
tmp = 0.5 * ((1.0 + alpha) / ((alpha + 3.0) * (alpha + 2.0)));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 19.0], N[(0.5 * N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 19:\\
\;\;\;\;0.5 \cdot \frac{1 + \alpha}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 19Initial program 99.9%
Simplified96.6%
Taylor expanded in alpha around 0 86.0%
+-commutative86.0%
Simplified86.0%
Taylor expanded in beta around 0 84.7%
+-commutative84.7%
+-commutative84.7%
Simplified84.7%
if 19 < beta Initial program 82.3%
Taylor expanded in beta around inf 79.9%
div-inv79.9%
metadata-eval79.9%
associate-+l+79.9%
metadata-eval79.9%
associate-+r+79.9%
+-commutative79.9%
associate-+l+79.9%
Applied egg-rr79.9%
associate-*l/79.9%
+-commutative79.9%
Applied egg-rr79.9%
associate-*r/79.9%
*-rgt-identity79.9%
+-commutative79.9%
+-commutative79.9%
associate-+r+79.9%
Simplified79.9%
Final simplification83.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.4) (/ 0.5 (* (+ beta 3.0) (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = 0.5 / ((beta + 3.0) * (beta + 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 <= 4.4d0) then
tmp = 0.5d0 / ((beta + 3.0d0) * (beta + 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 <= 4.4) {
tmp = 0.5 / ((beta + 3.0) * (beta + 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 <= 4.4: tmp = 0.5 / ((beta + 3.0) * (beta + 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 <= 4.4) tmp = Float64(0.5 / Float64(Float64(beta + 3.0) * Float64(beta + 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 <= 4.4)
tmp = 0.5 / ((beta + 3.0) * (beta + 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, 4.4], N[(0.5 / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $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 4.4:\\
\;\;\;\;\frac{0.5}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.7%
Taylor expanded in alpha around 0 68.2%
if 4.4000000000000004 < beta Initial program 82.3%
Taylor expanded in beta around inf 79.9%
*-un-lft-identity79.9%
metadata-eval79.9%
associate-+l+79.9%
metadata-eval79.9%
associate-+r+79.9%
+-commutative79.9%
associate-+l+79.9%
Applied egg-rr79.9%
*-lft-identity79.9%
+-commutative79.9%
Simplified79.9%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.4) (/ 0.5 (* (+ beta 3.0) (+ beta 2.0))) (/ (/ (+ 1.0 alpha) (+ 3.0 (+ beta alpha))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = 0.5 / ((beta + 3.0) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.4d0) then
tmp = 0.5d0 / ((beta + 3.0d0) * (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + alpha))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = 0.5 / ((beta + 3.0) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.4: tmp = 0.5 / ((beta + 3.0) * (beta + 2.0)) else: tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.4) tmp = Float64(0.5 / Float64(Float64(beta + 3.0) * Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + alpha))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.4)
tmp = 0.5 / ((beta + 3.0) * (beta + 2.0));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.4], N[(0.5 / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.4:\\
\;\;\;\;\frac{0.5}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.7%
Taylor expanded in alpha around 0 68.2%
if 4.4000000000000004 < beta Initial program 82.3%
Taylor expanded in beta around inf 79.9%
div-inv79.9%
metadata-eval79.9%
associate-+l+79.9%
metadata-eval79.9%
associate-+r+79.9%
+-commutative79.9%
associate-+l+79.9%
Applied egg-rr79.9%
associate-*l/79.9%
+-commutative79.9%
Applied egg-rr79.9%
associate-*r/79.9%
*-rgt-identity79.9%
+-commutative79.9%
+-commutative79.9%
associate-+r+79.9%
Simplified79.9%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9.2) (/ 0.5 (* (+ beta 3.0) (+ beta 2.0))) (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.2) {
tmp = 0.5 / ((beta + 3.0) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 9.2d0) then
tmp = 0.5d0 / ((beta + 3.0d0) * (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.2) {
tmp = 0.5 / ((beta + 3.0) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.2: tmp = 0.5 / ((beta + 3.0) * (beta + 2.0)) else: tmp = ((1.0 + alpha) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.2) tmp = Float64(0.5 / Float64(Float64(beta + 3.0) * Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.2)
tmp = 0.5 / ((beta + 3.0) * (beta + 2.0));
else
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 9.2], N[(0.5 / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.2:\\
\;\;\;\;\frac{0.5}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 9.1999999999999993Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.7%
Taylor expanded in alpha around 0 68.2%
if 9.1999999999999993 < beta Initial program 82.3%
Taylor expanded in beta around inf 79.9%
div-inv79.9%
metadata-eval79.9%
associate-+l+79.9%
metadata-eval79.9%
associate-+r+79.9%
+-commutative79.9%
associate-+l+79.9%
Applied egg-rr79.9%
Taylor expanded in beta around inf 79.6%
Final simplification72.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((1.0 + alpha) / beta) * (1.0 / beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = ((1.0d0 + alpha) / beta) * (1.0d0 / beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((1.0 + alpha) / beta) * (1.0 / beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((1.0 + alpha) / beta) * (1.0 / beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(1.0 / beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
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] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}
\end{array}
Initial program 94.1%
Taylor expanded in beta around inf 28.3%
div-inv28.2%
metadata-eval28.2%
associate-+l+28.2%
metadata-eval28.2%
associate-+r+28.2%
+-commutative28.2%
associate-+l+28.2%
Applied egg-rr28.2%
Taylor expanded in beta around inf 28.4%
Final simplification28.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (beta * (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 / (beta * (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (beta * (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot \left(\beta + 3\right)}
\end{array}
Initial program 94.1%
Taylor expanded in beta around inf 28.3%
Taylor expanded in alpha around 0 26.4%
+-commutative26.4%
Simplified26.4%
Final simplification26.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ 1.0 beta) (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return (1.0 / beta) / (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 / beta) / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return (1.0 / beta) / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return (1.0 / beta) / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(1.0 / beta) / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = (1.0 / beta) / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{1}{\beta}}{\beta + 3}
\end{array}
Initial program 94.1%
Taylor expanded in beta around inf 28.3%
div-inv28.2%
metadata-eval28.2%
associate-+l+28.2%
metadata-eval28.2%
associate-+r+28.2%
+-commutative28.2%
associate-+l+28.2%
Applied egg-rr28.2%
Taylor expanded in alpha around 0 26.4%
associate-/r*26.4%
Simplified26.4%
Final simplification26.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 94.1%
Taylor expanded in beta around inf 28.3%
Taylor expanded in alpha around 0 26.4%
+-commutative26.4%
Simplified26.4%
Taylor expanded in beta around 0 4.2%
Final simplification4.2%
herbie shell --seed 2024130
(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)))