
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) 2.0))) (/ (/ (* (+ 1.0 alpha) (/ (+ 1.0 beta) t_0)) t_0) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
return (((1.0 + alpha) * ((1.0 + beta) / t_0)) / t_0) / (alpha + (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
real(8) :: t_0
t_0 = (alpha + beta) + 2.0d0
code = (((1.0d0 + alpha) * ((1.0d0 + beta) / t_0)) / t_0) / (alpha + (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
return (((1.0 + alpha) * ((1.0 + beta) / t_0)) / t_0) / (alpha + (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + beta) + 2.0 return (((1.0 + alpha) * ((1.0 + beta) / t_0)) / t_0) / (alpha + (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + 2.0) return Float64(Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(1.0 + beta) / t_0)) / t_0) / Float64(alpha + Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (alpha + beta) + 2.0;
tmp = (((1.0 + alpha) * ((1.0 + beta) / t_0)) / t_0) / (alpha + (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $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 := \left(\alpha + \beta\right) + 2\\
\frac{\frac{\left(1 + \alpha\right) \cdot \frac{1 + \beta}{t_0}}{t_0}}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 95.5%
Simplified96.9%
clear-num96.9%
associate-+r+96.9%
*-commutative96.9%
frac-times91.9%
*-un-lft-identity91.9%
+-commutative91.9%
*-commutative91.9%
associate-+r+91.9%
Applied egg-rr91.9%
associate-/r*96.9%
associate-/l*93.8%
associate-*l/96.9%
*-commutative96.9%
times-frac99.7%
associate-/r*96.9%
*-commutative96.9%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
frac-times96.9%
+-commutative96.9%
+-commutative96.9%
+-commutative96.9%
associate-+r+96.9%
+-commutative96.9%
*-commutative96.9%
associate-/r*99.8%
Applied egg-rr99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 3.3e+146)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_0 t_1)))
(/
(/ (* (+ 1.0 alpha) (- 1.0 (/ alpha beta))) (+ (+ alpha beta) 2.0))
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 <= 3.3e+146) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = (((1.0 + alpha) * (1.0 - (alpha / beta))) / ((alpha + beta) + 2.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 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 3.3d+146) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_0 * t_1))
else
tmp = (((1.0d0 + alpha) * (1.0d0 - (alpha / beta))) / ((alpha + beta) + 2.0d0)) / 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 <= 3.3e+146) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = (((1.0 + alpha) * (1.0 - (alpha / beta))) / ((alpha + beta) + 2.0)) / 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 <= 3.3e+146: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1)) else: tmp = (((1.0 + alpha) * (1.0 - (alpha / beta))) / ((alpha + beta) + 2.0)) / 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 <= 3.3e+146) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_0 * t_1))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 - Float64(alpha / beta))) / Float64(Float64(alpha + beta) + 2.0)) / 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 <= 3.3e+146)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
else
tmp = (((1.0 + alpha) * (1.0 - (alpha / beta))) / ((alpha + beta) + 2.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[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.3e+146], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 - N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $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 3.3 \cdot 10^{+146}:\\
\;\;\;\;\frac{1 + \alpha}{t_1} \cdot \frac{1 + \beta}{t_0 \cdot t_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(1 + \alpha\right) \cdot \left(1 - \frac{\alpha}{\beta}\right)}{\left(\alpha + \beta\right) + 2}}{t_0}\\
\end{array}
\end{array}
if beta < 3.30000000000000016e146Initial program 97.9%
Simplified98.1%
if 3.30000000000000016e146 < beta Initial program 83.2%
Simplified90.5%
clear-num90.5%
associate-+r+90.5%
*-commutative90.5%
frac-times84.1%
*-un-lft-identity84.1%
+-commutative84.1%
*-commutative84.1%
associate-+r+84.1%
Applied egg-rr84.1%
associate-/r*90.5%
associate-/l*78.6%
associate-*l/90.5%
*-commutative90.5%
times-frac99.9%
associate-/r*90.5%
*-commutative90.5%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
frac-times90.5%
+-commutative90.5%
+-commutative90.5%
+-commutative90.5%
associate-+r+90.5%
+-commutative90.5%
*-commutative90.5%
associate-/r*99.9%
Applied egg-rr99.9%
Taylor expanded in beta around inf 95.0%
mul-1-neg95.0%
unsub-neg95.0%
Simplified95.0%
Taylor expanded in alpha around inf 95.0%
Final simplification97.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)))) (* (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0))) (/ (+ 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) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0))) * ((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) / (alpha + (beta + 3.0))) * ((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) / (alpha + (beta + 3.0))) * ((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(alpha + Float64(beta + 3.0))) * 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) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $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}}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{t_0}
\end{array}
\end{array}
Initial program 95.5%
Simplified96.9%
clear-num96.9%
associate-+r+96.9%
*-commutative96.9%
frac-times91.9%
*-un-lft-identity91.9%
+-commutative91.9%
*-commutative91.9%
associate-+r+91.9%
Applied egg-rr91.9%
associate-/r*96.9%
associate-/l*93.8%
associate-*l/96.9%
*-commutative96.9%
times-frac99.7%
associate-/r*96.9%
*-commutative96.9%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Final simplification99.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.3e+15)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))
(/
(/ (* (+ 1.0 alpha) (- 1.0 (/ alpha beta))) (+ (+ alpha beta) 2.0))
(+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (((1.0 + alpha) * (1.0 - (alpha / beta))) / ((alpha + beta) + 2.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) :: tmp
if (beta <= 2.3d+15) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = (((1.0d0 + alpha) * (1.0d0 - (alpha / beta))) / ((alpha + beta) + 2.0d0)) / (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 <= 2.3e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (((1.0 + alpha) * (1.0 - (alpha / beta))) / ((alpha + beta) + 2.0)) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3e+15: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = (((1.0 + alpha) * (1.0 - (alpha / beta))) / ((alpha + beta) + 2.0)) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.3e+15) 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(Float64(1.0 + alpha) * Float64(1.0 - Float64(alpha / beta))) / Float64(Float64(alpha + beta) + 2.0)) / 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 <= 2.3e+15)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = (((1.0 + alpha) * (1.0 - (alpha / beta))) / ((alpha + beta) + 2.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_] := If[LessEqual[beta, 2.3e+15], 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[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 - N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $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 2.3 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(1 + \alpha\right) \cdot \left(1 - \frac{\alpha}{\beta}\right)}{\left(\alpha + \beta\right) + 2}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.3e15Initial program 99.7%
associate-/l/99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 75.7%
Taylor expanded in alpha around 0 60.3%
if 2.3e15 < beta Initial program 85.6%
Simplified90.9%
clear-num90.9%
associate-+r+90.9%
*-commutative90.9%
frac-times74.2%
*-un-lft-identity74.2%
+-commutative74.2%
*-commutative74.2%
associate-+r+74.2%
Applied egg-rr74.2%
associate-/r*91.1%
associate-/l*80.5%
associate-*l/91.2%
*-commutative91.2%
times-frac99.6%
associate-/r*90.9%
*-commutative90.9%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
frac-times91.2%
+-commutative91.2%
+-commutative91.2%
+-commutative91.2%
associate-+r+91.2%
+-commutative91.2%
*-commutative91.2%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 81.2%
mul-1-neg81.2%
unsub-neg81.2%
Simplified81.2%
Taylor expanded in alpha around inf 81.2%
Final simplification66.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.2) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.2d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.2: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.2) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.2)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.2], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.2000000000000002Initial program 99.8%
Simplified99.4%
*-commutative99.4%
associate-+r+99.4%
associate-/r*99.8%
frac-times99.4%
+-commutative99.4%
*-commutative99.4%
associate-+r+99.4%
Applied egg-rr99.4%
distribute-lft-in99.4%
Applied egg-rr99.4%
Taylor expanded in beta around 0 90.8%
associate-/r*97.3%
+-commutative97.3%
distribute-rgt-in97.3%
+-commutative97.3%
+-commutative97.3%
Simplified97.3%
if 3.2000000000000002 < beta Initial program 87.2%
Simplified91.9%
clear-num91.9%
associate-+r+91.9%
*-commutative91.9%
frac-times77.2%
*-un-lft-identity77.2%
+-commutative77.2%
*-commutative77.2%
associate-+r+77.2%
Applied egg-rr77.2%
associate-/r*92.1%
associate-/l*82.7%
associate-*l/92.1%
*-commutative92.1%
times-frac99.6%
associate-/r*91.9%
*-commutative91.9%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
frac-times92.1%
+-commutative92.1%
+-commutative92.1%
+-commutative92.1%
associate-+r+92.1%
+-commutative92.1%
*-commutative92.1%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 73.9%
Final simplification89.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.3) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) (+ (+ alpha beta) 2.0)) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.3) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / ((alpha + beta) + 2.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) :: tmp
if (beta <= 1.3d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / ((alpha + beta) + 2.0d0)) / (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 <= 1.3) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / ((alpha + beta) + 2.0)) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.3: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / ((alpha + beta) + 2.0)) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.3) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + beta) + 2.0)) / 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 <= 1.3)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / ((alpha + beta) + 2.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_] := If[LessEqual[beta, 1.3], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $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 1.3:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\left(\alpha + \beta\right) + 2}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.30000000000000004Initial program 99.8%
Simplified99.4%
*-commutative99.4%
associate-+r+99.4%
associate-/r*99.8%
frac-times99.4%
+-commutative99.4%
*-commutative99.4%
associate-+r+99.4%
Applied egg-rr99.4%
distribute-lft-in99.4%
Applied egg-rr99.4%
Taylor expanded in beta around 0 90.8%
associate-/r*97.3%
+-commutative97.3%
distribute-rgt-in97.3%
+-commutative97.3%
+-commutative97.3%
Simplified97.3%
if 1.30000000000000004 < beta Initial program 87.2%
Simplified91.9%
clear-num91.9%
associate-+r+91.9%
*-commutative91.9%
frac-times77.2%
*-un-lft-identity77.2%
+-commutative77.2%
*-commutative77.2%
associate-+r+77.2%
Applied egg-rr77.2%
associate-/r*92.1%
associate-/l*82.7%
associate-*l/92.1%
*-commutative92.1%
times-frac99.6%
associate-/r*91.9%
*-commutative91.9%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
frac-times92.1%
+-commutative92.1%
+-commutative92.1%
+-commutative92.1%
associate-+r+92.1%
+-commutative92.1%
*-commutative92.1%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 74.6%
Final simplification89.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2e+15) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) (+ (+ alpha beta) 2.0)) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / ((alpha + beta) + 2.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) :: tmp
if (beta <= 5.2d+15) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / ((alpha + beta) + 2.0d0)) / (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.2e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / ((alpha + beta) + 2.0)) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2e+15: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / ((alpha + beta) + 2.0)) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2e+15) 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(Float64(alpha + beta) + 2.0)) / 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.2e+15)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / ((alpha + beta) + 2.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_] := If[LessEqual[beta, 5.2e+15], 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[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $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.2 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\left(\alpha + \beta\right) + 2}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.2e15Initial program 99.7%
associate-/l/99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 75.7%
Taylor expanded in alpha around 0 60.3%
if 5.2e15 < beta Initial program 85.6%
Simplified90.9%
clear-num90.9%
associate-+r+90.9%
*-commutative90.9%
frac-times74.2%
*-un-lft-identity74.2%
+-commutative74.2%
*-commutative74.2%
associate-+r+74.2%
Applied egg-rr74.2%
associate-/r*91.1%
associate-/l*80.5%
associate-*l/91.2%
*-commutative91.2%
times-frac99.6%
associate-/r*90.9%
*-commutative90.9%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
frac-times91.2%
+-commutative91.2%
+-commutative91.2%
+-commutative91.2%
associate-+r+91.2%
+-commutative91.2%
*-commutative91.2%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 81.0%
Final simplification66.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 11.6) (/ (/ 0.5 (+ beta 2.0)) (+ alpha (+ beta 3.0))) (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 11.6) {
tmp = (0.5 / (beta + 2.0)) / (alpha + (beta + 3.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 <= 11.6d0) then
tmp = (0.5d0 / (beta + 2.0d0)) / (alpha + (beta + 3.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 <= 11.6) {
tmp = (0.5 / (beta + 2.0)) / (alpha + (beta + 3.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 <= 11.6: tmp = (0.5 / (beta + 2.0)) / (alpha + (beta + 3.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 <= 11.6) tmp = Float64(Float64(0.5 / Float64(beta + 2.0)) / Float64(alpha + Float64(beta + 3.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 <= 11.6)
tmp = (0.5 / (beta + 2.0)) / (alpha + (beta + 3.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, 11.6], N[(N[(0.5 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 11.6:\\
\;\;\;\;\frac{\frac{0.5}{\beta + 2}}{\alpha + \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 11.5999999999999996Initial program 99.8%
Simplified99.4%
clear-num99.4%
associate-+r+99.4%
*-commutative99.4%
frac-times99.4%
*-un-lft-identity99.4%
+-commutative99.4%
*-commutative99.4%
associate-+r+99.4%
Applied egg-rr99.4%
associate-/r*99.4%
associate-/l*99.4%
associate-*l/99.4%
*-commutative99.4%
times-frac99.8%
associate-/r*99.4%
*-commutative99.4%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
frac-times99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
+-commutative99.4%
*-commutative99.4%
associate-/r*99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.6%
Taylor expanded in alpha around 0 60.0%
if 11.5999999999999996 < beta Initial program 87.0%
Simplified91.8%
Taylor expanded in beta around inf 74.5%
Taylor expanded in beta around inf 74.2%
Final simplification64.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 3.0))))
(if (<= beta 4.5)
(/ (/ 0.5 (+ beta 2.0)) t_0)
(/ (/ (+ 1.0 alpha) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 4.5) {
tmp = (0.5 / (beta + 2.0)) / t_0;
} else {
tmp = ((1.0 + alpha) / 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) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (beta <= 4.5d0) then
tmp = (0.5d0 / (beta + 2.0d0)) / t_0
else
tmp = ((1.0d0 + alpha) / 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 tmp;
if (beta <= 4.5) {
tmp = (0.5 / (beta + 2.0)) / t_0;
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) tmp = 0 if beta <= 4.5: tmp = (0.5 / (beta + 2.0)) / t_0 else: tmp = ((1.0 + alpha) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 4.5) tmp = Float64(Float64(0.5 / Float64(beta + 2.0)) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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);
tmp = 0.0;
if (beta <= 4.5)
tmp = (0.5 / (beta + 2.0)) / t_0;
else
tmp = ((1.0 + alpha) / 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]}, If[LessEqual[beta, 4.5], N[(N[(0.5 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{\frac{0.5}{\beta + 2}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t_0}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.8%
Simplified99.4%
clear-num99.4%
associate-+r+99.4%
*-commutative99.4%
frac-times99.4%
*-un-lft-identity99.4%
+-commutative99.4%
*-commutative99.4%
associate-+r+99.4%
Applied egg-rr99.4%
associate-/r*99.4%
associate-/l*99.4%
associate-*l/99.4%
*-commutative99.4%
times-frac99.8%
associate-/r*99.4%
*-commutative99.4%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
frac-times99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
+-commutative99.4%
*-commutative99.4%
associate-/r*99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.6%
Taylor expanded in alpha around 0 60.0%
if 4.5 < beta Initial program 87.0%
Simplified91.8%
clear-num91.8%
associate-+r+91.8%
*-commutative91.8%
frac-times76.9%
*-un-lft-identity76.9%
+-commutative76.9%
*-commutative76.9%
associate-+r+76.9%
Applied egg-rr76.9%
associate-/r*92.0%
associate-/l*82.5%
associate-*l/92.0%
*-commutative92.0%
times-frac99.6%
associate-/r*91.8%
*-commutative91.8%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
frac-times92.0%
+-commutative92.0%
+-commutative92.0%
+-commutative92.0%
associate-+r+92.0%
+-commutative92.0%
*-commutative92.0%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 74.8%
Final simplification64.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6) 0.08333333333333333 (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = 0.08333333333333333;
} 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 <= 3.6d0) then
tmp = 0.08333333333333333d0
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 <= 3.6) {
tmp = 0.08333333333333333;
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6: tmp = 0.08333333333333333 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 <= 3.6) tmp = 0.08333333333333333; 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 <= 3.6)
tmp = 0.08333333333333333;
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, 3.6], 0.08333333333333333, 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 3.6:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.8%
associate-/l/99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 76.5%
Taylor expanded in beta around 0 74.4%
+-commutative74.4%
+-commutative74.4%
Simplified74.4%
Taylor expanded in alpha around 0 58.3%
if 3.60000000000000009 < beta Initial program 87.0%
Simplified91.8%
Taylor expanded in beta around inf 74.5%
Taylor expanded in beta around inf 74.2%
Final simplification63.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) 0.08333333333333333 (/ 1.0 (* beta (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / (beta * (beta + 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) :: tmp
if (beta <= 2.6d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / (beta * (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / (beta * (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.08333333333333333 else: tmp = 1.0 / (beta * (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = 0.08333333333333333; else tmp = Float64(1.0 / Float64(beta * Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.6)
tmp = 0.08333333333333333;
else
tmp = 1.0 / (beta * (beta + 2.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.6], 0.08333333333333333, N[(1.0 / N[(beta * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.8%
associate-/l/99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 76.4%
Taylor expanded in beta around 0 74.3%
+-commutative74.3%
+-commutative74.3%
Simplified74.3%
Taylor expanded in alpha around 0 58.6%
if 2.60000000000000009 < beta Initial program 87.2%
Simplified91.9%
Taylor expanded in beta around inf 73.7%
Taylor expanded in alpha around 0 70.1%
Final simplification62.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) 0.08333333333333333 (/ (/ 1.0 (+ beta 2.0)) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333;
} else {
tmp = (1.0 / (beta + 2.0)) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.6d0) then
tmp = 0.08333333333333333d0
else
tmp = (1.0d0 / (beta + 2.0d0)) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333;
} else {
tmp = (1.0 / (beta + 2.0)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.08333333333333333 else: tmp = (1.0 / (beta + 2.0)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = 0.08333333333333333; else tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.6)
tmp = 0.08333333333333333;
else
tmp = (1.0 / (beta + 2.0)) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.6], 0.08333333333333333, N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta + 2}}{\beta}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.8%
associate-/l/99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 76.4%
Taylor expanded in beta around 0 74.3%
+-commutative74.3%
+-commutative74.3%
Simplified74.3%
Taylor expanded in alpha around 0 58.6%
if 2.60000000000000009 < beta Initial program 87.2%
Simplified91.9%
Taylor expanded in beta around inf 73.7%
un-div-inv73.9%
+-commutative73.9%
associate-+r+73.9%
+-commutative73.9%
Applied egg-rr73.9%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
Simplified71.2%
Final simplification62.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.5 (+ 6.0 (* alpha 5.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.5 / (6.0 + (alpha * 5.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.5d0 / (6.0d0 + (alpha * 5.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.5 / (6.0 + (alpha * 5.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.5 / (6.0 + (alpha * 5.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.5 / Float64(6.0 + Float64(alpha * 5.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.5 / (6.0 + (alpha * 5.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.5 / N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.5}{6 + \alpha \cdot 5}
\end{array}
Initial program 95.5%
associate-/l/93.8%
+-commutative93.8%
+-commutative93.8%
associate-+r+93.8%
*-commutative93.8%
metadata-eval93.8%
associate-+l+93.8%
metadata-eval93.8%
associate-+l+93.8%
metadata-eval93.8%
metadata-eval93.8%
associate-+l+93.8%
Simplified93.8%
Taylor expanded in alpha around 0 77.7%
Taylor expanded in alpha around 0 67.2%
Taylor expanded in beta around 0 41.8%
*-commutative41.8%
Simplified41.8%
Final simplification41.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 12.0) 0.08333333333333333 (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 12.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 12.0: tmp = 0.08333333333333333 else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 12.0) tmp = 0.08333333333333333; else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 12.0)
tmp = 0.08333333333333333;
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 12.0], 0.08333333333333333, N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 12:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 12Initial program 99.8%
associate-/l/99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 76.5%
Taylor expanded in beta around 0 74.4%
+-commutative74.4%
+-commutative74.4%
Simplified74.4%
Taylor expanded in alpha around 0 58.3%
if 12 < beta Initial program 87.0%
Simplified91.8%
Taylor expanded in beta around inf 74.5%
un-div-inv74.7%
+-commutative74.7%
associate-+r+74.7%
+-commutative74.7%
Applied egg-rr74.7%
Taylor expanded in alpha around inf 7.1%
Final simplification41.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 95.5%
associate-/l/93.8%
+-commutative93.8%
+-commutative93.8%
associate-+r+93.8%
*-commutative93.8%
metadata-eval93.8%
associate-+l+93.8%
metadata-eval93.8%
associate-+l+93.8%
metadata-eval93.8%
metadata-eval93.8%
associate-+l+93.8%
Simplified93.8%
Taylor expanded in alpha around 0 77.7%
Taylor expanded in beta around 0 54.0%
+-commutative54.0%
+-commutative54.0%
Simplified54.0%
Taylor expanded in alpha around 0 40.4%
Final simplification40.4%
herbie shell --seed 2023321
(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)))