
(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 16 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 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 4.5e+143)
(* (+ alpha 1.0) (/ (/ (+ beta 1.0) t_1) (* t_1 t_0)))
(*
(/ (+ alpha 1.0) (- (- alpha) (+ beta 2.0)))
(/ (+ -1.0 (/ (+ alpha 1.0) beta)) t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4.5e+143) {
tmp = (alpha + 1.0) * (((beta + 1.0) / t_1) / (t_1 * t_0));
} else {
tmp = ((alpha + 1.0) / (-alpha - (beta + 2.0))) * ((-1.0 + ((alpha + 1.0) / beta)) / t_0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 4.5d+143) then
tmp = (alpha + 1.0d0) * (((beta + 1.0d0) / t_1) / (t_1 * t_0))
else
tmp = ((alpha + 1.0d0) / (-alpha - (beta + 2.0d0))) * (((-1.0d0) + ((alpha + 1.0d0) / beta)) / t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4.5e+143) {
tmp = (alpha + 1.0) * (((beta + 1.0) / t_1) / (t_1 * t_0));
} else {
tmp = ((alpha + 1.0) / (-alpha - (beta + 2.0))) * ((-1.0 + ((alpha + 1.0) / beta)) / t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 4.5e+143: tmp = (alpha + 1.0) * (((beta + 1.0) / t_1) / (t_1 * t_0)) else: tmp = ((alpha + 1.0) / (-alpha - (beta + 2.0))) * ((-1.0 + ((alpha + 1.0) / beta)) / t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 4.5e+143) tmp = Float64(Float64(alpha + 1.0) * Float64(Float64(Float64(beta + 1.0) / t_1) / Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(-alpha) - Float64(beta + 2.0))) * Float64(Float64(-1.0 + Float64(Float64(alpha + 1.0) / beta)) / t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 4.5e+143)
tmp = (alpha + 1.0) * (((beta + 1.0) / t_1) / (t_1 * t_0));
else
tmp = ((alpha + 1.0) / (-alpha - (beta + 2.0))) * ((-1.0 + ((alpha + 1.0) / beta)) / t_0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.5e+143], N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(N[(beta + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[((-alpha) - N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(-1.0 + N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 4.5 \cdot 10^{+143}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{\frac{\beta + 1}{t_1}}{t_1 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\left(-\alpha\right) - \left(\beta + 2\right)} \cdot \frac{-1 + \frac{\alpha + 1}{\beta}}{t_0}\\
\end{array}
\end{array}
if beta < 4.4999999999999997e143Initial program 98.9%
associate-/l/97.5%
associate-+l+97.5%
+-commutative97.5%
associate-+r+97.5%
associate-+l+97.5%
distribute-rgt1-in97.5%
*-rgt-identity97.5%
distribute-lft-out97.5%
+-commutative97.5%
associate-*l/98.4%
*-commutative98.4%
associate-*r/94.9%
Simplified94.9%
if 4.4999999999999997e143 < beta Initial program 79.9%
associate-/l/77.4%
associate-+l+77.4%
+-commutative77.4%
associate-+r+77.4%
associate-+l+77.4%
distribute-rgt1-in77.4%
*-rgt-identity77.4%
distribute-lft-out77.4%
+-commutative77.4%
associate-*l/83.0%
*-commutative83.0%
associate-*r/83.0%
Simplified83.0%
Taylor expanded in beta around inf 83.0%
associate-*r/83.0%
distribute-lft-in83.0%
metadata-eval83.0%
mul-1-neg83.0%
unsub-neg83.0%
Simplified83.0%
associate-*r/83.0%
frac-2neg83.0%
+-commutative83.0%
Applied egg-rr83.0%
distribute-rgt-neg-in83.0%
distribute-lft-neg-in83.0%
times-frac91.2%
+-commutative91.2%
+-commutative91.2%
distribute-neg-in91.2%
metadata-eval91.2%
sub-neg91.2%
metadata-eval91.2%
distribute-neg-in91.2%
neg-mul-191.2%
associate-*r/91.2%
mul-1-neg91.2%
remove-double-neg91.2%
+-commutative91.2%
Simplified91.2%
Final simplification94.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 25.0)
(*
(+ beta 1.0)
(/
(/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))
(* (+ alpha 2.0) (+ alpha 3.0))))
(*
(/ (+ alpha 1.0) (- (- alpha) (+ beta 2.0)))
(/ (+ -1.0 (/ (+ alpha 1.0) beta)) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 25.0) {
tmp = (beta + 1.0) * (((alpha + 1.0) / (alpha + (beta + 2.0))) / ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((alpha + 1.0) / (-alpha - (beta + 2.0))) * ((-1.0 + ((alpha + 1.0) / 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 <= 25.0d0) then
tmp = (beta + 1.0d0) * (((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) / ((alpha + 2.0d0) * (alpha + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / (-alpha - (beta + 2.0d0))) * (((-1.0d0) + ((alpha + 1.0d0) / 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 <= 25.0) {
tmp = (beta + 1.0) * (((alpha + 1.0) / (alpha + (beta + 2.0))) / ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((alpha + 1.0) / (-alpha - (beta + 2.0))) * ((-1.0 + ((alpha + 1.0) / beta)) / (alpha + (beta + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 25.0: tmp = (beta + 1.0) * (((alpha + 1.0) / (alpha + (beta + 2.0))) / ((alpha + 2.0) * (alpha + 3.0))) else: tmp = ((alpha + 1.0) / (-alpha - (beta + 2.0))) * ((-1.0 + ((alpha + 1.0) / beta)) / (alpha + (beta + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 25.0) tmp = Float64(Float64(beta + 1.0) * Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(-alpha) - Float64(beta + 2.0))) * Float64(Float64(-1.0 + Float64(Float64(alpha + 1.0) / 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 <= 25.0)
tmp = (beta + 1.0) * (((alpha + 1.0) / (alpha + (beta + 2.0))) / ((alpha + 2.0) * (alpha + 3.0)));
else
tmp = ((alpha + 1.0) / (-alpha - (beta + 2.0))) * ((-1.0 + ((alpha + 1.0) / 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, 25.0], N[(N[(beta + 1.0), $MachinePrecision] * N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[((-alpha) - N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(-1.0 + N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 25:\\
\;\;\;\;\left(\beta + 1\right) \cdot \frac{\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\left(-\alpha\right) - \left(\beta + 2\right)} \cdot \frac{-1 + \frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 25Initial program 99.8%
associate-/l/99.3%
associate-+l+99.3%
+-commutative99.3%
associate-+r+99.3%
associate-+l+99.3%
distribute-rgt1-in99.3%
*-rgt-identity99.3%
distribute-lft-out99.3%
+-commutative99.3%
associate-*r/99.3%
associate-*r/99.3%
Simplified99.3%
Taylor expanded in beta around 0 97.9%
if 25 < beta Initial program 87.1%
associate-/l/83.6%
associate-+l+83.6%
+-commutative83.6%
associate-+r+83.6%
associate-+l+83.6%
distribute-rgt1-in83.6%
*-rgt-identity83.6%
distribute-lft-out83.6%
+-commutative83.6%
associate-*l/88.8%
*-commutative88.8%
associate-*r/88.8%
Simplified88.8%
Taylor expanded in beta around inf 79.6%
associate-*r/79.6%
distribute-lft-in79.6%
metadata-eval79.6%
mul-1-neg79.6%
unsub-neg79.6%
Simplified79.6%
associate-*r/74.9%
frac-2neg74.9%
+-commutative74.9%
Applied egg-rr74.9%
distribute-rgt-neg-in74.9%
distribute-lft-neg-in74.9%
times-frac79.2%
+-commutative79.2%
+-commutative79.2%
distribute-neg-in79.2%
metadata-eval79.2%
sub-neg79.2%
metadata-eval79.2%
distribute-neg-in79.2%
neg-mul-179.2%
associate-*r/79.2%
mul-1-neg79.2%
remove-double-neg79.2%
+-commutative79.2%
Simplified79.2%
Final simplification91.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 7.2e+15)
(* (+ alpha 1.0) (/ (/ (+ beta 1.0) t_0) (* (+ beta 3.0) (+ beta 2.0))))
(/ (/ (+ alpha 1.0) t_0) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 7.2e+15) {
tmp = (alpha + 1.0) * (((beta + 1.0) / t_0) / ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / t_0) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 7.2d+15) then
tmp = (alpha + 1.0d0) * (((beta + 1.0d0) / t_0) / ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / t_0) / (alpha + (beta + 3.0d0))
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 <= 7.2e+15) {
tmp = (alpha + 1.0) * (((beta + 1.0) / t_0) / ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / t_0) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 7.2e+15: tmp = (alpha + 1.0) * (((beta + 1.0) / t_0) / ((beta + 3.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / t_0) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 7.2e+15) tmp = Float64(Float64(alpha + 1.0) * Float64(Float64(Float64(beta + 1.0) / t_0) / Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 7.2e+15)
tmp = (alpha + 1.0) * (((beta + 1.0) / t_0) / ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / t_0) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 7.2e+15], N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(N[(beta + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 7.2 \cdot 10^{+15}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{\frac{\beta + 1}{t_0}}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 7.2e15Initial program 99.8%
associate-/l/99.3%
associate-+l+99.3%
+-commutative99.3%
associate-+r+99.3%
associate-+l+99.3%
distribute-rgt1-in99.3%
*-rgt-identity99.3%
distribute-lft-out99.3%
+-commutative99.3%
associate-*l/99.3%
*-commutative99.3%
associate-*r/95.1%
Simplified95.1%
Taylor expanded in alpha around 0 67.1%
if 7.2e15 < beta Initial program 85.8%
associate-/l/81.9%
associate-+l+81.9%
+-commutative81.9%
associate-+r+81.9%
associate-+l+81.9%
distribute-rgt1-in81.9%
*-rgt-identity81.9%
distribute-lft-out81.9%
+-commutative81.9%
associate-*l/87.7%
*-commutative87.7%
associate-*r/87.7%
Simplified87.7%
Taylor expanded in beta around inf 84.6%
expm1-log1p-u84.6%
expm1-udef50.9%
un-div-inv50.9%
+-commutative50.9%
Applied egg-rr50.9%
expm1-def84.6%
expm1-log1p84.6%
associate-/r*85.3%
+-commutative85.3%
+-commutative85.3%
Simplified85.3%
Final simplification72.6%
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 2.4)
(* (+ beta 1.0) (/ 1.0 (* t_0 (+ 6.0 (* beta 5.0)))))
(/ (/ (+ alpha 1.0) t_0) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.4) {
tmp = (beta + 1.0) * (1.0 / (t_0 * (6.0 + (beta * 5.0))));
} else {
tmp = ((alpha + 1.0) / t_0) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2.4d0) then
tmp = (beta + 1.0d0) * (1.0d0 / (t_0 * (6.0d0 + (beta * 5.0d0))))
else
tmp = ((alpha + 1.0d0) / t_0) / (alpha + (beta + 3.0d0))
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 <= 2.4) {
tmp = (beta + 1.0) * (1.0 / (t_0 * (6.0 + (beta * 5.0))));
} else {
tmp = ((alpha + 1.0) / t_0) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2.4: tmp = (beta + 1.0) * (1.0 / (t_0 * (6.0 + (beta * 5.0)))) else: tmp = ((alpha + 1.0) / t_0) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2.4) tmp = Float64(Float64(beta + 1.0) * Float64(1.0 / Float64(t_0 * Float64(6.0 + Float64(beta * 5.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2.4)
tmp = (beta + 1.0) * (1.0 / (t_0 * (6.0 + (beta * 5.0))));
else
tmp = ((alpha + 1.0) / t_0) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.4], N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 / N[(t$95$0 * N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2.4:\\
\;\;\;\;\left(\beta + 1\right) \cdot \frac{1}{t_0 \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.39999999999999991Initial program 99.8%
associate-/l/99.3%
associate-/r*94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
*-commutative94.4%
metadata-eval94.4%
associate-+l+94.4%
+-commutative94.4%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 69.7%
div-inv69.7%
*-commutative69.7%
Applied egg-rr69.7%
Taylor expanded in beta around 0 69.1%
if 2.39999999999999991 < beta Initial program 87.1%
associate-/l/83.6%
associate-+l+83.6%
+-commutative83.6%
associate-+r+83.6%
associate-+l+83.6%
distribute-rgt1-in83.6%
*-rgt-identity83.6%
distribute-lft-out83.6%
+-commutative83.6%
associate-*l/88.8%
*-commutative88.8%
associate-*r/88.8%
Simplified88.8%
Taylor expanded in beta around inf 79.6%
expm1-log1p-u79.6%
expm1-udef48.0%
un-div-inv48.0%
+-commutative48.0%
Applied egg-rr48.0%
expm1-def79.6%
expm1-log1p79.6%
associate-/r*79.1%
+-commutative79.1%
+-commutative79.1%
Simplified79.1%
Final simplification72.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 4100000000000.0)
(/ (+ beta 1.0) (* t_0 (* (+ beta 3.0) (+ beta 2.0))))
(/ (/ (+ alpha 1.0) t_0) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4100000000000.0) {
tmp = (beta + 1.0) / (t_0 * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / t_0) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 4100000000000.0d0) then
tmp = (beta + 1.0d0) / (t_0 * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / t_0) / (alpha + (beta + 3.0d0))
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 <= 4100000000000.0) {
tmp = (beta + 1.0) / (t_0 * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / t_0) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 4100000000000.0: tmp = (beta + 1.0) / (t_0 * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / t_0) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 4100000000000.0) tmp = Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 4100000000000.0)
tmp = (beta + 1.0) / (t_0 * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / t_0) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4100000000000.0], N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 4100000000000:\\
\;\;\;\;\frac{\beta + 1}{t_0 \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.1e12Initial program 99.8%
associate-/l/99.3%
associate-/r*94.6%
associate-+l+94.6%
+-commutative94.6%
associate-+r+94.6%
associate-+l+94.6%
distribute-rgt1-in94.6%
*-rgt-identity94.6%
distribute-lft-out94.6%
*-commutative94.6%
metadata-eval94.6%
associate-+l+94.6%
+-commutative94.6%
Simplified94.6%
Taylor expanded in alpha around 0 80.4%
Taylor expanded in alpha around 0 67.8%
if 4.1e12 < beta Initial program 86.0%
associate-/l/82.1%
associate-+l+82.1%
+-commutative82.1%
associate-+r+82.1%
associate-+l+82.1%
distribute-rgt1-in82.1%
*-rgt-identity82.1%
distribute-lft-out82.1%
+-commutative82.1%
associate-*l/87.8%
*-commutative87.8%
associate-*r/87.8%
Simplified87.8%
Taylor expanded in beta around inf 84.6%
expm1-log1p-u84.6%
expm1-udef50.3%
un-div-inv50.3%
+-commutative50.3%
Applied egg-rr50.3%
expm1-def84.6%
expm1-log1p84.6%
associate-/r*85.3%
+-commutative85.3%
+-commutative85.3%
Simplified85.3%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.0) (/ (+ beta 1.0) (* (+ alpha (+ beta 2.0)) (+ 6.0 (* beta 5.0)))) (/ (/ (- alpha -1.0) beta) (+ 3.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.0) {
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (3.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 <= 5.0d0) then
tmp = (beta + 1.0d0) / ((alpha + (beta + 2.0d0)) * (6.0d0 + (beta * 5.0d0)))
else
tmp = ((alpha - (-1.0d0)) / beta) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.0) {
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.0: tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0))) else: tmp = ((alpha - -1.0) / beta) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.0) 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(3.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 <= 5.0)
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
else
tmp = ((alpha - -1.0) / beta) / (3.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, 5.0], 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[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5:\\
\;\;\;\;\frac{\beta + 1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 5Initial program 99.8%
associate-/l/99.3%
associate-/r*94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
*-commutative94.4%
metadata-eval94.4%
associate-+l+94.4%
+-commutative94.4%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in beta around 0 69.1%
*-commutative69.1%
Simplified69.1%
if 5 < beta Initial program 87.1%
Taylor expanded in beta around -inf 78.6%
associate-*r/78.6%
mul-1-neg78.6%
sub-neg78.6%
mul-1-neg78.6%
distribute-neg-in78.6%
+-commutative78.6%
mul-1-neg78.6%
distribute-lft-in78.6%
metadata-eval78.6%
mul-1-neg78.6%
unsub-neg78.6%
Simplified78.6%
Taylor expanded in alpha around 0 78.6%
associate-+r+78.6%
+-commutative78.6%
associate-+r+78.6%
+-commutative78.6%
Simplified78.6%
Final simplification72.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 2.4)
(/ (+ beta 1.0) (* t_0 (+ 6.0 (* beta 5.0))))
(/ (/ (+ alpha 1.0) t_0) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.4) {
tmp = (beta + 1.0) / (t_0 * (6.0 + (beta * 5.0)));
} else {
tmp = ((alpha + 1.0) / t_0) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2.4d0) then
tmp = (beta + 1.0d0) / (t_0 * (6.0d0 + (beta * 5.0d0)))
else
tmp = ((alpha + 1.0d0) / t_0) / (alpha + (beta + 3.0d0))
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 <= 2.4) {
tmp = (beta + 1.0) / (t_0 * (6.0 + (beta * 5.0)));
} else {
tmp = ((alpha + 1.0) / t_0) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2.4: tmp = (beta + 1.0) / (t_0 * (6.0 + (beta * 5.0))) else: tmp = ((alpha + 1.0) / t_0) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2.4) tmp = Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(6.0 + Float64(beta * 5.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2.4)
tmp = (beta + 1.0) / (t_0 * (6.0 + (beta * 5.0)));
else
tmp = ((alpha + 1.0) / t_0) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.4], N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2.4:\\
\;\;\;\;\frac{\beta + 1}{t_0 \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.39999999999999991Initial program 99.8%
associate-/l/99.3%
associate-/r*94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
*-commutative94.4%
metadata-eval94.4%
associate-+l+94.4%
+-commutative94.4%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in beta around 0 69.1%
*-commutative69.1%
Simplified69.1%
if 2.39999999999999991 < beta Initial program 87.1%
associate-/l/83.6%
associate-+l+83.6%
+-commutative83.6%
associate-+r+83.6%
associate-+l+83.6%
distribute-rgt1-in83.6%
*-rgt-identity83.6%
distribute-lft-out83.6%
+-commutative83.6%
associate-*l/88.8%
*-commutative88.8%
associate-*r/88.8%
Simplified88.8%
Taylor expanded in beta around inf 79.6%
expm1-log1p-u79.6%
expm1-udef48.0%
un-div-inv48.0%
+-commutative48.0%
Applied egg-rr48.0%
expm1-def79.6%
expm1-log1p79.6%
associate-/r*79.1%
+-commutative79.1%
+-commutative79.1%
Simplified79.1%
Final simplification72.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.7) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (- alpha -1.0) beta) (+ 3.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / (3.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.7d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((alpha - (-1.0d0)) / beta) / (3.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / (3.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((alpha - -1.0) / beta) / (3.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.7) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(3.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.7)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = ((alpha - -1.0) / beta) / (3.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.7], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.7:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{3 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial program 99.8%
associate-/l/99.3%
associate-/r*94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
*-commutative94.4%
metadata-eval94.4%
associate-+l+94.4%
+-commutative94.4%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in beta around 0 68.4%
if 2.7000000000000002 < beta Initial program 87.1%
Taylor expanded in beta around -inf 78.6%
associate-*r/78.6%
mul-1-neg78.6%
sub-neg78.6%
mul-1-neg78.6%
distribute-neg-in78.6%
+-commutative78.6%
mul-1-neg78.6%
distribute-lft-in78.6%
metadata-eval78.6%
mul-1-neg78.6%
unsub-neg78.6%
Simplified78.6%
Taylor expanded in alpha around 0 78.6%
associate-+r+78.6%
+-commutative78.6%
associate-+r+78.6%
+-commutative78.6%
Simplified78.6%
Final simplification71.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (- alpha -1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha - -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 <= 3.0d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((alpha - (-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 <= 3.0) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((alpha - -1.0) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = ((alpha - -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, 3.0], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $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 3:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 3Initial program 99.8%
associate-/l/99.3%
associate-/r*94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
*-commutative94.4%
metadata-eval94.4%
associate-+l+94.4%
+-commutative94.4%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in beta around 0 68.4%
if 3 < beta Initial program 87.1%
Taylor expanded in beta around -inf 78.6%
associate-*r/78.6%
mul-1-neg78.6%
sub-neg78.6%
mul-1-neg78.6%
distribute-neg-in78.6%
+-commutative78.6%
mul-1-neg78.6%
distribute-lft-in78.6%
metadata-eval78.6%
mul-1-neg78.6%
unsub-neg78.6%
Simplified78.6%
Taylor expanded in alpha around 0 78.4%
Final simplification71.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.2) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.2d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.2], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.8%
associate-/l/99.3%
associate-/r*94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
*-commutative94.4%
metadata-eval94.4%
associate-+l+94.4%
+-commutative94.4%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in beta around 0 68.4%
if 2.2000000000000002 < beta Initial program 87.1%
Taylor expanded in beta around -inf 78.6%
associate-*r/78.6%
mul-1-neg78.6%
sub-neg78.6%
mul-1-neg78.6%
distribute-neg-in78.6%
+-commutative78.6%
mul-1-neg78.6%
distribute-lft-in78.6%
metadata-eval78.6%
mul-1-neg78.6%
unsub-neg78.6%
Simplified78.6%
Taylor expanded in alpha around 0 68.1%
Final simplification68.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.8) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (+ alpha 1.0) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (alpha + 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 <= 3.8d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = (alpha + 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 <= 3.8) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (alpha + 1.0) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.8: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = (alpha + 1.0) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.8) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(alpha + 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 <= 3.8)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = (alpha + 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, 3.8], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.8:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.7999999999999998Initial program 99.8%
associate-/l/99.3%
associate-/r*94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
*-commutative94.4%
metadata-eval94.4%
associate-+l+94.4%
+-commutative94.4%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in beta around 0 68.4%
if 3.7999999999999998 < beta Initial program 87.1%
associate-/l/83.6%
associate-+l+83.6%
+-commutative83.6%
associate-+r+83.6%
associate-+l+83.6%
distribute-rgt1-in83.6%
*-rgt-identity83.6%
distribute-lft-out83.6%
+-commutative83.6%
associate-*l/88.8%
*-commutative88.8%
associate-*r/88.8%
Simplified88.8%
Taylor expanded in beta around inf 74.6%
unpow274.6%
Simplified74.6%
Final simplification70.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (- alpha -1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha - -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.2d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((alpha - (-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.2) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((alpha - -1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.2) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / 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.16666666666666666 / (alpha + 2.0);
else
tmp = ((alpha - -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.2], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.8%
associate-/l/99.3%
associate-/r*94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
*-commutative94.4%
metadata-eval94.4%
associate-+l+94.4%
+-commutative94.4%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in beta around 0 68.4%
if 4.20000000000000018 < beta Initial program 87.1%
Taylor expanded in beta around -inf 78.6%
associate-*r/78.6%
mul-1-neg78.6%
sub-neg78.6%
mul-1-neg78.6%
distribute-neg-in78.6%
+-commutative78.6%
mul-1-neg78.6%
distribute-lft-in78.6%
metadata-eval78.6%
mul-1-neg78.6%
unsub-neg78.6%
Simplified78.6%
Taylor expanded in beta around inf 78.3%
Final simplification71.7%
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))))
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);
}
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)
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);
}
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) 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(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 <= 3.6)
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, 3.6], 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 3.6:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.8%
associate-/l/99.3%
associate-/r*94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
*-commutative94.4%
metadata-eval94.4%
associate-+l+94.4%
+-commutative94.4%
Simplified94.4%
Taylor expanded in alpha around 0 82.3%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in beta around 0 68.4%
if 3.60000000000000009 < beta Initial program 87.1%
associate-/l/83.6%
associate-/r*71.5%
associate-+l+71.5%
+-commutative71.5%
associate-+r+71.5%
associate-+l+71.5%
distribute-rgt1-in71.5%
*-rgt-identity71.5%
distribute-lft-out71.4%
*-commutative71.4%
metadata-eval71.4%
associate-+l+71.4%
+-commutative71.4%
Simplified71.4%
Taylor expanded in alpha around 0 66.8%
Taylor expanded in alpha around 0 64.7%
Taylor expanded in beta around inf 68.1%
unpow268.1%
Simplified68.1%
Final simplification68.3%
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 95.6%
associate-/l/94.1%
associate-/r*86.8%
associate-+l+86.8%
+-commutative86.8%
associate-+r+86.8%
associate-+l+86.8%
distribute-rgt1-in86.8%
*-rgt-identity86.8%
distribute-lft-out86.8%
*-commutative86.8%
metadata-eval86.8%
associate-+l+86.8%
+-commutative86.8%
Simplified86.8%
Taylor expanded in alpha around 0 77.1%
Taylor expanded in alpha around 0 68.0%
Taylor expanded in beta around 0 47.4%
Final simplification47.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ -1.0 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return -1.0 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = (-1.0d0) / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return -1.0 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return -1.0 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(-1.0 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = -1.0 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(-1.0 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{-1}{\beta}
\end{array}
Initial program 95.6%
associate-/l/94.1%
associate-+l+94.1%
+-commutative94.1%
associate-+r+94.1%
associate-+l+94.1%
distribute-rgt1-in94.1%
*-rgt-identity94.1%
distribute-lft-out94.1%
+-commutative94.1%
associate-*l/95.8%
*-commutative95.8%
associate-*r/92.8%
Simplified92.8%
Taylor expanded in beta around inf 30.9%
associate-*r/30.9%
distribute-lft-in30.9%
metadata-eval30.9%
mul-1-neg30.9%
unsub-neg30.9%
Simplified30.9%
Taylor expanded in alpha around inf 3.6%
Final simplification3.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.3333333333333333d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\beta}
\end{array}
Initial program 95.6%
Taylor expanded in beta around -inf 27.9%
associate-*r/27.9%
mul-1-neg27.9%
sub-neg27.9%
mul-1-neg27.9%
distribute-neg-in27.9%
+-commutative27.9%
mul-1-neg27.9%
distribute-lft-in27.9%
metadata-eval27.9%
mul-1-neg27.9%
unsub-neg27.9%
Simplified27.9%
Taylor expanded in alpha around 0 24.4%
associate-/r*24.4%
Simplified24.4%
Taylor expanded in beta around 0 4.1%
Final simplification4.1%
herbie shell --seed 2023240
(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)))