
(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 2.0) alpha)))
(if (<= beta 1e+146)
(/
1.0
(*
(/ (+ alpha (+ beta 3.0)) (/ (* (+ beta 1.0) (+ 1.0 alpha)) t_0))
t_0))
(/ (/ (+ 1.0 alpha) beta) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1e+146) {
tmp = 1.0 / (((alpha + (beta + 3.0)) / (((beta + 1.0) * (1.0 + alpha)) / t_0)) * t_0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 1d+146) then
tmp = 1.0d0 / (((alpha + (beta + 3.0d0)) / (((beta + 1.0d0) * (1.0d0 + alpha)) / t_0)) * t_0)
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 t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1e+146) {
tmp = 1.0 / (((alpha + (beta + 3.0)) / (((beta + 1.0) * (1.0 + alpha)) / t_0)) * t_0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 1e+146: tmp = 1.0 / (((alpha + (beta + 3.0)) / (((beta + 1.0) * (1.0 + alpha)) / t_0)) * t_0) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 1e+146) tmp = Float64(1.0 / Float64(Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / t_0)) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 1e+146)
tmp = 1.0 / (((alpha + (beta + 3.0)) / (((beta + 1.0) * (1.0 + alpha)) / t_0)) * t_0);
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 1e+146], N[(1.0 / N[(N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 10^{+146}:\\
\;\;\;\;\frac{1}{\frac{\alpha + \left(\beta + 3\right)}{\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{t\_0}} \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 9.99999999999999934e145Initial program 98.4%
Simplified84.3%
associate-+r+84.3%
fma-undefine84.3%
*-commutative84.3%
associate-+l+84.3%
+-commutative84.3%
associate-+l+84.3%
*-commutative84.3%
associate-*r*84.3%
associate-+r+84.3%
+-commutative84.3%
associate-/l/96.8%
clear-num96.8%
inv-pow96.8%
Applied egg-rr96.8%
unpow-196.8%
associate-/l*97.7%
+-commutative97.7%
+-commutative97.7%
+-commutative97.7%
+-commutative97.7%
+-commutative97.7%
+-commutative97.7%
Simplified97.7%
if 9.99999999999999934e145 < beta Initial program 70.5%
Taylor expanded in beta around inf 94.2%
Taylor expanded in alpha around 0 94.1%
+-commutative94.1%
Simplified94.1%
Final simplification97.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 1.35e+97)
(/ (* (+ beta 1.0) (+ 1.0 alpha)) (* t_0 (* (+ alpha (+ beta 3.0)) t_0)))
(/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1.35e+97) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_0 * ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 1.35d+97) then
tmp = ((beta + 1.0d0) * (1.0d0 + alpha)) / (t_0 * ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1.35e+97) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_0 * ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 1.35e+97: tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_0 * ((alpha + (beta + 3.0)) * t_0)) else: tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 1.35e+97) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / Float64(t_0 * Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 1.35e+97)
tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_0 * ((alpha + (beta + 3.0)) * t_0));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 1.35e+97], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 1.35 \cdot 10^{+97}:\\
\;\;\;\;\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{t\_0 \cdot \left(\left(\alpha + \left(\beta + 3\right)\right) \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1.34999999999999997e97Initial program 99.3%
Simplified90.3%
if 1.34999999999999997e97 < beta Initial program 75.0%
Taylor expanded in beta around inf 91.3%
Taylor expanded in alpha around 0 91.3%
Final simplification90.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 2.6e+71)
(* (/ (+ 1.0 alpha) t_0) (/ (+ beta 1.0) (* (+ alpha (+ beta 3.0)) t_0)))
(/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 2.6e+71) {
tmp = ((1.0 + alpha) / t_0) * ((beta + 1.0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 2.6d+71) then
tmp = ((1.0d0 + alpha) / t_0) * ((beta + 1.0d0) / ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 2.6e+71) {
tmp = ((1.0 + alpha) / t_0) * ((beta + 1.0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 2.6e+71: tmp = ((1.0 + alpha) / t_0) * ((beta + 1.0) / ((alpha + (beta + 3.0)) * t_0)) else: tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 2.6e+71) tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(beta + 1.0) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 2.6e+71)
tmp = ((1.0 + alpha) / t_0) * ((beta + 1.0) / ((alpha + (beta + 3.0)) * t_0));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 2.6e+71], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 2.6 \cdot 10^{+71}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{\beta + 1}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 2.59999999999999991e71Initial program 99.3%
Simplified90.3%
times-frac99.0%
+-commutative99.0%
Applied egg-rr99.0%
if 2.59999999999999991e71 < beta Initial program 77.8%
Taylor expanded in beta around inf 91.0%
Taylor expanded in alpha around 0 91.0%
Final simplification96.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 9.5)
(/ (/ (+ 1.0 alpha) (+ 2.0 alpha)) (* t_0 (+ 3.0 (+ beta alpha))))
(*
(/ (+ 1.0 alpha) t_0)
(/ (- 1.0 (/ (+ 4.0 (* 2.0 alpha)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 9.5) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / (t_0 * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 9.5d0) then
tmp = ((1.0d0 + alpha) / (2.0d0 + alpha)) / (t_0 * (3.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 + alpha) / t_0) * ((1.0d0 - ((4.0d0 + (2.0d0 * alpha)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 9.5) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / (t_0 * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 9.5: tmp = ((1.0 + alpha) / (2.0 + alpha)) / (t_0 * (3.0 + (beta + alpha))) else: tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 9.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + alpha)) / Float64(t_0 * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(2.0 * alpha)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 9.5)
tmp = ((1.0 + alpha) / (2.0 + alpha)) / (t_0 * (3.0 + (beta + alpha)));
else
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((4.0 + (2.0 * alpha)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 9.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(2.0 * alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 9.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \alpha}}{t\_0 \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 - \frac{4 + 2 \cdot \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 9.5Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in beta around 0 97.3%
if 9.5 < beta Initial program 83.7%
Simplified66.4%
times-frac90.8%
+-commutative90.8%
Applied egg-rr90.8%
Taylor expanded in beta around inf 81.1%
mul-1-neg81.1%
Simplified81.1%
Final simplification90.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 7.0)
(/
(/ (+ 1.0 alpha) (+ 2.0 alpha))
(* (+ (+ beta 2.0) alpha) (+ 3.0 (+ beta alpha))))
(/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 1.0 (+ 2.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.0) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / (((beta + 2.0) + alpha) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.0d0) then
tmp = ((1.0d0 + alpha) / (2.0d0 + alpha)) / (((beta + 2.0d0) + alpha) * (3.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.0) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / (((beta + 2.0) + alpha) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.0: tmp = ((1.0 + alpha) / (2.0 + alpha)) / (((beta + 2.0) + alpha) * (3.0 + (beta + alpha))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + alpha)) / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.0)
tmp = ((1.0 + alpha) / (2.0 + alpha)) / (((beta + 2.0) + alpha) * (3.0 + (beta + alpha)));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \alpha}}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 7Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in beta around 0 97.3%
if 7 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 81.5%
Final simplification90.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6400000000.0)
(/
1.0
(/ (* (+ beta 2.0) (+ alpha (+ beta 3.0))) (/ (+ beta 1.0) (+ beta 2.0))))
(/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 1.0 (+ 2.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6400000000.0) {
tmp = 1.0 / (((beta + 2.0) * (alpha + (beta + 3.0))) / ((beta + 1.0) / (beta + 2.0)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6400000000.0d0) then
tmp = 1.0d0 / (((beta + 2.0d0) * (alpha + (beta + 3.0d0))) / ((beta + 1.0d0) / (beta + 2.0d0)))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6400000000.0) {
tmp = 1.0 / (((beta + 2.0) * (alpha + (beta + 3.0))) / ((beta + 1.0) / (beta + 2.0)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6400000000.0: tmp = 1.0 / (((beta + 2.0) * (alpha + (beta + 3.0))) / ((beta + 1.0) / (beta + 2.0))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6400000000.0) tmp = Float64(1.0 / Float64(Float64(Float64(beta + 2.0) * Float64(alpha + Float64(beta + 3.0))) / Float64(Float64(beta + 1.0) / Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6400000000.0)
tmp = 1.0 / (((beta + 2.0) * (alpha + (beta + 3.0))) / ((beta + 1.0) / (beta + 2.0)));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6400000000.0], N[(1.0 / N[(N[(N[(beta + 2.0), $MachinePrecision] * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6400000000:\\
\;\;\;\;\frac{1}{\frac{\left(\beta + 2\right) \cdot \left(\alpha + \left(\beta + 3\right)\right)}{\frac{\beta + 1}{\beta + 2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 6.4e9Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
Simplified83.6%
Taylor expanded in alpha around 0 67.4%
+-commutative67.4%
Simplified67.4%
clear-num67.4%
inv-pow67.4%
*-commutative67.4%
associate-+r+67.4%
Applied egg-rr67.4%
unpow-167.4%
+-commutative67.4%
+-commutative67.4%
Simplified67.4%
if 6.4e9 < beta Initial program 83.2%
Taylor expanded in beta around inf 83.0%
Taylor expanded in alpha around 0 83.0%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6400000000.0) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ 3.0 (+ beta alpha)))) (/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6400000000.0) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6400000000.0d0) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (3.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6400000000.0) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6400000000.0: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6400000000.0) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6400000000.0)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha)));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6400000000.0], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6400000000:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 6.4e9Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
Simplified83.6%
Taylor expanded in alpha around 0 67.4%
+-commutative67.4%
Simplified67.4%
if 6.4e9 < beta Initial program 83.2%
Taylor expanded in beta around inf 83.0%
Taylor expanded in alpha around 0 83.0%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 1.0 (* 4.0 (+ beta (+ alpha 3.0)))) (/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.2d0) then
tmp = 1.0d0 / (4.0d0 * (beta + (alpha + 3.0d0)))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2: tmp = 1.0 / (4.0 * (beta + (alpha + 3.0))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.2) tmp = Float64(1.0 / Float64(4.0 * Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.2)
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.2], N[(1.0 / N[(4.0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2:\\
\;\;\;\;\frac{1}{4 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
clear-num67.9%
inv-pow67.9%
*-commutative67.9%
associate-+r+67.9%
Applied egg-rr67.9%
unpow-167.9%
+-commutative67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in beta around 0 67.8%
distribute-lft-out67.8%
Simplified67.8%
if 4.20000000000000018 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 81.5%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 1.0 (* 4.0 (+ beta (+ alpha 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.2d0) then
tmp = 1.0d0 / (4.0d0 * (beta + (alpha + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2: tmp = 1.0 / (4.0 * (beta + (alpha + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.2) tmp = Float64(1.0 / Float64(4.0 * Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.2)
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.2], N[(1.0 / N[(4.0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2:\\
\;\;\;\;\frac{1}{4 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
clear-num67.9%
inv-pow67.9%
*-commutative67.9%
associate-+r+67.9%
Applied egg-rr67.9%
unpow-167.9%
+-commutative67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in beta around 0 67.8%
distribute-lft-out67.8%
Simplified67.8%
if 4.20000000000000018 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 81.5%
+-commutative81.5%
associate-+r+81.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
Simplified81.5%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 1.0 (* 4.0 (+ beta (+ alpha 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.2d0) then
tmp = 1.0d0 / (4.0d0 * (beta + (alpha + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2: tmp = 1.0 / (4.0 * (beta + (alpha + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.2) tmp = Float64(1.0 / Float64(4.0 * Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.2)
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.2], N[(1.0 / N[(4.0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $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 4.2:\\
\;\;\;\;\frac{1}{4 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
clear-num67.9%
inv-pow67.9%
*-commutative67.9%
associate-+r+67.9%
Applied egg-rr67.9%
unpow-167.9%
+-commutative67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in beta around 0 67.8%
distribute-lft-out67.8%
Simplified67.8%
if 4.20000000000000018 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 81.3%
+-commutative81.3%
Simplified81.3%
Final simplification73.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.8) (/ 1.0 (* 4.0 (+ beta (+ alpha 3.0)))) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.8) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.8d0) then
tmp = 1.0d0 / (4.0d0 * (beta + (alpha + 3.0d0)))
else
tmp = (1.0d0 + alpha) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.8) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.8: tmp = 1.0 / (4.0 * (beta + (alpha + 3.0))) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.8) tmp = Float64(1.0 / Float64(4.0 * Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.8)
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
else
tmp = (1.0 + alpha) / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.8], N[(1.0 / N[(4.0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.8:\\
\;\;\;\;\frac{1}{4 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.79999999999999982Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
clear-num67.9%
inv-pow67.9%
*-commutative67.9%
associate-+r+67.9%
Applied egg-rr67.9%
unpow-167.9%
+-commutative67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in beta around 0 67.8%
distribute-lft-out67.8%
Simplified67.8%
if 6.79999999999999982 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
*-un-lft-identity81.5%
associate-/l/79.4%
+-commutative79.4%
metadata-eval79.4%
associate-+l+79.4%
metadata-eval79.4%
associate-+r+79.4%
Applied egg-rr79.4%
*-lft-identity79.4%
+-commutative79.4%
*-commutative79.4%
associate-+r+79.4%
+-commutative79.4%
+-commutative79.4%
Simplified79.4%
Taylor expanded in beta around inf 76.6%
Final simplification71.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 0.25 (+ alpha 3.0)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.2d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = (1.0d0 + alpha) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2: tmp = 0.25 / (alpha + 3.0) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.2) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.2)
tmp = 0.25 / (alpha + 3.0);
else
tmp = (1.0 + alpha) / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.2], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in beta around 0 67.0%
if 4.20000000000000018 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
*-un-lft-identity81.5%
associate-/l/79.4%
+-commutative79.4%
metadata-eval79.4%
associate-+l+79.4%
metadata-eval79.4%
associate-+r+79.4%
Applied egg-rr79.4%
*-lft-identity79.4%
+-commutative79.4%
*-commutative79.4%
associate-+r+79.4%
+-commutative79.4%
+-commutative79.4%
Simplified79.4%
Taylor expanded in beta around inf 76.6%
Final simplification71.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in beta around 0 67.0%
if 2.5 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 74.8%
Final simplification70.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.3e+74) (/ 0.25 (+ alpha 3.0)) (/ alpha (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3e+74) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = alpha / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.3d+74) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = alpha / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3e+74) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = alpha / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3e+74: tmp = 0.25 / (alpha + 3.0) else: tmp = alpha / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3e+74) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(alpha / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.3e+74)
tmp = 0.25 / (alpha + 3.0);
else
tmp = alpha / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.3e+74], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(alpha / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3 \cdot 10^{+74}:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.3000000000000002e74Initial program 99.3%
associate-/l/98.4%
+-commutative98.4%
associate-+l+98.4%
*-commutative98.4%
metadata-eval98.4%
associate-+l+98.4%
metadata-eval98.4%
+-commutative98.4%
+-commutative98.4%
+-commutative98.4%
metadata-eval98.4%
metadata-eval98.4%
associate-+l+98.4%
Simplified98.5%
Taylor expanded in alpha around 0 82.3%
+-commutative82.3%
Simplified82.3%
Taylor expanded in alpha around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in beta around 0 55.0%
if 3.3000000000000002e74 < beta Initial program 76.9%
Taylor expanded in beta around inf 90.6%
*-un-lft-identity90.6%
associate-/l/86.2%
+-commutative86.2%
metadata-eval86.2%
associate-+l+86.2%
metadata-eval86.2%
associate-+r+86.2%
Applied egg-rr86.2%
*-lft-identity86.2%
+-commutative86.2%
*-commutative86.2%
associate-+r+86.2%
+-commutative86.2%
+-commutative86.2%
Simplified86.2%
Taylor expanded in alpha around inf 59.7%
Taylor expanded in beta around inf 57.1%
Final simplification55.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 20.0) (/ 0.25 (+ alpha 3.0)) (/ alpha (* beta alpha))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 20.0) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = alpha / (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 <= 20.0d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = alpha / (beta * alpha)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 20.0) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = alpha / (beta * alpha);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 20.0: tmp = 0.25 / (alpha + 3.0) else: tmp = alpha / (beta * alpha) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 20.0) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(alpha / Float64(beta * alpha)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 20.0)
tmp = 0.25 / (alpha + 3.0);
else
tmp = alpha / (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, 20.0], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(alpha / N[(beta * alpha), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 20:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{\beta \cdot \alpha}\\
\end{array}
\end{array}
if beta < 20Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in beta around 0 67.0%
if 20 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
*-un-lft-identity81.5%
associate-/l/79.4%
+-commutative79.4%
metadata-eval79.4%
associate-+l+79.4%
metadata-eval79.4%
associate-+r+79.4%
Applied egg-rr79.4%
*-lft-identity79.4%
+-commutative79.4%
*-commutative79.4%
associate-+r+79.4%
+-commutative79.4%
+-commutative79.4%
Simplified79.4%
Taylor expanded in alpha around inf 42.1%
Taylor expanded in alpha around inf 16.1%
Final simplification45.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 16.5) (/ 0.25 (+ alpha 3.0)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 16.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 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 <= 16.5d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 16.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 16.5: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 16.5) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = 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 <= 16.5)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 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, 16.5], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 16.5:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 16.5Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in beta around 0 67.0%
if 16.5 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around inf 6.9%
Final simplification41.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 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 <= 2.9d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = 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 <= 2.9)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 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, 2.9], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in alpha around 0 65.4%
+-commutative65.4%
Simplified65.4%
Taylor expanded in beta around 0 65.2%
*-commutative65.2%
Simplified65.2%
if 2.89999999999999991 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around inf 6.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 12.0) 0.08333333333333333 (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 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 <= 12.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 12.0: tmp = 0.08333333333333333 else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 12.0) tmp = 0.08333333333333333; else tmp = 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 <= 12.0)
tmp = 0.08333333333333333;
else
tmp = 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, 12.0], 0.08333333333333333, N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 12:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 12Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in alpha around 0 65.4%
+-commutative65.4%
Simplified65.4%
Taylor expanded in beta around 0 65.0%
if 12 < beta Initial program 83.7%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around inf 6.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 92.9%
associate-/l/91.0%
+-commutative91.0%
associate-+l+91.0%
*-commutative91.0%
metadata-eval91.0%
associate-+l+91.0%
metadata-eval91.0%
+-commutative91.0%
+-commutative91.0%
+-commutative91.0%
metadata-eval91.0%
metadata-eval91.0%
associate-+l+91.0%
Simplified91.0%
Taylor expanded in alpha around 0 83.1%
+-commutative83.1%
Simplified83.1%
Taylor expanded in alpha around 0 72.2%
+-commutative72.2%
Simplified72.2%
Taylor expanded in alpha around 0 69.6%
+-commutative69.6%
Simplified69.6%
Taylor expanded in beta around 0 38.8%
herbie shell --seed 2024185
(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)))