
(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 20 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 (+ 2.0 (+ beta alpha))))
(if (<= beta 1e+154)
(* (/ (+ 1.0 beta) t_0) (/ (+ 1.0 alpha) (* (+ beta 2.0) (+ beta 3.0))))
(* (/ (+ 1.0 alpha) t_0) (/ (/ beta (+ alpha (+ beta 3.0))) t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1e+154) {
tmp = ((1.0 + beta) / t_0) * ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / t_0) * ((beta / (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) :: tmp
t_0 = 2.0d0 + (beta + alpha)
if (beta <= 1d+154) then
tmp = ((1.0d0 + beta) / t_0) * ((1.0d0 + alpha) / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / t_0) * ((beta / (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 tmp;
if (beta <= 1e+154) {
tmp = ((1.0 + beta) / t_0) * ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / t_0) * ((beta / (alpha + (beta + 3.0))) / t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 1e+154: tmp = ((1.0 + beta) / t_0) * ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / t_0) * ((beta / (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)) tmp = 0.0 if (beta <= 1e+154) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(Float64(1.0 + alpha) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(beta / 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);
tmp = 0.0;
if (beta <= 1e+154)
tmp = ((1.0 + beta) / t_0) * ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / t_0) * ((beta / (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]}, If[LessEqual[beta, 1e+154], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(beta / 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)\\
\mathbf{if}\;\beta \leq 10^{+154}:\\
\;\;\;\;\frac{1 + \beta}{t\_0} \cdot \frac{1 + \alpha}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{\frac{\beta}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.00000000000000004e154Initial program 98.3%
Simplified90.3%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
+-commutative63.2%
Simplified63.2%
+-commutative63.2%
*-commutative63.2%
+-commutative63.2%
+-commutative63.2%
times-frac63.7%
associate-+r+63.7%
+-commutative63.7%
+-commutative63.7%
+-commutative63.7%
+-commutative63.7%
Applied egg-rr63.7%
if 1.00000000000000004e154 < beta Initial program 79.4%
Simplified78.2%
Taylor expanded in beta around inf 78.2%
times-frac91.3%
+-commutative91.3%
associate-+r+91.3%
+-commutative91.3%
+-commutative91.3%
associate-+r+91.3%
*-commutative91.3%
associate-+r+91.3%
associate-+r+91.3%
+-commutative91.3%
+-commutative91.3%
Applied egg-rr91.3%
+-commutative91.3%
+-commutative91.3%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Final simplification72.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2e+16)
(/
(* (+ 1.0 beta) (+ 1.0 alpha))
(* (* (+ beta 2.0) (+ beta 3.0)) (+ alpha (+ beta 2.0))))
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+16) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (((beta + 2.0) * (beta + 3.0)) * (alpha + (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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 <= 2d+16) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / (((beta + 2.0d0) * (beta + 3.0d0)) * (alpha + (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+16) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (((beta + 2.0) * (beta + 3.0)) * (alpha + (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2e+16: tmp = ((1.0 + beta) * (1.0 + alpha)) / (((beta + 2.0) * (beta + 3.0)) * (alpha + (beta + 2.0))) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2e+16) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(Float64(Float64(beta + 2.0) * Float64(beta + 3.0)) * Float64(alpha + Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2e+16)
tmp = ((1.0 + beta) * (1.0 + alpha)) / (((beta + 2.0) * (beta + 3.0)) * (alpha + (beta + 2.0)));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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, 2e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2 \cdot 10^{+16}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{\left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right) \cdot \left(\alpha + \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 2e16Initial program 99.3%
Simplified93.2%
Taylor expanded in alpha around 0 64.0%
+-commutative64.0%
+-commutative64.0%
Simplified64.0%
if 2e16 < beta Initial program 83.4%
Taylor expanded in beta around inf 87.0%
*-un-lft-identity87.0%
associate-/l/85.5%
metadata-eval85.5%
associate-+l+85.5%
metadata-eval85.5%
associate-+r+85.5%
Applied egg-rr85.5%
*-lft-identity85.5%
associate-/r*87.0%
+-commutative87.0%
+-commutative87.0%
Simplified87.0%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1e+31)
(*
(/ (+ 1.0 beta) (+ 2.0 (+ beta alpha)))
(/ (+ 1.0 alpha) (* (+ beta 2.0) (+ beta 3.0))))
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+31) {
tmp = ((1.0 + beta) / (2.0 + (beta + alpha))) * ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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 <= 1d+31) then
tmp = ((1.0d0 + beta) / (2.0d0 + (beta + alpha))) * ((1.0d0 + alpha) / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+31) {
tmp = ((1.0 + beta) / (2.0 + (beta + alpha))) * ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1e+31: tmp = ((1.0 + beta) / (2.0 + (beta + alpha))) * ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1e+31) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + Float64(beta + alpha))) * Float64(Float64(1.0 + alpha) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1e+31)
tmp = ((1.0 + beta) / (2.0 + (beta + alpha))) * ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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, 1e+31], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10^{+31}:\\
\;\;\;\;\frac{1 + \beta}{2 + \left(\beta + \alpha\right)} \cdot \frac{1 + \alpha}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 9.9999999999999996e30Initial program 98.7%
Simplified92.9%
Taylor expanded in alpha around 0 63.5%
+-commutative63.5%
+-commutative63.5%
Simplified63.5%
+-commutative63.5%
*-commutative63.5%
+-commutative63.5%
+-commutative63.5%
times-frac63.0%
associate-+r+63.0%
+-commutative63.0%
+-commutative63.0%
+-commutative63.0%
+-commutative63.0%
Applied egg-rr63.0%
if 9.9999999999999996e30 < beta Initial program 83.5%
Taylor expanded in beta around inf 89.6%
*-un-lft-identity89.6%
associate-/l/86.8%
metadata-eval86.8%
associate-+l+86.8%
metadata-eval86.8%
associate-+r+86.8%
Applied egg-rr86.8%
*-lft-identity86.8%
associate-/r*89.6%
+-commutative89.6%
+-commutative89.6%
Simplified89.6%
Final simplification71.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5e+16)
(/
(* (+ 1.0 beta) (+ 1.0 alpha))
(* (+ beta 2.0) (* (+ beta 2.0) (+ beta 3.0))))
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+16) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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 <= 5d+16) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / ((beta + 2.0d0) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+16) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5e+16: tmp = ((1.0 + beta) * (1.0 + alpha)) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5e+16) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5e+16)
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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, 5e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5 \cdot 10^{+16}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 5e16Initial program 99.3%
Simplified93.2%
Taylor expanded in alpha around 0 64.0%
+-commutative64.0%
+-commutative64.0%
Simplified64.0%
Taylor expanded in alpha around 0 63.0%
+-commutative63.0%
Simplified63.0%
if 5e16 < beta Initial program 83.4%
Taylor expanded in beta around inf 87.0%
*-un-lft-identity87.0%
associate-/l/85.5%
metadata-eval85.5%
associate-+l+85.5%
metadata-eval85.5%
associate-+r+85.5%
Applied egg-rr85.5%
*-lft-identity85.5%
associate-/r*87.0%
+-commutative87.0%
+-commutative87.0%
Simplified87.0%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.02e+31)
(*
(/ (+ 1.0 alpha) (* (+ beta 2.0) (+ beta 3.0)))
(/ (+ 1.0 beta) (+ beta 2.0)))
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.02e+31) {
tmp = ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0))) * ((1.0 + beta) / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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 <= 1.02d+31) then
tmp = ((1.0d0 + alpha) / ((beta + 2.0d0) * (beta + 3.0d0))) * ((1.0d0 + beta) / (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.02e+31) {
tmp = ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0))) * ((1.0 + beta) / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.02e+31: tmp = ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0))) * ((1.0 + beta) / (beta + 2.0)) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.02e+31) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))) * Float64(Float64(1.0 + beta) / Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.02e+31)
tmp = ((1.0 + alpha) / ((beta + 2.0) * (beta + 3.0))) * ((1.0 + beta) / (beta + 2.0));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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, 1.02e+31], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.02 \cdot 10^{+31}:\\
\;\;\;\;\frac{1 + \alpha}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)} \cdot \frac{1 + \beta}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 1.02000000000000007e31Initial program 98.7%
Simplified92.9%
Taylor expanded in alpha around 0 63.5%
+-commutative63.5%
+-commutative63.5%
Simplified63.5%
+-commutative63.5%
*-commutative63.5%
+-commutative63.5%
+-commutative63.5%
times-frac63.0%
associate-+r+63.0%
+-commutative63.0%
+-commutative63.0%
+-commutative63.0%
+-commutative63.0%
Applied egg-rr63.0%
Taylor expanded in alpha around 0 62.6%
if 1.02000000000000007e31 < beta Initial program 83.5%
Taylor expanded in beta around inf 89.6%
*-un-lft-identity89.6%
associate-/l/86.8%
metadata-eval86.8%
associate-+l+86.8%
metadata-eval86.8%
associate-+r+86.8%
Applied egg-rr86.8%
*-lft-identity86.8%
associate-/r*89.6%
+-commutative89.6%
+-commutative89.6%
Simplified89.6%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* (/ (+ beta (+ 2.0 alpha)) (+ 1.0 beta)) (* (/ (+ beta 2.0) (+ 1.0 alpha)) (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (((beta + (2.0 + alpha)) / (1.0 + beta)) * (((beta + 2.0) / (1.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
code = 1.0d0 / (((beta + (2.0d0 + alpha)) / (1.0d0 + beta)) * (((beta + 2.0d0) / (1.0d0 + alpha)) * (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (((beta + (2.0 + alpha)) / (1.0 + beta)) * (((beta + 2.0) / (1.0 + alpha)) * (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (((beta + (2.0 + alpha)) / (1.0 + beta)) * (((beta + 2.0) / (1.0 + alpha)) * (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(Float64(Float64(beta + Float64(2.0 + alpha)) / Float64(1.0 + beta)) * Float64(Float64(Float64(beta + 2.0) / Float64(1.0 + alpha)) * Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (((beta + (2.0 + alpha)) / (1.0 + beta)) * (((beta + 2.0) / (1.0 + alpha)) * (beta + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(N[(N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(beta + 2.0), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\frac{\beta + \left(2 + \alpha\right)}{1 + \beta} \cdot \left(\frac{\beta + 2}{1 + \alpha} \cdot \left(\beta + 3\right)\right)}
\end{array}
Initial program 93.7%
Simplified87.3%
Taylor expanded in alpha around 0 66.8%
+-commutative66.8%
+-commutative66.8%
Simplified66.8%
+-commutative66.8%
*-commutative66.8%
+-commutative66.8%
+-commutative66.8%
times-frac70.4%
associate-+r+70.4%
+-commutative70.4%
+-commutative70.4%
+-commutative70.4%
+-commutative70.4%
Applied egg-rr70.4%
clear-num70.4%
clear-num70.4%
frac-times70.4%
metadata-eval70.4%
associate-+l+70.4%
*-commutative70.4%
Applied egg-rr70.4%
+-commutative70.4%
associate-/l*71.4%
+-commutative71.4%
Simplified71.4%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1e+31) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+31) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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 <= 1d+31) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+31) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1e+31: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1e+31) 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(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1e+31)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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, 1e+31], 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[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10^{+31}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 9.9999999999999996e30Initial program 98.7%
associate-/l/98.2%
+-commutative98.2%
associate-+l+98.2%
*-commutative98.2%
metadata-eval98.2%
associate-+l+98.2%
metadata-eval98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
metadata-eval98.2%
metadata-eval98.2%
associate-+l+98.2%
Simplified98.2%
Taylor expanded in alpha around 0 84.5%
+-commutative84.5%
Simplified84.5%
Taylor expanded in alpha around 0 62.9%
if 9.9999999999999996e30 < beta Initial program 83.5%
Taylor expanded in beta around inf 89.6%
*-un-lft-identity89.6%
associate-/l/86.8%
metadata-eval86.8%
associate-+l+86.8%
metadata-eval86.8%
associate-+r+86.8%
Applied egg-rr86.8%
*-lft-identity86.8%
associate-/r*89.6%
+-commutative89.6%
+-commutative89.6%
Simplified89.6%
Final simplification71.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.4e+16) (/ (/ (+ 1.0 beta) (* (+ beta 2.0) (+ beta 3.0))) (+ beta 2.0)) (/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4e+16) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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.4d+16) then
tmp = ((1.0d0 + beta) / ((beta + 2.0d0) * (beta + 3.0d0))) / (beta + 2.0d0)
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4e+16) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.4e+16: tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / (beta + 2.0) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.4e+16) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))) / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.4e+16)
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / (beta + 2.0);
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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.4e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.4 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 2.4e16Initial program 99.3%
associate-/l/98.7%
+-commutative98.7%
associate-+l+98.7%
*-commutative98.7%
metadata-eval98.7%
associate-+l+98.7%
metadata-eval98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
metadata-eval98.7%
metadata-eval98.7%
associate-+l+98.7%
Simplified98.7%
Taylor expanded in alpha around 0 83.9%
+-commutative83.9%
Simplified83.9%
Taylor expanded in alpha around 0 63.3%
*-un-lft-identity63.3%
+-commutative63.3%
*-commutative63.3%
times-frac63.3%
+-commutative63.3%
Applied egg-rr63.3%
associate-*r/63.3%
frac-times63.3%
*-un-lft-identity63.3%
Applied egg-rr63.3%
if 2.4e16 < beta Initial program 83.4%
Taylor expanded in beta around inf 87.0%
*-un-lft-identity87.0%
associate-/l/85.5%
metadata-eval85.5%
associate-+l+85.5%
metadata-eval85.5%
associate-+r+85.5%
Applied egg-rr85.5%
*-lft-identity85.5%
associate-/r*87.0%
+-commutative87.0%
+-commutative87.0%
Simplified87.0%
Final simplification71.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.2) (/ (/ (+ 1.0 alpha) (+ 2.0 alpha)) (* (+ 2.0 alpha) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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 <= 6.2d0) then
tmp = ((1.0d0 + alpha) / (2.0d0 + alpha)) / ((2.0d0 + alpha) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.2) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + alpha)) / Float64(Float64(2.0 + alpha) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.2)
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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, 6.2], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + alpha), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.2:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \alpha}}{\left(2 + \alpha\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.2%
Taylor expanded in beta around 0 99.2%
+-commutative99.2%
Simplified99.2%
if 6.20000000000000018 < beta Initial program 83.9%
Taylor expanded in beta around inf 82.7%
*-un-lft-identity82.7%
associate-/l/82.3%
metadata-eval82.3%
associate-+l+82.3%
metadata-eval82.3%
associate-+r+82.3%
Applied egg-rr82.3%
*-lft-identity82.3%
associate-/r*82.7%
+-commutative82.7%
+-commutative82.7%
Simplified82.7%
Final simplification92.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.7)
(+
0.08333333333333333
(*
beta
(-
(* beta (- (* beta 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.7) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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 <= 1.7d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * ((beta * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.7) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.7: tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.7) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * Float64(Float64(beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.7)
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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, 1.7], N[(0.08333333333333333 + N[(beta * N[(N[(beta * N[(N[(beta * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.7:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot \left(\beta \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 1.69999999999999996Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.4%
+-commutative84.4%
Simplified84.4%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in beta around 0 63.3%
if 1.69999999999999996 < beta Initial program 83.9%
Taylor expanded in beta around inf 82.7%
*-un-lft-identity82.7%
associate-/l/82.3%
metadata-eval82.3%
associate-+l+82.3%
metadata-eval82.3%
associate-+r+82.3%
Applied egg-rr82.3%
*-lft-identity82.3%
associate-/r*82.7%
+-commutative82.7%
+-commutative82.7%
Simplified82.7%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.55)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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 <= 1.55d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.55: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.55) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.55)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.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, 1.55], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.55:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 1.55000000000000004Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.4%
+-commutative84.4%
Simplified84.4%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in beta around 0 63.2%
if 1.55000000000000004 < beta Initial program 83.9%
Taylor expanded in beta around inf 82.7%
*-un-lft-identity82.7%
associate-/l/82.3%
metadata-eval82.3%
associate-+l+82.3%
metadata-eval82.3%
associate-+r+82.3%
Applied egg-rr82.3%
*-lft-identity82.3%
associate-/r*82.7%
+-commutative82.7%
+-commutative82.7%
Simplified82.7%
Final simplification70.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.55)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.55d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.55: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.55) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.55)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.55], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.55:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 1.55000000000000004Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.4%
+-commutative84.4%
Simplified84.4%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in beta around 0 63.2%
if 1.55000000000000004 < beta Initial program 83.9%
Taylor expanded in beta around inf 82.7%
Taylor expanded in alpha around 0 82.5%
+-commutative82.5%
Simplified82.5%
Final simplification70.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.55)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ 1.0 beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} 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 <= 1.55d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 0.027777777777777776d0))
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 <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.55: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776)) else: tmp = (1.0 / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.55) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(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 <= 1.55)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
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, 1.55], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.55:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 1.55000000000000004Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.4%
+-commutative84.4%
Simplified84.4%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in beta around 0 63.2%
if 1.55000000000000004 < beta Initial program 83.9%
Taylor expanded in beta around inf 82.7%
Taylor expanded in alpha around 0 75.8%
associate-/r*76.2%
Simplified76.2%
Final simplification68.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = (1.0 / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(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 <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.4%
+-commutative84.4%
Simplified84.4%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in beta around 0 63.1%
if 2.5 < beta Initial program 83.9%
Taylor expanded in beta around inf 82.7%
Taylor expanded in alpha around 0 75.8%
associate-/r*76.2%
Simplified76.2%
Final simplification68.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.4%
+-commutative84.4%
Simplified84.4%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in beta around 0 63.1%
if 2.5 < beta Initial program 83.9%
Taylor expanded in beta around inf 82.7%
Taylor expanded in alpha around 0 75.8%
Final simplification68.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.16666666666666666 / 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.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 0.16666666666666666 / 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.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.4%
+-commutative84.4%
Simplified84.4%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in beta around 0 63.1%
if 2.5 < beta Initial program 83.9%
associate-/l/81.5%
+-commutative81.5%
associate-+l+81.5%
*-commutative81.5%
metadata-eval81.5%
associate-+l+81.5%
metadata-eval81.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
metadata-eval81.5%
metadata-eval81.5%
associate-+l+81.5%
Simplified81.5%
Taylor expanded in beta around 0 68.0%
Taylor expanded in alpha around 0 62.1%
associate-/r*62.1%
Simplified62.1%
Taylor expanded in beta around 0 7.3%
Taylor expanded in beta around inf 7.3%
Final simplification41.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) 0.08333333333333333 (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / 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.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = 0.08333333333333333; else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333;
else
tmp = 0.16666666666666666 / 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.0], 0.08333333333333333, N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.4%
+-commutative84.4%
Simplified84.4%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in beta around 0 62.7%
if 2 < beta Initial program 83.9%
associate-/l/81.5%
+-commutative81.5%
associate-+l+81.5%
*-commutative81.5%
metadata-eval81.5%
associate-+l+81.5%
metadata-eval81.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
metadata-eval81.5%
metadata-eval81.5%
associate-+l+81.5%
Simplified81.5%
Taylor expanded in beta around 0 68.0%
Taylor expanded in alpha around 0 62.1%
associate-/r*62.1%
Simplified62.1%
Taylor expanded in beta around 0 7.3%
Taylor expanded in beta around inf 7.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (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 = 0.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 93.7%
associate-/l/92.8%
+-commutative92.8%
associate-+l+92.8%
*-commutative92.8%
metadata-eval92.8%
associate-+l+92.8%
metadata-eval92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
metadata-eval92.8%
metadata-eval92.8%
associate-+l+92.8%
Simplified92.8%
Taylor expanded in beta around 0 87.1%
Taylor expanded in alpha around 0 62.5%
associate-/r*62.5%
Simplified62.5%
Taylor expanded in beta around 0 41.5%
Final simplification41.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (beta + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 93.7%
associate-/l/92.8%
+-commutative92.8%
associate-+l+92.8%
*-commutative92.8%
metadata-eval92.8%
associate-+l+92.8%
metadata-eval92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
metadata-eval92.8%
metadata-eval92.8%
associate-+l+92.8%
Simplified92.8%
Taylor expanded in beta around 0 87.1%
Taylor expanded in alpha around 0 62.5%
associate-/r*62.5%
Simplified62.5%
Taylor expanded in beta around 0 41.3%
*-un-lft-identity41.3%
associate-/l/41.6%
+-commutative41.6%
Applied egg-rr41.6%
*-lft-identity41.6%
associate-/r*41.3%
metadata-eval41.3%
+-commutative41.3%
Simplified41.3%
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 93.7%
associate-/l/92.8%
+-commutative92.8%
associate-+l+92.8%
*-commutative92.8%
metadata-eval92.8%
associate-+l+92.8%
metadata-eval92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
metadata-eval92.8%
metadata-eval92.8%
associate-+l+92.8%
Simplified92.8%
Taylor expanded in alpha around 0 84.2%
+-commutative84.2%
Simplified84.2%
Taylor expanded in alpha around 0 69.0%
Taylor expanded in beta around 0 40.0%
herbie shell --seed 2024172
(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)))