
(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 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 72000000000000.0)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_0 t_1)))
(/
(* (- -1.0 alpha) (/ (- -1.0 (/ (- -1.0 alpha) beta)) t_0))
(+ 2.0 (+ beta alpha))))))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 <= 72000000000000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((-1.0 - alpha) * ((-1.0 - ((-1.0 - alpha) / beta)) / t_0)) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 72000000000000.0d0) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_0 * t_1))
else
tmp = (((-1.0d0) - alpha) * (((-1.0d0) - (((-1.0d0) - alpha) / beta)) / t_0)) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 72000000000000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((-1.0 - alpha) * ((-1.0 - ((-1.0 - alpha) / beta)) / t_0)) / (2.0 + (beta + alpha));
}
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 <= 72000000000000.0: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1)) else: tmp = ((-1.0 - alpha) * ((-1.0 - ((-1.0 - alpha) / beta)) / t_0)) / (2.0 + (beta + alpha)) 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 <= 72000000000000.0) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_0 * t_1))); else tmp = Float64(Float64(Float64(-1.0 - alpha) * Float64(Float64(-1.0 - Float64(Float64(-1.0 - alpha) / beta)) / t_0)) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 72000000000000.0)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
else
tmp = ((-1.0 - alpha) * ((-1.0 - ((-1.0 - alpha) / beta)) / t_0)) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 72000000000000.0], 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[(-1.0 - alpha), $MachinePrecision] * N[(N[(-1.0 - N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 72000000000000:\\
\;\;\;\;\frac{1 + \alpha}{t_1} \cdot \frac{1 + \beta}{t_0 \cdot t_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-1 - \alpha\right) \cdot \frac{-1 - \frac{-1 - \alpha}{\beta}}{t_0}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 7.2e13Initial program 99.8%
Simplified99.7%
if 7.2e13 < beta Initial program 77.9%
Simplified92.7%
clear-num92.7%
associate-+r+92.7%
*-commutative92.7%
frac-times85.4%
*-un-lft-identity85.4%
+-commutative85.4%
*-commutative85.4%
associate-+r+85.4%
Applied egg-rr85.4%
associate-/r*92.7%
associate-/l*77.3%
associate-*l/92.7%
*-commutative92.7%
times-frac99.7%
associate-/r*92.7%
*-commutative92.7%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*r/99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in beta around inf 74.7%
mul-1-neg74.7%
unsub-neg74.7%
Simplified74.7%
Final simplification92.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 3.6)
(/ (+ 1.0 alpha) (* t_0 (* (+ alpha 3.0) (+ 2.0 alpha))))
(*
(/ (+ 1.0 alpha) t_0)
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ alpha (+ beta 3.0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.6) {
tmp = (1.0 + alpha) / (t_0 * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 + ((-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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 3.6d0) then
tmp = (1.0d0 + alpha) / (t_0 * ((alpha + 3.0d0) * (2.0d0 + alpha)))
else
tmp = ((1.0d0 + alpha) / t_0) * ((1.0d0 + (((-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 t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.6) {
tmp = (1.0 + alpha) / (t_0 * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 3.6: tmp = (1.0 + alpha) / (t_0 * ((alpha + 3.0) * (2.0 + alpha))) else: tmp = ((1.0 + alpha) / t_0) * ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3.6) tmp = Float64(Float64(1.0 + alpha) / Float64(t_0 * Float64(Float64(alpha + 3.0) * Float64(2.0 + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 + 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)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 3.6)
tmp = (1.0 + alpha) / (t_0 * ((alpha + 3.0) * (2.0 + alpha)));
else
tmp = ((1.0 + alpha) / t_0) * ((1.0 + ((-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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.6], N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + 3.0), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 3.6:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot \left(\left(\alpha + 3\right) \cdot \left(2 + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t_0} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.9%
Simplified99.7%
*-commutative99.7%
clear-num99.7%
frac-times92.5%
*-un-lft-identity92.5%
+-commutative92.5%
Applied egg-rr92.5%
Taylor expanded in beta around 0 90.6%
+-commutative90.6%
+-commutative90.6%
Simplified90.6%
if 3.60000000000000009 < beta Initial program 78.1%
Simplified92.8%
clear-num92.7%
associate-+r+92.7%
*-commutative92.7%
frac-times85.6%
*-un-lft-identity85.6%
+-commutative85.6%
*-commutative85.6%
associate-+r+85.6%
Applied egg-rr85.6%
associate-/r*92.8%
associate-/l*77.6%
associate-*l/92.8%
*-commutative92.8%
times-frac99.7%
associate-/r*92.8%
*-commutative92.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 73.6%
associate-*r/73.6%
distribute-lft-in73.6%
metadata-eval73.6%
neg-mul-173.6%
unsub-neg73.6%
Simplified73.6%
Final simplification85.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.35)
(/ (+ 1.0 alpha) (* (+ alpha (+ beta 2.0)) (* (+ alpha 3.0) (+ 2.0 alpha))))
(/
(*
(- -1.0 alpha)
(/ (- -1.0 (/ (- -1.0 alpha) beta)) (+ alpha (+ beta 3.0))))
(+ 2.0 (+ beta alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.35) {
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((-1.0 - alpha) * ((-1.0 - ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.35d0) then
tmp = (1.0d0 + alpha) / ((alpha + (beta + 2.0d0)) * ((alpha + 3.0d0) * (2.0d0 + alpha)))
else
tmp = (((-1.0d0) - alpha) * (((-1.0d0) - (((-1.0d0) - alpha) / beta)) / (alpha + (beta + 3.0d0)))) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.35) {
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((-1.0 - alpha) * ((-1.0 - ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.35: tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha))) else: tmp = ((-1.0 - alpha) * ((-1.0 - ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.35) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(alpha + 3.0) * Float64(2.0 + alpha)))); else tmp = Float64(Float64(Float64(-1.0 - alpha) * Float64(Float64(-1.0 - Float64(Float64(-1.0 - alpha) / beta)) / Float64(alpha + Float64(beta + 3.0)))) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.35)
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha)));
else
tmp = ((-1.0 - alpha) * ((-1.0 - ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.35], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 - alpha), $MachinePrecision] * N[(N[(-1.0 - N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.35:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\alpha + 3\right) \cdot \left(2 + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-1 - \alpha\right) \cdot \frac{-1 - \frac{-1 - \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 3.35000000000000009Initial program 99.9%
Simplified99.7%
*-commutative99.7%
clear-num99.7%
frac-times92.5%
*-un-lft-identity92.5%
+-commutative92.5%
Applied egg-rr92.5%
Taylor expanded in beta around 0 90.6%
+-commutative90.6%
+-commutative90.6%
Simplified90.6%
if 3.35000000000000009 < beta Initial program 78.1%
Simplified92.8%
clear-num92.7%
associate-+r+92.7%
*-commutative92.7%
frac-times85.6%
*-un-lft-identity85.6%
+-commutative85.6%
*-commutative85.6%
associate-+r+85.6%
Applied egg-rr85.6%
associate-/r*92.8%
associate-/l*77.6%
associate-*l/92.8%
*-commutative92.8%
times-frac99.7%
associate-/r*92.8%
*-commutative92.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*r/99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in beta around inf 73.7%
mul-1-neg73.7%
unsub-neg73.7%
Simplified73.7%
Final simplification85.5%
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)))) (/ (* (/ (/ (+ 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 = 2.0 + (beta + alpha);
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 = 2.0d0 + (beta + alpha)
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 = 2.0 + (beta + alpha);
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 = 2.0 + (beta + alpha) 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(2.0 + Float64(beta + alpha)) return Float64(Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0))) * Float64(1.0 + alpha)) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\frac{\frac{\frac{1 + \beta}{t_0}}{\alpha + \left(\beta + 3\right)} \cdot \left(1 + \alpha\right)}{t_0}
\end{array}
\end{array}
Initial program 93.3%
Simplified97.6%
clear-num97.6%
associate-+r+97.6%
*-commutative97.6%
frac-times95.4%
*-un-lft-identity95.4%
+-commutative95.4%
*-commutative95.4%
associate-+r+95.4%
Applied egg-rr95.4%
associate-/r*97.6%
associate-/l*93.1%
associate-*l/97.6%
*-commutative97.6%
times-frac99.8%
associate-/r*97.6%
*-commutative97.6%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.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 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 93.3%
Simplified97.6%
clear-num97.6%
associate-+r+97.6%
*-commutative97.6%
frac-times95.4%
*-un-lft-identity95.4%
+-commutative95.4%
*-commutative95.4%
associate-+r+95.4%
Applied egg-rr95.4%
associate-/r*97.6%
associate-/l*93.1%
associate-*l/97.6%
*-commutative97.6%
times-frac99.8%
associate-/r*97.6%
*-commutative97.6%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 7.2)
(/ (+ 1.0 alpha) (* (+ alpha (+ beta 2.0)) (* (+ alpha 3.0) (+ 2.0 alpha))))
(/
(* (+ 1.0 alpha) (/ (- 1.0 (/ alpha beta)) (+ alpha (+ beta 3.0))))
(+ 2.0 (+ beta alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.2) {
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((1.0 + alpha) * ((1.0 - (alpha / beta)) / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.2d0) then
tmp = (1.0d0 + alpha) / ((alpha + (beta + 2.0d0)) * ((alpha + 3.0d0) * (2.0d0 + alpha)))
else
tmp = ((1.0d0 + alpha) * ((1.0d0 - (alpha / beta)) / (alpha + (beta + 3.0d0)))) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.2) {
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((1.0 + alpha) * ((1.0 - (alpha / beta)) / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.2: tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha))) else: tmp = ((1.0 + alpha) * ((1.0 - (alpha / beta)) / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.2) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(alpha + 3.0) * Float64(2.0 + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(1.0 - Float64(alpha / beta)) / Float64(alpha + Float64(beta + 3.0)))) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.2)
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha)));
else
tmp = ((1.0 + alpha) * ((1.0 - (alpha / beta)) / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.2], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(1.0 - N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.2:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\alpha + 3\right) \cdot \left(2 + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1 - \frac{\alpha}{\beta}}{\alpha + \left(\beta + 3\right)}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 7.20000000000000018Initial program 99.9%
Simplified99.7%
*-commutative99.7%
clear-num99.7%
frac-times92.5%
*-un-lft-identity92.5%
+-commutative92.5%
Applied egg-rr92.5%
Taylor expanded in beta around 0 90.6%
+-commutative90.6%
+-commutative90.6%
Simplified90.6%
if 7.20000000000000018 < beta Initial program 78.1%
Simplified92.8%
clear-num92.7%
associate-+r+92.7%
*-commutative92.7%
frac-times85.6%
*-un-lft-identity85.6%
+-commutative85.6%
*-commutative85.6%
associate-+r+85.6%
Applied egg-rr85.6%
associate-/r*92.8%
associate-/l*77.6%
associate-*l/92.8%
*-commutative92.8%
times-frac99.7%
associate-/r*92.8%
*-commutative92.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*r/99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in beta around inf 73.7%
mul-1-neg73.7%
unsub-neg73.7%
Simplified73.7%
Taylor expanded in alpha around inf 73.7%
Final simplification85.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 3.35)
(/ (+ 1.0 alpha) (* t_0 (* (+ alpha 3.0) (+ 2.0 alpha))))
(/ (* (+ 1.0 alpha) (/ 1.0 t_0)) (+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.35) {
tmp = (1.0 + alpha) / (t_0 * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((1.0 + alpha) * (1.0 / t_0)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 3.35d0) then
tmp = (1.0d0 + alpha) / (t_0 * ((alpha + 3.0d0) * (2.0d0 + alpha)))
else
tmp = ((1.0d0 + alpha) * (1.0d0 / t_0)) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.35) {
tmp = (1.0 + alpha) / (t_0 * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((1.0 + alpha) * (1.0 / t_0)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 3.35: tmp = (1.0 + alpha) / (t_0 * ((alpha + 3.0) * (2.0 + alpha))) else: tmp = ((1.0 + alpha) * (1.0 / t_0)) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3.35) tmp = Float64(Float64(1.0 + alpha) / Float64(t_0 * Float64(Float64(alpha + 3.0) * Float64(2.0 + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / t_0)) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 3.35)
tmp = (1.0 + alpha) / (t_0 * ((alpha + 3.0) * (2.0 + alpha)));
else
tmp = ((1.0 + alpha) * (1.0 / t_0)) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.35], N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + 3.0), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 3.35:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot \left(\left(\alpha + 3\right) \cdot \left(2 + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{t_0}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 3.35000000000000009Initial program 99.9%
Simplified99.7%
*-commutative99.7%
clear-num99.7%
frac-times92.5%
*-un-lft-identity92.5%
+-commutative92.5%
Applied egg-rr92.5%
Taylor expanded in beta around 0 90.6%
+-commutative90.6%
+-commutative90.6%
Simplified90.6%
if 3.35000000000000009 < beta Initial program 78.1%
div-inv78.1%
+-commutative78.1%
*-commutative78.1%
associate-+r+78.1%
+-commutative78.1%
associate-+r+78.1%
+-commutative78.1%
+-commutative78.1%
*-commutative78.1%
fma-def78.1%
metadata-eval78.1%
associate-+r+78.1%
metadata-eval78.1%
associate-+r+78.1%
Applied egg-rr78.1%
Taylor expanded in beta around inf 74.9%
Final simplification85.8%
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 1.7)
(/ (+ 0.16666666666666666 (* beta 0.027777777777777776)) t_0)
(/ (* (+ 1.0 alpha) (/ 1.0 (+ 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 <= 1.7) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / t_0;
} else {
tmp = ((1.0 + alpha) * (1.0 / (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 <= 1.7d0) then
tmp = (0.16666666666666666d0 + (beta * 0.027777777777777776d0)) / t_0
else
tmp = ((1.0d0 + alpha) * (1.0d0 / (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 <= 1.7) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / t_0;
} else {
tmp = ((1.0 + alpha) * (1.0 / (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 <= 1.7: tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / t_0 else: tmp = ((1.0 + alpha) * (1.0 / (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 <= 1.7) tmp = Float64(Float64(0.16666666666666666 + Float64(beta * 0.027777777777777776)) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / 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 <= 1.7)
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / t_0;
else
tmp = ((1.0 + alpha) * (1.0 / (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, 1.7], N[(N[(0.16666666666666666 + N[(beta * 0.027777777777777776), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 1.7:\\
\;\;\;\;\frac{0.16666666666666666 + \beta \cdot 0.027777777777777776}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\alpha + \left(\beta + 3\right)}}{t_0}\\
\end{array}
\end{array}
if beta < 1.69999999999999996Initial program 99.9%
Simplified99.7%
clear-num99.6%
associate-+r+99.6%
*-commutative99.6%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
associate-/r*99.7%
associate-/l*99.7%
associate-*l/99.7%
*-commutative99.7%
times-frac99.8%
associate-/r*99.7%
*-commutative99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 64.8%
Taylor expanded in beta around 0 64.5%
*-commutative64.5%
Simplified64.5%
if 1.69999999999999996 < beta Initial program 78.1%
Simplified92.8%
clear-num92.7%
associate-+r+92.7%
*-commutative92.7%
frac-times85.6%
*-un-lft-identity85.6%
+-commutative85.6%
*-commutative85.6%
associate-+r+85.6%
Applied egg-rr85.6%
associate-/r*92.8%
associate-/l*77.6%
associate-*l/92.8%
*-commutative92.8%
times-frac99.7%
associate-/r*92.8%
*-commutative92.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*r/99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in beta around inf 74.9%
Final simplification67.6%
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) (* (+ alpha (+ beta 2.0)) (* (+ alpha 3.0) (+ 2.0 alpha))))
(/
(* (+ 1.0 alpha) (/ 1.0 (+ alpha (+ beta 3.0))))
(+ 2.0 (+ beta alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.2d0) then
tmp = (1.0d0 + alpha) / ((alpha + (beta + 2.0d0)) * ((alpha + 3.0d0) * (2.0d0 + alpha)))
else
tmp = ((1.0d0 + alpha) * (1.0d0 / (alpha + (beta + 3.0d0)))) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha))) else: tmp = ((1.0 + alpha) * (1.0 / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.2) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(alpha + 3.0) * Float64(2.0 + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(alpha + Float64(beta + 3.0)))) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.2)
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 3.0) * (2.0 + alpha)));
else
tmp = ((1.0 + alpha) * (1.0 / (alpha + (beta + 3.0)))) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.2], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.2:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\alpha + 3\right) \cdot \left(2 + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\alpha + \left(\beta + 3\right)}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.9%
Simplified99.7%
*-commutative99.7%
clear-num99.7%
frac-times92.5%
*-un-lft-identity92.5%
+-commutative92.5%
Applied egg-rr92.5%
Taylor expanded in beta around 0 90.6%
+-commutative90.6%
+-commutative90.6%
Simplified90.6%
if 6.20000000000000018 < beta Initial program 78.1%
Simplified92.8%
clear-num92.7%
associate-+r+92.7%
*-commutative92.7%
frac-times85.6%
*-un-lft-identity85.6%
+-commutative85.6%
*-commutative85.6%
associate-+r+85.6%
Applied egg-rr85.6%
associate-/r*92.8%
associate-/l*77.6%
associate-*l/92.8%
*-commutative92.8%
times-frac99.7%
associate-/r*92.8%
*-commutative92.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*r/99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in beta around inf 74.9%
Final simplification85.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.2)
(/
(+ 0.16666666666666666 (* beta 0.027777777777777776))
(+ 2.0 (+ beta alpha)))
(* (/ (- -1.0 alpha) beta) (/ -1.0 beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha));
} 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 <= 6.2d0) then
tmp = (0.16666666666666666d0 + (beta * 0.027777777777777776d0)) / (2.0d0 + (beta + alpha))
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 <= 6.2) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha));
} else {
tmp = ((-1.0 - alpha) / beta) * (-1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha)) 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 <= 6.2) tmp = Float64(Float64(0.16666666666666666 + Float64(beta * 0.027777777777777776)) / Float64(2.0 + Float64(beta + alpha))); 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 <= 6.2)
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha));
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, 6.2], N[(N[(0.16666666666666666 + N[(beta * 0.027777777777777776), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $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 6.2:\\
\;\;\;\;\frac{0.16666666666666666 + \beta \cdot 0.027777777777777776}{2 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1 - \alpha}{\beta} \cdot \frac{-1}{\beta}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.9%
Simplified99.7%
clear-num99.6%
associate-+r+99.6%
*-commutative99.6%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
associate-/r*99.7%
associate-/l*99.7%
associate-*l/99.7%
*-commutative99.7%
times-frac99.8%
associate-/r*99.7%
*-commutative99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 64.8%
Taylor expanded in beta around 0 64.5%
*-commutative64.5%
Simplified64.5%
if 6.20000000000000018 < beta Initial program 78.1%
Simplified92.8%
Taylor expanded in beta around inf 74.1%
Taylor expanded in beta around inf 73.8%
Final simplification67.3%
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 4.2)
(/ (+ 0.16666666666666666 (* beta 0.027777777777777776)) t_0)
(/ (/ (+ 1.0 alpha) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 4.2) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / 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 = 2.0d0 + (beta + alpha)
if (beta <= 4.2d0) then
tmp = (0.16666666666666666d0 + (beta * 0.027777777777777776d0)) / 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 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 4.2) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / t_0;
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 4.2: tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / t_0 else: tmp = ((1.0 + alpha) / beta) / 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 <= 4.2) tmp = Float64(Float64(0.16666666666666666 + Float64(beta * 0.027777777777777776)) / 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 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 4.2)
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / 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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.2], N[(N[(0.16666666666666666 + N[(beta * 0.027777777777777776), $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 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 4.2:\\
\;\;\;\;\frac{0.16666666666666666 + \beta \cdot 0.027777777777777776}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t_0}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.9%
Simplified99.7%
clear-num99.6%
associate-+r+99.6%
*-commutative99.6%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
associate-/r*99.7%
associate-/l*99.7%
associate-*l/99.7%
*-commutative99.7%
times-frac99.8%
associate-/r*99.7%
*-commutative99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 64.8%
Taylor expanded in beta around 0 64.5%
*-commutative64.5%
Simplified64.5%
if 4.20000000000000018 < beta Initial program 78.1%
Simplified92.8%
Taylor expanded in beta around inf 74.1%
associate-*l/74.2%
+-commutative74.2%
associate-+r+74.2%
+-commutative74.2%
+-commutative74.2%
Applied egg-rr74.2%
associate-*r/74.2%
*-rgt-identity74.2%
+-commutative74.2%
Simplified74.2%
Final simplification67.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.5)
(/
(+ 0.16666666666666666 (* beta 0.027777777777777776))
(+ 2.0 (+ beta alpha)))
(/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha));
} 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 <= 3.5d0) then
tmp = (0.16666666666666666d0 + (beta * 0.027777777777777776d0)) / (2.0d0 + (beta + alpha))
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 <= 3.5) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.5: tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha)) 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 <= 3.5) tmp = Float64(Float64(0.16666666666666666 + Float64(beta * 0.027777777777777776)) / Float64(2.0 + Float64(beta + alpha))); 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 <= 3.5)
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha));
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, 3.5], N[(N[(0.16666666666666666 + N[(beta * 0.027777777777777776), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $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 3.5:\\
\;\;\;\;\frac{0.16666666666666666 + \beta \cdot 0.027777777777777776}{2 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.9%
Simplified99.7%
clear-num99.6%
associate-+r+99.6%
*-commutative99.6%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
associate-/r*99.7%
associate-/l*99.7%
associate-*l/99.7%
*-commutative99.7%
times-frac99.8%
associate-/r*99.7%
*-commutative99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 64.8%
Taylor expanded in beta around 0 64.5%
*-commutative64.5%
Simplified64.5%
if 3.5 < beta Initial program 78.1%
Taylor expanded in beta around -inf 74.2%
Taylor expanded in alpha around 0 73.9%
Final simplification67.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.3)
(/
(+ 0.16666666666666666 (* beta 0.027777777777777776))
(+ 2.0 (+ beta alpha)))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha));
} 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.3d0) then
tmp = (0.16666666666666666d0 + (beta * 0.027777777777777776d0)) / (2.0d0 + (beta + alpha))
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.3) {
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha));
} 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.3: tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha)) 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.3) tmp = Float64(Float64(0.16666666666666666 + Float64(beta * 0.027777777777777776)) / Float64(2.0 + Float64(beta + alpha))); 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.3)
tmp = (0.16666666666666666 + (beta * 0.027777777777777776)) / (2.0 + (beta + alpha));
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.3], N[(N[(0.16666666666666666 + N[(beta * 0.027777777777777776), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $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.3:\\
\;\;\;\;\frac{0.16666666666666666 + \beta \cdot 0.027777777777777776}{2 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.9%
Simplified99.7%
clear-num99.6%
associate-+r+99.6%
*-commutative99.6%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
associate-/r*99.7%
associate-/l*99.7%
associate-*l/99.7%
*-commutative99.7%
times-frac99.8%
associate-/r*99.7%
*-commutative99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 64.8%
Taylor expanded in beta around 0 64.5%
*-commutative64.5%
Simplified64.5%
if 3.2999999999999998 < beta Initial program 78.1%
Taylor expanded in beta around -inf 74.2%
Taylor expanded in alpha around 0 74.2%
+-commutative74.2%
associate-+r+74.2%
+-commutative74.2%
Simplified74.2%
Final simplification67.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.2) (/ 0.16666666666666666 (+ 2.0 (+ beta alpha))) (* (/ (- -1.0 alpha) beta) (/ -1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.2) {
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
} 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 <= 8.2d0) then
tmp = 0.16666666666666666d0 / (2.0d0 + (beta + alpha))
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 <= 8.2) {
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
} else {
tmp = ((-1.0 - alpha) / beta) * (-1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.2: tmp = 0.16666666666666666 / (2.0 + (beta + alpha)) 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 <= 8.2) tmp = Float64(0.16666666666666666 / Float64(2.0 + Float64(beta + alpha))); 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 <= 8.2)
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
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, 8.2], N[(0.16666666666666666 / N[(2.0 + N[(beta + alpha), $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 8.2:\\
\;\;\;\;\frac{0.16666666666666666}{2 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1 - \alpha}{\beta} \cdot \frac{-1}{\beta}\\
\end{array}
\end{array}
if beta < 8.1999999999999993Initial program 99.9%
Simplified99.7%
clear-num99.6%
associate-+r+99.6%
*-commutative99.6%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
associate-/r*99.7%
associate-/l*99.7%
associate-*l/99.7%
*-commutative99.7%
times-frac99.8%
associate-/r*99.7%
*-commutative99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 64.8%
Taylor expanded in beta around 0 63.7%
if 8.1999999999999993 < beta Initial program 78.1%
Simplified92.8%
Taylor expanded in beta around inf 74.1%
Taylor expanded in beta around inf 73.8%
Final simplification66.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (/ 0.16666666666666666 (+ 2.0 (+ beta alpha))) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
} 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 <= 6.0d0) then
tmp = 0.16666666666666666d0 / (2.0d0 + (beta + alpha))
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 <= 6.0) {
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.16666666666666666 / (2.0 + (beta + alpha)) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(0.16666666666666666 / Float64(2.0 + Float64(beta + alpha))); 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 <= 6.0)
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
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, 6.0], N[(0.16666666666666666 / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $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 6:\\
\;\;\;\;\frac{0.16666666666666666}{2 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
Simplified99.7%
clear-num99.6%
associate-+r+99.6%
*-commutative99.6%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
associate-/r*99.7%
associate-/l*99.7%
associate-*l/99.7%
*-commutative99.7%
times-frac99.8%
associate-/r*99.7%
*-commutative99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 64.8%
Taylor expanded in beta around 0 63.7%
if 6 < beta Initial program 78.1%
Taylor expanded in beta around -inf 74.2%
Taylor expanded in alpha around 0 74.5%
Final simplification67.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.2) (/ 0.16666666666666666 (+ 2.0 (+ beta alpha))) (/ (/ 1.0 beta) (+ beta 2.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.2) {
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
} 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 <= 7.2d0) then
tmp = 0.16666666666666666d0 / (2.0d0 + (beta + alpha))
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 <= 7.2) {
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
} else {
tmp = (1.0 / beta) / (beta + 2.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.2: tmp = 0.16666666666666666 / (2.0 + (beta + alpha)) else: tmp = (1.0 / beta) / (beta + 2.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.2) tmp = Float64(0.16666666666666666 / Float64(2.0 + Float64(beta + alpha))); else tmp = Float64(Float64(1.0 / 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 <= 7.2)
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
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, 7.2], N[(0.16666666666666666 / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.2:\\
\;\;\;\;\frac{0.16666666666666666}{2 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 2}\\
\end{array}
\end{array}
if beta < 7.20000000000000018Initial program 99.9%
Simplified99.7%
clear-num99.6%
associate-+r+99.6%
*-commutative99.6%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
associate-/r*99.7%
associate-/l*99.7%
associate-*l/99.7%
*-commutative99.7%
times-frac99.8%
associate-/r*99.7%
*-commutative99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 64.8%
Taylor expanded in beta around 0 63.7%
if 7.20000000000000018 < beta Initial program 78.1%
Simplified92.8%
Taylor expanded in beta around inf 74.1%
associate-*l/74.2%
+-commutative74.2%
associate-+r+74.2%
+-commutative74.2%
+-commutative74.2%
Applied egg-rr74.2%
Taylor expanded in alpha around 0 74.5%
associate-/r*74.7%
Simplified74.7%
Final simplification67.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ 2.0 (+ beta alpha))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + (beta + alpha));
}
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 / (2.0d0 + (beta + alpha))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + (beta + alpha));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (2.0 + (beta + alpha))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(2.0 + Float64(beta + alpha))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (2.0 + (beta + alpha));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{2 + \left(\beta + \alpha\right)}
\end{array}
Initial program 93.3%
Simplified97.6%
clear-num97.6%
associate-+r+97.6%
*-commutative97.6%
frac-times95.4%
*-un-lft-identity95.4%
+-commutative95.4%
*-commutative95.4%
associate-+r+95.4%
Applied egg-rr95.4%
associate-/r*97.6%
associate-/l*93.1%
associate-*l/97.6%
*-commutative97.6%
times-frac99.8%
associate-/r*97.6%
*-commutative97.6%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 70.0%
Taylor expanded in beta around 0 46.8%
Final simplification46.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ 2.0 alpha)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + alpha);
}
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 / (2.0d0 + alpha)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + alpha);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (2.0 + alpha)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(2.0 + alpha)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (2.0 + alpha);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{2 + \alpha}
\end{array}
Initial program 93.3%
Simplified97.6%
clear-num97.6%
associate-+r+97.6%
*-commutative97.6%
frac-times95.4%
*-un-lft-identity95.4%
+-commutative95.4%
*-commutative95.4%
associate-+r+95.4%
Applied egg-rr95.4%
associate-/r*97.6%
associate-/l*93.1%
associate-*l/97.6%
*-commutative97.6%
times-frac99.8%
associate-/r*97.6%
*-commutative97.6%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 70.0%
Taylor expanded in beta around 0 46.1%
Final simplification46.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.3333333333333333d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\beta}
\end{array}
Initial program 93.3%
Taylor expanded in beta around -inf 24.5%
Taylor expanded in alpha around 0 24.6%
Taylor expanded in beta around 0 4.2%
Final simplification4.2%
herbie shell --seed 2023318
(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)))