
(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 (+ 2.0 (+ beta alpha)))
(t_2 (+ alpha (+ beta 2.0))))
(if (<= beta 8e+15)
(* (/ (+ 1.0 alpha) t_2) (/ (+ 1.0 beta) (* t_2 t_0)))
(* (/ beta t_1) (/ (/ (+ 1.0 alpha) t_0) t_1)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = 2.0 + (beta + alpha);
double t_2 = alpha + (beta + 2.0);
double tmp;
if (beta <= 8e+15) {
tmp = ((1.0 + alpha) / t_2) * ((1.0 + beta) / (t_2 * t_0));
} else {
tmp = (beta / t_1) * (((1.0 + alpha) / t_0) / t_1);
}
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) :: t_2
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = 2.0d0 + (beta + alpha)
t_2 = alpha + (beta + 2.0d0)
if (beta <= 8d+15) then
tmp = ((1.0d0 + alpha) / t_2) * ((1.0d0 + beta) / (t_2 * t_0))
else
tmp = (beta / t_1) * (((1.0d0 + alpha) / t_0) / t_1)
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 = 2.0 + (beta + alpha);
double t_2 = alpha + (beta + 2.0);
double tmp;
if (beta <= 8e+15) {
tmp = ((1.0 + alpha) / t_2) * ((1.0 + beta) / (t_2 * t_0));
} else {
tmp = (beta / t_1) * (((1.0 + alpha) / t_0) / t_1);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = 2.0 + (beta + alpha) t_2 = alpha + (beta + 2.0) tmp = 0 if beta <= 8e+15: tmp = ((1.0 + alpha) / t_2) * ((1.0 + beta) / (t_2 * t_0)) else: tmp = (beta / t_1) * (((1.0 + alpha) / t_0) / t_1) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(2.0 + Float64(beta + alpha)) t_2 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 8e+15) tmp = Float64(Float64(Float64(1.0 + alpha) / t_2) * Float64(Float64(1.0 + beta) / Float64(t_2 * t_0))); else tmp = Float64(Float64(beta / t_1) * Float64(Float64(Float64(1.0 + alpha) / t_0) / t_1)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = 2.0 + (beta + alpha);
t_2 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 8e+15)
tmp = ((1.0 + alpha) / t_2) * ((1.0 + beta) / (t_2 * t_0));
else
tmp = (beta / t_1) * (((1.0 + alpha) / t_0) / t_1);
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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 8e+15], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$2), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$2 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(beta / t$95$1), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := 2 + \left(\beta + \alpha\right)\\
t_2 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 8 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \alpha}{t_2} \cdot \frac{1 + \beta}{t_2 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta}{t_1} \cdot \frac{\frac{1 + \alpha}{t_0}}{t_1}\\
\end{array}
\end{array}
if beta < 8e15Initial program 99.9%
Simplified99.7%
if 8e15 < beta Initial program 81.3%
Simplified61.8%
Taylor expanded in beta around inf 61.8%
times-frac90.0%
associate-+r+90.0%
+-commutative90.0%
+-commutative90.0%
*-commutative90.0%
+-commutative90.0%
associate-+r+90.0%
associate-+r+90.0%
+-commutative90.0%
+-commutative90.0%
Applied egg-rr90.0%
+-commutative90.0%
associate-/r*99.8%
associate-+l+99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 60000000000000.0)
(/ (/ (+ 1.0 (+ beta alpha)) t_1) (* t_1 (+ 3.0 (+ beta alpha))))
(* (/ beta t_0) (/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 60000000000000.0) {
tmp = ((1.0 + (beta + alpha)) / t_1) / (t_1 * (3.0 + (beta + alpha)));
} else {
tmp = (beta / t_0) * (((1.0 + alpha) / (alpha + (beta + 3.0))) / 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 = 2.0d0 + (beta + alpha)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 60000000000000.0d0) then
tmp = ((1.0d0 + (beta + alpha)) / t_1) / (t_1 * (3.0d0 + (beta + alpha)))
else
tmp = (beta / t_0) * (((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 60000000000000.0) {
tmp = ((1.0 + (beta + alpha)) / t_1) / (t_1 * (3.0 + (beta + alpha)));
} else {
tmp = (beta / t_0) * (((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 60000000000000.0: tmp = ((1.0 + (beta + alpha)) / t_1) / (t_1 * (3.0 + (beta + alpha))) else: tmp = (beta / t_0) * (((1.0 + alpha) / (alpha + (beta + 3.0))) / t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 60000000000000.0) tmp = Float64(Float64(Float64(1.0 + Float64(beta + alpha)) / t_1) / Float64(t_1 * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(beta / t_0) * Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 60000000000000.0)
tmp = ((1.0 + (beta + alpha)) / t_1) / (t_1 * (3.0 + (beta + alpha)));
else
tmp = (beta / t_0) * (((1.0 + alpha) / (alpha + (beta + 3.0))) / 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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 60000000000000.0], N[(N[(N[(1.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(beta / t$95$0), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 60000000000000:\\
\;\;\;\;\frac{\frac{1 + \left(\beta + \alpha\right)}{t_1}}{t_1 \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\beta}{t_0} \cdot \frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{t_0}\\
\end{array}
\end{array}
if beta < 6e13Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 99.5%
if 6e13 < beta Initial program 81.6%
Simplified62.4%
Taylor expanded in beta around inf 62.3%
times-frac90.1%
associate-+r+90.1%
+-commutative90.1%
+-commutative90.1%
*-commutative90.1%
+-commutative90.1%
associate-+r+90.1%
associate-+r+90.1%
+-commutative90.1%
+-commutative90.1%
Applied egg-rr90.1%
+-commutative90.1%
associate-/r*99.7%
associate-+l+99.7%
+-commutative99.7%
Simplified99.7%
Final simplification99.5%
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)))) (* (/ (/ (+ 1.0 beta) t_0) (+ 3.0 (+ beta alpha))) (/ (+ 1.0 alpha) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (3.0 + (beta + alpha))) * ((1.0 + alpha) / t_0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((1.0d0 + beta) / t_0) / (3.0d0 + (beta + alpha))) * ((1.0d0 + alpha) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (3.0 + (beta + alpha))) * ((1.0 + alpha) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + beta) / t_0) / (3.0 + (beta + alpha))) * ((1.0 + alpha) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(3.0 + Float64(beta + alpha))) * Float64(Float64(1.0 + alpha) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + beta) / t_0) / (3.0 + (beta + alpha))) * ((1.0 + alpha) / t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{1 + \beta}{t_0}}{3 + \left(\beta + \alpha\right)} \cdot \frac{1 + \alpha}{t_0}
\end{array}
\end{array}
Initial program 94.9%
Simplified97.1%
clear-num97.1%
associate-+r+97.1%
*-commutative97.1%
frac-times93.5%
*-un-lft-identity93.5%
+-commutative93.5%
*-commutative93.5%
associate-+r+93.5%
Applied egg-rr93.5%
associate-/r*97.1%
associate-/l*94.2%
associate-*l/97.1%
*-commutative97.1%
times-frac99.8%
associate-/r*97.1%
*-commutative97.1%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 49000000.0)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* t_0 (+ beta 3.0)))
(* (/ (+ 1.0 alpha) t_0) (/ 1.0 (+ (+ beta 4.0) (* alpha 2.0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 49000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / (t_0 * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / t_0) * (1.0 / ((beta + 4.0) + (alpha * 2.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 <= 49000000.0d0) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / (t_0 * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / t_0) * (1.0d0 / ((beta + 4.0d0) + (alpha * 2.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 <= 49000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / (t_0 * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / t_0) * (1.0 / ((beta + 4.0) + (alpha * 2.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 49000000.0: tmp = ((1.0 + beta) / (beta + 2.0)) / (t_0 * (beta + 3.0)) else: tmp = ((1.0 + alpha) / t_0) * (1.0 / ((beta + 4.0) + (alpha * 2.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 <= 49000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(t_0 * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(1.0 / Float64(Float64(beta + 4.0) + Float64(alpha * 2.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 <= 49000000.0)
tmp = ((1.0 + beta) / (beta + 2.0)) / (t_0 * (beta + 3.0));
else
tmp = ((1.0 + alpha) / t_0) * (1.0 / ((beta + 4.0) + (alpha * 2.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, 49000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / N[(N[(beta + 4.0), $MachinePrecision] + N[(alpha * 2.0), $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 49000000:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{t_0 \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t_0} \cdot \frac{1}{\left(\beta + 4\right) + \alpha \cdot 2}\\
\end{array}
\end{array}
if beta < 4.9e7Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 86.0%
Taylor expanded in alpha around 0 68.3%
if 4.9e7 < beta Initial program 81.8%
Simplified90.2%
clear-num90.1%
inv-pow90.1%
Applied egg-rr90.1%
unpow-190.1%
associate-/l*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 86.3%
associate-+r+86.3%
*-commutative86.3%
Simplified86.3%
Final simplification73.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.52e+16) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ alpha (+ beta 2.0)) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.52e+16) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.52d+16) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((alpha + (beta + 2.0d0)) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.52e+16) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.52e+16: tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.52e+16) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.52e+16)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.52e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.52 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 1.52e16Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 85.2%
Taylor expanded in alpha around 0 67.7%
if 1.52e16 < beta Initial program 81.1%
Simplified89.8%
Taylor expanded in beta around inf 86.5%
un-div-inv86.6%
+-commutative86.6%
associate-+r+86.6%
+-commutative86.6%
+-commutative86.6%
Applied egg-rr86.6%
Final simplification72.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + 2.0)) / (beta + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (((1.0d0 + beta) / (beta + 2.0d0)) / (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + 2.0)) / (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + 2.0)) / (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + 2.0)) / (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{\frac{1 + \beta}{\beta + 2}}{\beta + 3}
\end{array}
Initial program 94.9%
Simplified97.1%
clear-num97.1%
associate-+r+97.1%
*-commutative97.1%
frac-times93.5%
*-un-lft-identity93.5%
+-commutative93.5%
*-commutative93.5%
associate-+r+93.5%
Applied egg-rr93.5%
associate-/r*97.1%
associate-/l*94.2%
associate-*l/97.1%
*-commutative97.1%
times-frac99.8%
associate-/r*97.1%
*-commutative97.1%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 99.8%
Taylor expanded in alpha around 0 70.9%
associate-/r*72.1%
Simplified72.1%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.0)
(*
(/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.0) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((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 <= 5.0d0) then
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((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 <= 5.0) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.0: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(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 <= 5.0)
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((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, 5.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5Initial program 99.9%
Simplified99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around 0 97.2%
+-commutative97.2%
+-commutative97.2%
Simplified97.2%
Taylor expanded in alpha around 0 64.5%
*-commutative64.5%
Simplified64.5%
if 5 < beta Initial program 82.1%
Taylor expanded in beta around -inf 83.2%
expm1-log1p-u83.2%
expm1-udef50.2%
mul-1-neg50.2%
*-commutative50.2%
fma-neg50.2%
metadata-eval50.2%
metadata-eval50.2%
associate-+l+50.2%
metadata-eval50.2%
associate-+r+50.2%
+-commutative50.2%
associate-+r+50.2%
Applied egg-rr50.2%
expm1-def83.2%
expm1-log1p83.2%
distribute-neg-frac83.2%
fma-udef83.2%
distribute-lft1-in83.2%
+-commutative83.2%
*-commutative83.2%
distribute-lft-in83.2%
metadata-eval83.2%
neg-mul-183.2%
unsub-neg83.2%
associate-+l+83.2%
Simplified83.2%
Final simplification69.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.85e+16) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85e+16) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.85d+16) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85e+16) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.85e+16: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.85e+16) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.85e+16)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.85e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.85 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 1.85e16Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 85.2%
Taylor expanded in alpha around 0 66.8%
if 1.85e16 < beta Initial program 81.1%
Simplified89.8%
Taylor expanded in beta around inf 86.5%
un-div-inv86.6%
+-commutative86.6%
associate-+r+86.6%
+-commutative86.6%
+-commutative86.6%
Applied egg-rr86.6%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.0d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.0)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
Simplified99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around 0 97.2%
+-commutative97.2%
+-commutative97.2%
Simplified97.2%
Taylor expanded in alpha around 0 64.8%
if 6 < beta Initial program 82.1%
Simplified90.4%
Taylor expanded in beta around inf 83.0%
un-div-inv83.2%
+-commutative83.2%
associate-+r+83.2%
+-commutative83.2%
+-commutative83.2%
Applied egg-rr83.2%
Final simplification70.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.0) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((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 <= 5.0d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = ((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 <= 5.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.0: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.0) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(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 <= 5.0)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = ((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, 5.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5Initial program 99.9%
Simplified99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around 0 97.2%
+-commutative97.2%
+-commutative97.2%
Simplified97.2%
Taylor expanded in alpha around 0 64.8%
if 5 < beta Initial program 82.1%
Taylor expanded in beta around -inf 83.2%
expm1-log1p-u83.2%
expm1-udef50.2%
mul-1-neg50.2%
*-commutative50.2%
fma-neg50.2%
metadata-eval50.2%
metadata-eval50.2%
associate-+l+50.2%
metadata-eval50.2%
associate-+r+50.2%
+-commutative50.2%
associate-+r+50.2%
Applied egg-rr50.2%
expm1-def83.2%
expm1-log1p83.2%
distribute-neg-frac83.2%
fma-udef83.2%
distribute-lft1-in83.2%
+-commutative83.2%
*-commutative83.2%
distribute-lft-in83.2%
metadata-eval83.2%
neg-mul-183.2%
unsub-neg83.2%
associate-+l+83.2%
Simplified83.2%
Final simplification70.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.6) (/ 0.16666666666666666 (+ beta 2.0)) (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.6) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.6d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = ((1.0d0 + alpha) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.6) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.6: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = ((1.0 + alpha) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.6) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.6)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.6], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.6:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 7.5999999999999996Initial program 99.9%
Simplified99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around 0 97.2%
+-commutative97.2%
+-commutative97.2%
Simplified97.2%
Taylor expanded in alpha around 0 64.8%
if 7.5999999999999996 < beta Initial program 82.1%
Simplified90.4%
Taylor expanded in beta around inf 83.0%
Taylor expanded in beta around inf 82.8%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ (- alpha -1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 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 <= 5.2d0) then
tmp = 0.16666666666666666d0 / (beta + 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 <= 5.2) {
tmp = 0.16666666666666666 / (beta + 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 <= 5.2: tmp = 0.16666666666666666 / (beta + 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 <= 5.2) tmp = Float64(0.16666666666666666 / Float64(beta + 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 <= 5.2)
tmp = 0.16666666666666666 / (beta + 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, 5.2], N[(0.16666666666666666 / N[(beta + 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 5.2:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.9%
Simplified99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around 0 97.2%
+-commutative97.2%
+-commutative97.2%
Simplified97.2%
Taylor expanded in alpha around 0 64.8%
if 5.20000000000000018 < beta Initial program 82.1%
Taylor expanded in beta around -inf 83.2%
Taylor expanded in alpha around 0 83.0%
expm1-log1p-u83.0%
expm1-udef46.0%
mul-1-neg46.0%
*-commutative46.0%
fma-neg46.0%
metadata-eval46.0%
+-commutative46.0%
Applied egg-rr46.0%
expm1-def83.0%
expm1-log1p83.0%
+-commutative83.0%
distribute-neg-frac83.0%
fma-udef83.0%
*-commutative83.0%
mul-1-neg83.0%
metadata-eval83.0%
distribute-neg-in83.0%
+-commutative83.0%
mul-1-neg83.0%
distribute-lft-in83.0%
metadata-eval83.0%
mul-1-neg83.0%
unsub-neg83.0%
Simplified83.0%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ 0.16666666666666666 (+ beta 2.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 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 <= 5.2d0) then
tmp = 0.16666666666666666d0 / (beta + 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 <= 5.2) {
tmp = 0.16666666666666666 / (beta + 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 <= 5.2: tmp = 0.16666666666666666 / (beta + 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 <= 5.2) tmp = Float64(0.16666666666666666 / Float64(beta + 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 <= 5.2)
tmp = 0.16666666666666666 / (beta + 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, 5.2], N[(0.16666666666666666 / N[(beta + 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 5.2:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.9%
Simplified99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around 0 97.2%
+-commutative97.2%
+-commutative97.2%
Simplified97.2%
Taylor expanded in alpha around 0 64.8%
if 5.20000000000000018 < beta Initial program 82.1%
Taylor expanded in beta around -inf 83.2%
Taylor expanded in alpha around 0 72.0%
Final simplification66.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.3e+122) (/ 0.16666666666666666 (+ beta 2.0)) (* 0.3333333333333333 (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.3e+122) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 0.3333333333333333 * (alpha / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.3d+122) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = 0.3333333333333333d0 * (alpha / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.3e+122) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 0.3333333333333333 * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.3e+122: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = 0.3333333333333333 * (alpha / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.3e+122) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(0.3333333333333333 * Float64(alpha / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.3e+122)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = 0.3333333333333333 * (alpha / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.3e+122], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+122}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;0.3333333333333333 \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 1.30000000000000004e122Initial program 98.9%
Simplified99.3%
clear-num99.3%
inv-pow99.3%
Applied egg-rr99.3%
unpow-199.3%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around 0 86.4%
+-commutative86.4%
+-commutative86.4%
Simplified86.4%
Taylor expanded in alpha around 0 57.0%
if 1.30000000000000004e122 < beta Initial program 74.8%
Taylor expanded in beta around -inf 93.4%
Taylor expanded in alpha around 0 93.3%
Taylor expanded in beta around 0 6.2%
sub-neg6.2%
mul-1-neg6.2%
distribute-neg-in6.2%
+-commutative6.2%
mul-1-neg6.2%
distribute-lft-in6.2%
metadata-eval6.2%
mul-1-neg6.2%
unsub-neg6.2%
Simplified6.2%
Taylor expanded in alpha around inf 44.9%
Final simplification55.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (* 0.3333333333333333 (/ alpha beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 * (alpha / 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 * (alpha / beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 * (alpha / beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 * (alpha / beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 * Float64(alpha / beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 * (alpha / beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.3333333333333333 \cdot \frac{\alpha}{\beta}
\end{array}
Initial program 94.9%
Taylor expanded in beta around -inf 25.7%
Taylor expanded in alpha around 0 25.5%
Taylor expanded in beta around 0 4.0%
sub-neg4.0%
mul-1-neg4.0%
distribute-neg-in4.0%
+-commutative4.0%
mul-1-neg4.0%
distribute-lft-in4.0%
metadata-eval4.0%
mul-1-neg4.0%
unsub-neg4.0%
Simplified4.0%
Taylor expanded in alpha around inf 10.4%
Final simplification10.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.3333333333333333d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\beta}
\end{array}
Initial program 94.9%
Taylor expanded in beta around -inf 25.7%
Taylor expanded in alpha around 0 25.5%
Taylor expanded in beta around 0 4.0%
sub-neg4.0%
mul-1-neg4.0%
distribute-neg-in4.0%
+-commutative4.0%
mul-1-neg4.0%
distribute-lft-in4.0%
metadata-eval4.0%
mul-1-neg4.0%
unsub-neg4.0%
Simplified4.0%
Taylor expanded in alpha around 0 4.5%
Final simplification4.5%
herbie shell --seed 2024023
(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)))