
(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 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1e+17)
(/ (+ 1.0 alpha) (/ (* (* t_0 t_0) (+ beta (+ alpha 3.0))) (+ beta 1.0)))
(/ (/ (- alpha -1.0) beta) (+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+17) {
tmp = (1.0 + alpha) / (((t_0 * t_0) * (beta + (alpha + 3.0))) / (beta + 1.0));
} else {
tmp = ((alpha - -1.0) / 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 = alpha + (beta + 2.0d0)
if (beta <= 1d+17) then
tmp = (1.0d0 + alpha) / (((t_0 * t_0) * (beta + (alpha + 3.0d0))) / (beta + 1.0d0))
else
tmp = ((alpha - (-1.0d0)) / 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 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+17) {
tmp = (1.0 + alpha) / (((t_0 * t_0) * (beta + (alpha + 3.0))) / (beta + 1.0));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1e+17: tmp = (1.0 + alpha) / (((t_0 * t_0) * (beta + (alpha + 3.0))) / (beta + 1.0)) else: tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1e+17) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(t_0 * t_0) * Float64(beta + Float64(alpha + 3.0))) / Float64(beta + 1.0))); else tmp = Float64(Float64(Float64(alpha - -1.0) / 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 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1e+17)
tmp = (1.0 + alpha) / (((t_0 * t_0) * (beta + (alpha + 3.0))) / (beta + 1.0));
else
tmp = ((alpha - -1.0) / 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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+17], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(t$95$0 * t$95$0), $MachinePrecision] * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $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 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 10^{+17}:\\
\;\;\;\;\frac{1 + \alpha}{\frac{\left(t_0 \cdot t_0\right) \cdot \left(\beta + \left(\alpha + 3\right)\right)}{\beta + 1}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1e17Initial program 99.9%
associate-/l/99.9%
associate-/r*97.2%
+-commutative97.2%
associate-+r+97.2%
+-commutative97.2%
associate-+r+97.2%
associate-+r+97.2%
distribute-rgt1-in97.2%
+-commutative97.2%
*-commutative97.2%
distribute-rgt1-in97.2%
+-commutative97.2%
times-frac99.9%
Simplified99.9%
frac-times97.2%
associate-/l*97.2%
+-commutative97.2%
associate-*r*97.2%
Applied egg-rr97.2%
if 1e17 < beta Initial program 79.0%
Taylor expanded in beta around -inf 88.7%
associate-*r/88.7%
mul-1-neg88.7%
sub-neg88.7%
mul-1-neg88.7%
distribute-neg-in88.7%
+-commutative88.7%
mul-1-neg88.7%
distribute-lft-in88.7%
metadata-eval88.7%
mul-1-neg88.7%
unsub-neg88.7%
Simplified88.7%
Final simplification94.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1.3e+17)
(* (/ (+ 1.0 alpha) t_0) (/ (+ beta 1.0) (* t_0 (+ beta (+ alpha 3.0)))))
(/ (/ (- alpha -1.0) beta) (+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.3e+17) {
tmp = ((1.0 + alpha) / t_0) * ((beta + 1.0) / (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = ((alpha - -1.0) / 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 = alpha + (beta + 2.0d0)
if (beta <= 1.3d+17) then
tmp = ((1.0d0 + alpha) / t_0) * ((beta + 1.0d0) / (t_0 * (beta + (alpha + 3.0d0))))
else
tmp = ((alpha - (-1.0d0)) / 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 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.3e+17) {
tmp = ((1.0 + alpha) / t_0) * ((beta + 1.0) / (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.3e+17: tmp = ((1.0 + alpha) / t_0) * ((beta + 1.0) / (t_0 * (beta + (alpha + 3.0)))) else: tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.3e+17) tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(beta + Float64(alpha + 3.0))))); else tmp = Float64(Float64(Float64(alpha - -1.0) / 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 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.3e+17)
tmp = ((1.0 + alpha) / t_0) * ((beta + 1.0) / (t_0 * (beta + (alpha + 3.0))));
else
tmp = ((alpha - -1.0) / 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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.3e+17], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $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 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+17}:\\
\;\;\;\;\frac{1 + \alpha}{t_0} \cdot \frac{\beta + 1}{t_0 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1.3e17Initial program 99.9%
associate-/l/99.9%
associate-/r*97.2%
+-commutative97.2%
associate-+r+97.2%
+-commutative97.2%
associate-+r+97.2%
associate-+r+97.2%
distribute-rgt1-in97.2%
+-commutative97.2%
*-commutative97.2%
distribute-rgt1-in97.2%
+-commutative97.2%
times-frac99.9%
Simplified99.9%
if 1.3e17 < beta Initial program 79.0%
Taylor expanded in beta around -inf 88.7%
associate-*r/88.7%
mul-1-neg88.7%
sub-neg88.7%
mul-1-neg88.7%
distribute-neg-in88.7%
+-commutative88.7%
mul-1-neg88.7%
distribute-lft-in88.7%
metadata-eval88.7%
mul-1-neg88.7%
unsub-neg88.7%
Simplified88.7%
Final simplification96.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1.35e+17)
(/ (* (+ 1.0 alpha) (+ beta 1.0)) (* t_0 (* t_0 (+ beta (+ alpha 3.0)))))
(/ (/ (- alpha -1.0) beta) (+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.35e+17) {
tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = ((alpha - -1.0) / 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 = alpha + (beta + 2.0d0)
if (beta <= 1.35d+17) then
tmp = ((1.0d0 + alpha) * (beta + 1.0d0)) / (t_0 * (t_0 * (beta + (alpha + 3.0d0))))
else
tmp = ((alpha - (-1.0d0)) / 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 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.35e+17) {
tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.35e+17: tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * (t_0 * (beta + (alpha + 3.0)))) else: tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.35e+17) tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(beta + 1.0)) / Float64(t_0 * Float64(t_0 * Float64(beta + Float64(alpha + 3.0))))); else tmp = Float64(Float64(Float64(alpha - -1.0) / 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 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.35e+17)
tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * (t_0 * (beta + (alpha + 3.0))));
else
tmp = ((alpha - -1.0) / 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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.35e+17], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $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 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.35 \cdot 10^{+17}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \left(\beta + 1\right)}{t_0 \cdot \left(t_0 \cdot \left(\beta + \left(\alpha + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1.35e17Initial program 99.9%
associate-/l/99.9%
associate-/r*97.2%
+-commutative97.2%
associate-+r+97.2%
+-commutative97.2%
associate-+r+97.2%
associate-+r+97.2%
distribute-rgt1-in97.2%
+-commutative97.2%
*-commutative97.2%
distribute-rgt1-in97.2%
+-commutative97.2%
metadata-eval97.2%
associate-+l+97.2%
*-commutative97.2%
metadata-eval97.2%
Simplified97.2%
if 1.35e17 < beta Initial program 79.0%
Taylor expanded in beta around -inf 88.7%
associate-*r/88.7%
mul-1-neg88.7%
sub-neg88.7%
mul-1-neg88.7%
distribute-neg-in88.7%
+-commutative88.7%
mul-1-neg88.7%
distribute-lft-in88.7%
metadata-eval88.7%
mul-1-neg88.7%
unsub-neg88.7%
Simplified88.7%
Final simplification94.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 98.0)
(*
(/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
(/ (/ 1.0 (+ alpha 2.0)) (+ alpha 3.0)))
(/ (/ (- alpha -1.0) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 98.0) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 / (alpha + 2.0)) / (alpha + 3.0));
} else {
tmp = ((alpha - -1.0) / 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 <= 98.0d0) then
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * ((1.0d0 / (alpha + 2.0d0)) / (alpha + 3.0d0))
else
tmp = ((alpha - (-1.0d0)) / 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 <= 98.0) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 / (alpha + 2.0)) / (alpha + 3.0));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 98.0: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 / (alpha + 2.0)) / (alpha + 3.0)) else: tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 98.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(1.0 / Float64(alpha + 2.0)) / Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(alpha - -1.0) / 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 <= 98.0)
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 / (alpha + 2.0)) / (alpha + 3.0));
else
tmp = ((alpha - -1.0) / 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, 98.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $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 98:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{\frac{1}{\alpha + 2}}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 98Initial program 99.9%
associate-/l/99.9%
associate-/r*97.1%
+-commutative97.1%
associate-+r+97.1%
+-commutative97.1%
associate-+r+97.1%
associate-+r+97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
*-commutative97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
times-frac99.9%
Simplified99.9%
Taylor expanded in beta around 0 97.5%
associate-/r*97.6%
+-commutative97.6%
Simplified97.6%
if 98 < beta Initial program 79.7%
Taylor expanded in beta around -inf 87.4%
associate-*r/87.4%
mul-1-neg87.4%
sub-neg87.4%
mul-1-neg87.4%
distribute-neg-in87.4%
+-commutative87.4%
mul-1-neg87.4%
distribute-lft-in87.4%
metadata-eval87.4%
mul-1-neg87.4%
unsub-neg87.4%
Simplified87.4%
Final simplification94.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.2e+16) (/ (+ beta 1.0) (* (+ alpha (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (- alpha -1.0) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2e+16) {
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((alpha - -1.0) / 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 <= 1.2d+16) then
tmp = (beta + 1.0d0) / ((alpha + (beta + 2.0d0)) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((alpha - (-1.0d0)) / 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 <= 1.2e+16) {
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2e+16: tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2e+16) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / 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 <= 1.2e+16)
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((alpha - -1.0) / 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, 1.2e+16], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $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 1.2 \cdot 10^{+16}:\\
\;\;\;\;\frac{\beta + 1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1.2e16Initial program 99.9%
associate-/l/99.9%
associate-/r*97.2%
+-commutative97.2%
associate-+r+97.2%
+-commutative97.2%
associate-+r+97.2%
associate-+r+97.2%
distribute-rgt1-in97.2%
+-commutative97.2%
*-commutative97.2%
distribute-rgt1-in97.2%
+-commutative97.2%
metadata-eval97.2%
associate-+l+97.2%
*-commutative97.2%
metadata-eval97.2%
Simplified97.2%
Taylor expanded in alpha around 0 85.1%
Taylor expanded in alpha around 0 69.4%
if 1.2e16 < beta Initial program 79.0%
Taylor expanded in beta around -inf 88.7%
associate-*r/88.7%
mul-1-neg88.7%
sub-neg88.7%
mul-1-neg88.7%
distribute-neg-in88.7%
+-commutative88.7%
mul-1-neg88.7%
distribute-lft-in88.7%
metadata-eval88.7%
mul-1-neg88.7%
unsub-neg88.7%
Simplified88.7%
Final simplification75.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 5.5)
(/ (+ beta 1.0) (* t_0 (+ 6.0 (* beta 5.0))))
(* (/ (+ 1.0 alpha) t_0) (/ 1.0 beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5.5) {
tmp = (beta + 1.0) / (t_0 * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / t_0) * (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 5.5d0) then
tmp = (beta + 1.0d0) / (t_0 * (6.0d0 + (beta * 5.0d0)))
else
tmp = ((1.0d0 + alpha) / t_0) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5.5) {
tmp = (beta + 1.0) / (t_0 * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / t_0) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 5.5: tmp = (beta + 1.0) / (t_0 * (6.0 + (beta * 5.0))) else: tmp = ((1.0 + alpha) / t_0) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5.5) tmp = Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(6.0 + Float64(beta * 5.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 5.5)
tmp = (beta + 1.0) / (t_0 * (6.0 + (beta * 5.0)));
else
tmp = ((1.0 + alpha) / t_0) * (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.5], N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 5.5:\\
\;\;\;\;\frac{\beta + 1}{t_0 \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t_0} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 5.5Initial program 99.9%
associate-/l/99.9%
associate-/r*97.1%
+-commutative97.1%
associate-+r+97.1%
+-commutative97.1%
associate-+r+97.1%
associate-+r+97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
*-commutative97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
metadata-eval97.1%
associate-+l+97.1%
*-commutative97.1%
metadata-eval97.1%
Simplified97.1%
Taylor expanded in alpha around 0 84.9%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in beta around 0 68.0%
*-commutative68.0%
Simplified68.0%
if 5.5 < beta Initial program 79.7%
associate-/l/78.3%
associate-/r*60.3%
+-commutative60.3%
associate-+r+60.3%
+-commutative60.3%
associate-+r+60.3%
associate-+r+60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
*-commutative60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
times-frac91.8%
Simplified91.8%
Taylor expanded in beta around inf 87.2%
Final simplification74.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.9) (/ (+ beta 1.0) (* (+ alpha (+ beta 2.0)) (+ 6.0 (* beta 5.0)))) (/ (/ (- alpha -1.0) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.9) {
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
} else {
tmp = ((alpha - -1.0) / 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.9d0) then
tmp = (beta + 1.0d0) / ((alpha + (beta + 2.0d0)) * (6.0d0 + (beta * 5.0d0)))
else
tmp = ((alpha - (-1.0d0)) / 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.9) {
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.9: tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0))) else: tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.9) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(6.0 + Float64(beta * 5.0)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / 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.9)
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
else
tmp = ((alpha - -1.0) / 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.9], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $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.9:\\
\;\;\;\;\frac{\beta + 1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4.9000000000000004Initial program 99.9%
associate-/l/99.9%
associate-/r*97.1%
+-commutative97.1%
associate-+r+97.1%
+-commutative97.1%
associate-+r+97.1%
associate-+r+97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
*-commutative97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
metadata-eval97.1%
associate-+l+97.1%
*-commutative97.1%
metadata-eval97.1%
Simplified97.1%
Taylor expanded in alpha around 0 84.9%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in beta around 0 68.0%
*-commutative68.0%
Simplified68.0%
if 4.9000000000000004 < beta Initial program 79.7%
Taylor expanded in beta around -inf 87.4%
associate-*r/87.4%
mul-1-neg87.4%
sub-neg87.4%
mul-1-neg87.4%
distribute-neg-in87.4%
+-commutative87.4%
mul-1-neg87.4%
distribute-lft-in87.4%
metadata-eval87.4%
mul-1-neg87.4%
unsub-neg87.4%
Simplified87.4%
Final simplification74.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.1) (/ 0.16666666666666666 (+ alpha 2.0)) (* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (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 <= 3.1d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.1: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.1) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * 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 <= 3.1)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (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, 3.1], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.1:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 3.10000000000000009Initial program 99.9%
associate-/l/99.9%
associate-/r*97.1%
+-commutative97.1%
associate-+r+97.1%
+-commutative97.1%
associate-+r+97.1%
associate-+r+97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
*-commutative97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
metadata-eval97.1%
associate-+l+97.1%
*-commutative97.1%
metadata-eval97.1%
Simplified97.1%
Taylor expanded in alpha around 0 84.9%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in beta around 0 67.0%
if 3.10000000000000009 < beta Initial program 79.7%
associate-/l/78.3%
associate-/r*60.3%
+-commutative60.3%
associate-+r+60.3%
+-commutative60.3%
associate-+r+60.3%
associate-+r+60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
*-commutative60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
times-frac91.8%
Simplified91.8%
Taylor expanded in beta around inf 87.2%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6) (/ 0.16666666666666666 (+ alpha 2.0)) (+ (/ 1.0 (* beta beta)) (/ alpha (* beta beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / (beta * beta)) + (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.6d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = (1.0d0 / (beta * beta)) + (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.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / (beta * beta)) + (alpha / (beta * beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = (1.0 / (beta * beta)) + (alpha / (beta * beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(1.0 / Float64(beta * beta)) + 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.6)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = (1.0 / (beta * beta)) + (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.6], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision] + N[(alpha / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta} + \frac{\alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.9%
associate-/l/99.9%
associate-/r*97.1%
+-commutative97.1%
associate-+r+97.1%
+-commutative97.1%
associate-+r+97.1%
associate-+r+97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
*-commutative97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
metadata-eval97.1%
associate-+l+97.1%
*-commutative97.1%
metadata-eval97.1%
Simplified97.1%
Taylor expanded in alpha around 0 84.9%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in beta around 0 67.0%
if 3.60000000000000009 < beta Initial program 79.7%
associate-/l/78.3%
associate-/r*60.3%
+-commutative60.3%
associate-+r+60.3%
+-commutative60.3%
associate-+r+60.3%
associate-+r+60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
*-commutative60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
times-frac91.8%
Simplified91.8%
Taylor expanded in beta around inf 84.7%
unpow284.7%
Simplified84.7%
Taylor expanded in alpha around 0 84.7%
unpow284.7%
unpow284.7%
Simplified84.7%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.15) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (- alpha -1.0) (* (+ beta 2.0) (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (alpha - -1.0) / ((beta + 2.0) * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.15d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = (alpha - (-1.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (alpha - -1.0) / ((beta + 2.0) * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.15: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = (alpha - -1.0) / ((beta + 2.0) * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.15) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(alpha - -1.0) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.15)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = (alpha - -1.0) / ((beta + 2.0) * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.15], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.15:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha - -1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.1499999999999999Initial program 99.9%
associate-/l/99.9%
associate-/r*97.1%
+-commutative97.1%
associate-+r+97.1%
+-commutative97.1%
associate-+r+97.1%
associate-+r+97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
*-commutative97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
metadata-eval97.1%
associate-+l+97.1%
*-commutative97.1%
metadata-eval97.1%
Simplified97.1%
Taylor expanded in alpha around 0 84.9%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in beta around 0 67.0%
if 1.1499999999999999 < beta Initial program 79.7%
associate-/l/78.3%
associate-+l+78.3%
+-commutative78.3%
*-commutative78.3%
associate-+l+78.3%
+-commutative78.3%
+-commutative78.3%
+-commutative78.3%
Simplified78.3%
Taylor expanded in beta around -inf 88.2%
mul-1-neg88.2%
sub-neg88.2%
mul-1-neg88.2%
distribute-neg-in88.2%
+-commutative88.2%
mul-1-neg88.2%
distribute-lft-in88.2%
metadata-eval88.2%
mul-1-neg88.2%
unsub-neg88.2%
Simplified88.2%
Taylor expanded in alpha around 0 84.9%
+-commutative84.9%
Simplified84.9%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.3) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.3) {
tmp = 0.16666666666666666 / (alpha + 2.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.3d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.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.3) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.3: tmp = 0.16666666666666666 / (alpha + 2.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.3) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.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.3)
tmp = 0.16666666666666666 / (alpha + 2.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.3], N[(0.16666666666666666 / N[(alpha + 2.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.3:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 4.29999999999999982Initial program 99.9%
associate-/l/99.9%
associate-/r*97.1%
+-commutative97.1%
associate-+r+97.1%
+-commutative97.1%
associate-+r+97.1%
associate-+r+97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
*-commutative97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
metadata-eval97.1%
associate-+l+97.1%
*-commutative97.1%
metadata-eval97.1%
Simplified97.1%
Taylor expanded in alpha around 0 84.9%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in beta around 0 67.0%
if 4.29999999999999982 < beta Initial program 79.7%
associate-/l/78.3%
associate-/r*60.3%
+-commutative60.3%
associate-+r+60.3%
+-commutative60.3%
associate-+r+60.3%
associate-+r+60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
*-commutative60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
times-frac91.8%
Simplified91.8%
Taylor expanded in beta around inf 84.7%
unpow284.7%
Simplified84.7%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 7.5) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* alpha alpha))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.5) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (alpha * 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 (alpha <= 7.5d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = 1.0d0 / (alpha * alpha)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.5) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (alpha * alpha);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 7.5: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = 1.0 / (alpha * alpha) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 7.5) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(1.0 / Float64(alpha * alpha)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (alpha <= 7.5)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = 1.0 / (alpha * 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[alpha, 7.5], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(alpha * alpha), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 7.5:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\alpha \cdot \alpha}\\
\end{array}
\end{array}
if alpha < 7.5Initial program 99.9%
associate-/l/99.3%
associate-/r*92.8%
+-commutative92.8%
associate-+r+92.8%
+-commutative92.8%
associate-+r+92.8%
associate-+r+92.8%
distribute-rgt1-in92.8%
+-commutative92.8%
*-commutative92.8%
distribute-rgt1-in92.8%
+-commutative92.8%
metadata-eval92.8%
associate-+l+92.8%
*-commutative92.8%
metadata-eval92.8%
Simplified92.8%
Taylor expanded in alpha around 0 91.5%
Taylor expanded in alpha around 0 91.6%
Taylor expanded in beta around 0 65.0%
if 7.5 < alpha Initial program 79.0%
associate-/l/78.7%
associate-+l+78.7%
+-commutative78.7%
*-commutative78.7%
associate-+l+78.7%
+-commutative78.7%
+-commutative78.7%
+-commutative78.7%
Simplified78.7%
Taylor expanded in beta around -inf 63.4%
mul-1-neg63.4%
sub-neg63.4%
mul-1-neg63.4%
distribute-neg-in63.4%
+-commutative63.4%
mul-1-neg63.4%
distribute-lft-in63.4%
metadata-eval63.4%
mul-1-neg63.4%
unsub-neg63.4%
Simplified63.4%
Taylor expanded in alpha around inf 49.0%
unpow249.0%
Simplified49.0%
Taylor expanded in alpha around 0 74.7%
unpow274.7%
Simplified74.7%
Final simplification68.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.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 <= 4.0d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(1.0 / 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.0)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = 1.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, 4.0], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.9%
associate-/r*97.1%
+-commutative97.1%
associate-+r+97.1%
+-commutative97.1%
associate-+r+97.1%
associate-+r+97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
*-commutative97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
metadata-eval97.1%
associate-+l+97.1%
*-commutative97.1%
metadata-eval97.1%
Simplified97.1%
Taylor expanded in alpha around 0 84.9%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in beta around 0 67.0%
if 4 < beta Initial program 79.7%
associate-/l/78.3%
associate-/r*60.3%
+-commutative60.3%
associate-+r+60.3%
+-commutative60.3%
associate-+r+60.3%
associate-+r+60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
*-commutative60.3%
distribute-rgt1-in60.3%
+-commutative60.3%
times-frac91.8%
Simplified91.8%
Taylor expanded in beta around inf 84.7%
unpow284.7%
Simplified84.7%
Taylor expanded in alpha around 0 77.5%
unpow277.5%
Simplified77.5%
Final simplification70.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ alpha 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (alpha + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (alpha + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(alpha + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (alpha + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\alpha + 2}
\end{array}
Initial program 93.0%
associate-/l/92.4%
associate-/r*84.5%
+-commutative84.5%
associate-+r+84.5%
+-commutative84.5%
associate-+r+84.5%
associate-+r+84.5%
distribute-rgt1-in84.5%
+-commutative84.5%
*-commutative84.5%
distribute-rgt1-in84.5%
+-commutative84.5%
metadata-eval84.5%
associate-+l+84.5%
*-commutative84.5%
metadata-eval84.5%
Simplified84.5%
Taylor expanded in alpha around 0 79.7%
Taylor expanded in alpha around 0 68.8%
Taylor expanded in beta around 0 45.8%
Final simplification45.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.16666666666666666)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.16666666666666666 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.16666666666666666
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.16666666666666666
\end{array}
Initial program 93.0%
associate-/l/92.4%
associate-+l+92.4%
+-commutative92.4%
*-commutative92.4%
associate-+l+92.4%
+-commutative92.4%
+-commutative92.4%
+-commutative92.4%
Simplified92.4%
Taylor expanded in beta around -inf 50.7%
mul-1-neg50.7%
sub-neg50.7%
mul-1-neg50.7%
distribute-neg-in50.7%
+-commutative50.7%
mul-1-neg50.7%
distribute-lft-in50.7%
metadata-eval50.7%
mul-1-neg50.7%
unsub-neg50.7%
Simplified50.7%
Taylor expanded in beta around 0 25.6%
+-commutative25.6%
Simplified25.6%
Taylor expanded in alpha around 0 10.7%
Final simplification10.7%
herbie shell --seed 2023287
(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)))