
(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 17 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 (+ alpha beta)))) (* (/ (/ (+ 1.0 alpha) t_0) t_0) (/ (+ 1.0 beta) (+ alpha (+ beta 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = 2.0d0 + (alpha + beta)
code = (((1.0d0 + alpha) / t_0) / t_0) * ((1.0d0 + beta) / (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $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 := 2 + \left(\alpha + \beta\right)\\
\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \frac{1 + \beta}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 94.8%
Simplified85.1%
times-frac97.1%
+-commutative97.1%
Applied egg-rr97.1%
associate-*r/97.1%
Applied egg-rr97.1%
times-frac99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.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
(let* ((t_0 (+ 2.0 (+ alpha beta))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 1020000000.0)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* (+ alpha (+ beta 3.0)) t_1)))
(* (/ (/ (+ 1.0 alpha) t_0) t_0) (+ 1.0 (/ (- -2.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 1020000000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_1));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
t_1 = alpha + (2.0d0 + beta)
if (beta <= 1020000000.0d0) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / ((alpha + (beta + 3.0d0)) * t_1))
else
tmp = (((1.0d0 + alpha) / t_0) / t_0) * (1.0d0 + (((-2.0d0) - alpha) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 1020000000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_1));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) t_1 = alpha + (2.0 + beta) tmp = 0 if beta <= 1020000000.0: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_1)) else: tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 1020000000.0) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_1))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(1.0 + Float64(Float64(-2.0 - alpha) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 1020000000.0)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_1));
else
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta));
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[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1020000000.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 + N[(N[(-2.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 1020000000:\\
\;\;\;\;\frac{1 + \alpha}{t\_1} \cdot \frac{1 + \beta}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \left(1 + \frac{-2 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 1.02e9Initial program 99.8%
Simplified94.5%
times-frac99.6%
+-commutative99.6%
Applied egg-rr99.6%
if 1.02e9 < beta Initial program 83.2%
Simplified63.1%
times-frac91.3%
+-commutative91.3%
Applied egg-rr91.3%
associate-*r/91.3%
Applied egg-rr91.3%
times-frac99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 84.9%
associate-*r/84.9%
distribute-lft-in84.9%
metadata-eval84.9%
neg-mul-184.9%
Simplified84.9%
Final simplification95.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 15.5)
(/
(/ (+ 1.0 alpha) (+ alpha 2.0))
(* (+ alpha 2.0) (+ 3.0 (+ alpha beta))))
(* (/ (/ (+ 1.0 alpha) t_0) t_0) (+ 1.0 (/ (- -2.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 15.5) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
if (beta <= 15.5d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = (((1.0d0 + alpha) / t_0) / t_0) * (1.0d0 + (((-2.0d0) - alpha) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 15.5) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 15.5: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta))) else: tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 15.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(1.0 + Float64(Float64(-2.0 - alpha) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 15.5)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
else
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 + ((-2.0 - alpha) / beta));
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[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 15.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 + N[(N[(-2.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 15.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \left(1 + \frac{-2 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 15.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.2%
Taylor expanded in beta around 0 99.0%
if 15.5 < beta Initial program 83.8%
Simplified64.5%
times-frac91.6%
+-commutative91.6%
Applied egg-rr91.6%
associate-*r/91.6%
Applied egg-rr91.6%
times-frac99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 83.6%
associate-*r/83.6%
distribute-lft-in83.6%
metadata-eval83.6%
neg-mul-183.6%
Simplified83.6%
Final simplification94.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.8)
(/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 2.0) (+ 3.0 (+ alpha beta))))
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.8) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.8d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.8) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.8: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta))) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.8) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.8)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.8], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.8:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.79999999999999982Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.2%
Taylor expanded in beta around 0 99.0%
if 6.79999999999999982 < beta Initial program 83.8%
Simplified64.5%
times-frac91.6%
+-commutative91.6%
Applied egg-rr91.6%
Taylor expanded in beta around inf 83.2%
mul-1-neg83.2%
Simplified83.2%
Final simplification94.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 3.8e+15)
(/ (+ 1.0 beta) (* (+ alpha (+ 2.0 beta)) (* (+ beta 3.0) (+ 2.0 beta))))
(* (/ (/ (+ 1.0 alpha) t_0) t_0) (/ (+ 1.0 beta) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 3.8e+15) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((beta + 3.0) * (2.0 + beta)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
if (beta <= 3.8d+15) then
tmp = (1.0d0 + beta) / ((alpha + (2.0d0 + beta)) * ((beta + 3.0d0) * (2.0d0 + beta)))
else
tmp = (((1.0d0 + alpha) / t_0) / t_0) * ((1.0d0 + beta) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 3.8e+15) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((beta + 3.0) * (2.0 + beta)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 3.8e+15: tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((beta + 3.0) * (2.0 + beta))) else: tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 3.8e+15) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(Float64(beta + 3.0) * Float64(2.0 + beta)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 3.8e+15)
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((beta + 3.0) * (2.0 + beta)));
else
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.8e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 3.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\left(\beta + 3\right) \cdot \left(2 + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \frac{1 + \beta}{\beta}\\
\end{array}
\end{array}
if beta < 3.8e15Initial program 99.8%
Simplified94.5%
Taylor expanded in alpha around 0 83.8%
Taylor expanded in alpha around 0 71.5%
+-commutative71.5%
+-commutative71.5%
Simplified71.5%
if 3.8e15 < beta Initial program 83.2%
Simplified63.1%
times-frac91.3%
+-commutative91.3%
Applied egg-rr91.3%
associate-*r/91.3%
Applied egg-rr91.3%
times-frac99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 85.1%
Final simplification75.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3e+17) (/ (+ 1.0 beta) (* (+ alpha (+ 2.0 beta)) (* (+ beta 3.0) (+ 2.0 beta)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+17) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((beta + 3.0) * (2.0 + beta)));
} 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 <= 3d+17) then
tmp = (1.0d0 + beta) / ((alpha + (2.0d0 + beta)) * ((beta + 3.0d0) * (2.0d0 + beta)))
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 <= 3e+17) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((beta + 3.0) * (2.0 + beta)));
} 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 <= 3e+17: tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((beta + 3.0) * (2.0 + beta))) 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 <= 3e+17) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(Float64(beta + 3.0) * Float64(2.0 + beta)))); 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 <= 3e+17)
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((beta + 3.0) * (2.0 + beta)));
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, 3e+17], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $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 \cdot 10^{+17}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\left(\beta + 3\right) \cdot \left(2 + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3e17Initial program 99.8%
Simplified94.5%
Taylor expanded in alpha around 0 83.8%
Taylor expanded in alpha around 0 71.5%
+-commutative71.5%
+-commutative71.5%
Simplified71.5%
if 3e17 < beta Initial program 83.2%
Taylor expanded in beta around inf 84.6%
div-inv84.5%
+-commutative84.5%
metadata-eval84.5%
associate-+l+84.5%
metadata-eval84.5%
associate-+r+84.5%
Applied egg-rr84.5%
associate-*r/84.6%
*-commutative84.6%
*-lft-identity84.6%
+-commutative84.6%
+-commutative84.6%
+-commutative84.6%
+-commutative84.6%
Simplified84.6%
Final simplification75.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 26.0) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 26.0) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 26.0d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 26.0) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 26.0: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 26.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 26.0)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 26.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 26:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 26Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.2%
Taylor expanded in beta around 0 98.2%
if 26 < beta Initial program 83.8%
Taylor expanded in beta around inf 82.6%
div-inv82.5%
+-commutative82.5%
metadata-eval82.5%
associate-+l+82.5%
metadata-eval82.5%
associate-+r+82.5%
Applied egg-rr82.5%
associate-*r/82.6%
*-commutative82.6%
*-lft-identity82.6%
+-commutative82.6%
+-commutative82.6%
+-commutative82.6%
+-commutative82.6%
Simplified82.6%
Final simplification93.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 1.0 (* (+ 2.0 (+ alpha beta)) (+ (* 2.0 beta) 6.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 1.0 / ((2.0 + (alpha + beta)) * ((2.0 * beta) + 6.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = 1.0d0 / ((2.0d0 + (alpha + beta)) * ((2.0d0 * beta) + 6.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 1.0 / ((2.0 + (alpha + beta)) * ((2.0 * beta) + 6.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 1.0 / ((2.0 + (alpha + beta)) * ((2.0 * beta) + 6.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(1.0 / Float64(Float64(2.0 + Float64(alpha + beta)) * Float64(Float64(2.0 * beta) + 6.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 1.0 / ((2.0 + (alpha + beta)) * ((2.0 * beta) + 6.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(1.0 / N[(N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * beta), $MachinePrecision] + 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{1}{\left(2 + \left(\alpha + \beta\right)\right) \cdot \left(2 \cdot \beta + 6\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.2%
clear-num98.2%
inv-pow98.2%
*-commutative98.2%
associate-+r+98.2%
+-commutative98.2%
+-commutative98.2%
Applied egg-rr98.2%
unpow-198.2%
associate-/l*98.2%
associate-+r+98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
Simplified98.2%
Taylor expanded in alpha around 0 70.1%
distribute-lft-in70.1%
metadata-eval70.1%
+-commutative70.1%
*-commutative70.1%
Simplified70.1%
if 4.5 < beta Initial program 83.8%
Taylor expanded in beta around inf 82.6%
div-inv82.5%
+-commutative82.5%
metadata-eval82.5%
associate-+l+82.5%
metadata-eval82.5%
associate-+r+82.5%
Applied egg-rr82.5%
associate-*r/82.6%
*-commutative82.6%
*-lft-identity82.6%
+-commutative82.6%
+-commutative82.6%
+-commutative82.6%
+-commutative82.6%
Simplified82.6%
Final simplification74.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 8.0)
(/ 0.5 (* (+ beta 3.0) (+ 2.0 beta)))
(if (<= beta 4.8e+157)
(/ (+ 1.0 alpha) (* beta beta))
(/ (/ alpha beta) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = 0.5 / ((beta + 3.0) * (2.0 + beta));
} else if (beta <= 4.8e+157) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (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 <= 8.0d0) then
tmp = 0.5d0 / ((beta + 3.0d0) * (2.0d0 + beta))
else if (beta <= 4.8d+157) then
tmp = (1.0d0 + alpha) / (beta * beta)
else
tmp = (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 <= 8.0) {
tmp = 0.5 / ((beta + 3.0) * (2.0 + beta));
} else if (beta <= 4.8e+157) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (alpha / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.0: tmp = 0.5 / ((beta + 3.0) * (2.0 + beta)) elif beta <= 4.8e+157: tmp = (1.0 + alpha) / (beta * beta) else: tmp = (alpha / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.0) tmp = Float64(0.5 / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))); elseif (beta <= 4.8e+157) tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); else tmp = Float64(Float64(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 <= 8.0)
tmp = 0.5 / ((beta + 3.0) * (2.0 + beta));
elseif (beta <= 4.8e+157)
tmp = (1.0 + alpha) / (beta * beta);
else
tmp = (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, 8.0], N[(0.5 / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 4.8e+157], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8:\\
\;\;\;\;\frac{0.5}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{elif}\;\beta \leq 4.8 \cdot 10^{+157}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 8Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 69.2%
+-commutative69.2%
+-commutative69.2%
Simplified69.2%
if 8 < beta < 4.7999999999999999e157Initial program 88.7%
Taylor expanded in beta around inf 75.3%
*-un-lft-identity75.3%
associate-/l/83.7%
+-commutative83.7%
metadata-eval83.7%
associate-+l+83.7%
metadata-eval83.7%
associate-+r+83.7%
Applied egg-rr83.7%
*-lft-identity83.7%
+-commutative83.7%
*-commutative83.7%
+-commutative83.7%
+-commutative83.7%
+-commutative83.7%
Simplified83.7%
Taylor expanded in beta around inf 74.9%
if 4.7999999999999999e157 < beta Initial program 77.5%
Taylor expanded in beta around inf 92.1%
Taylor expanded in alpha around 0 92.0%
+-commutative92.0%
Simplified92.0%
Taylor expanded in alpha around inf 86.7%
associate-/r*90.6%
+-commutative90.6%
Simplified90.6%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.5 (* (+ beta 3.0) (+ 2.0 beta))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.5 / ((beta + 3.0) * (2.0 + beta));
} 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 <= 4.5d0) then
tmp = 0.5d0 / ((beta + 3.0d0) * (2.0d0 + beta))
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 <= 4.5) {
tmp = 0.5 / ((beta + 3.0) * (2.0 + beta));
} 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 <= 4.5: tmp = 0.5 / ((beta + 3.0) * (2.0 + beta)) 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 <= 4.5) tmp = Float64(0.5 / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))); 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 <= 4.5)
tmp = 0.5 / ((beta + 3.0) * (2.0 + beta));
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, 4.5], N[(0.5 / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $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 4.5:\\
\;\;\;\;\frac{0.5}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 69.2%
+-commutative69.2%
+-commutative69.2%
Simplified69.2%
if 4.5 < beta Initial program 83.8%
Taylor expanded in beta around inf 82.6%
div-inv82.5%
+-commutative82.5%
metadata-eval82.5%
associate-+l+82.5%
metadata-eval82.5%
associate-+r+82.5%
Applied egg-rr82.5%
associate-*r/82.6%
*-commutative82.6%
*-lft-identity82.6%
+-commutative82.6%
+-commutative82.6%
+-commutative82.6%
+-commutative82.6%
Simplified82.6%
Final simplification73.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.5 (* (+ beta 3.0) (+ 2.0 beta))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.5 / ((beta + 3.0) * (2.0 + beta));
} 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 <= 4.5d0) then
tmp = 0.5d0 / ((beta + 3.0d0) * (2.0d0 + beta))
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 <= 4.5) {
tmp = 0.5 / ((beta + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.5 / ((beta + 3.0) * (2.0 + beta)) 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 <= 4.5) tmp = Float64(0.5 / Float64(Float64(beta + 3.0) * Float64(2.0 + beta))); 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 <= 4.5)
tmp = 0.5 / ((beta + 3.0) * (2.0 + beta));
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, 4.5], N[(0.5 / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $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 4.5:\\
\;\;\;\;\frac{0.5}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 69.2%
+-commutative69.2%
+-commutative69.2%
Simplified69.2%
if 4.5 < beta Initial program 83.8%
Taylor expanded in beta around inf 82.6%
Taylor expanded in alpha around 0 82.5%
+-commutative82.5%
Simplified82.5%
Final simplification73.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 1.2e-26) (/ (/ 1.0 beta) (+ beta 3.0)) (/ (/ alpha beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 1.2e-26) {
tmp = (1.0 / beta) / (beta + 3.0);
} else {
tmp = (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 (alpha <= 1.2d-26) then
tmp = (1.0d0 / beta) / (beta + 3.0d0)
else
tmp = (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 (alpha <= 1.2e-26) {
tmp = (1.0 / beta) / (beta + 3.0);
} else {
tmp = (alpha / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 1.2e-26: tmp = (1.0 / beta) / (beta + 3.0) else: tmp = (alpha / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 1.2e-26) tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); else tmp = Float64(Float64(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 (alpha <= 1.2e-26)
tmp = (1.0 / beta) / (beta + 3.0);
else
tmp = (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[alpha, 1.2e-26], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 1.2 \cdot 10^{-26}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if alpha < 1.2e-26Initial program 99.9%
Taylor expanded in beta around inf 31.7%
Taylor expanded in alpha around 0 31.3%
associate-/r*31.7%
+-commutative31.7%
Simplified31.7%
if 1.2e-26 < alpha Initial program 84.9%
Taylor expanded in beta around inf 20.2%
Taylor expanded in alpha around 0 19.8%
+-commutative19.8%
Simplified19.8%
Taylor expanded in alpha around inf 18.4%
associate-/r*19.9%
+-commutative19.9%
Simplified19.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (* beta (+ beta 3.0)))) (if (<= alpha 1.2e-26) (/ 1.0 t_0) (/ alpha t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta * (beta + 3.0);
double tmp;
if (alpha <= 1.2e-26) {
tmp = 1.0 / t_0;
} else {
tmp = alpha / 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 = beta * (beta + 3.0d0)
if (alpha <= 1.2d-26) then
tmp = 1.0d0 / t_0
else
tmp = alpha / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta * (beta + 3.0);
double tmp;
if (alpha <= 1.2e-26) {
tmp = 1.0 / t_0;
} else {
tmp = alpha / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta * (beta + 3.0) tmp = 0 if alpha <= 1.2e-26: tmp = 1.0 / t_0 else: tmp = alpha / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta * Float64(beta + 3.0)) tmp = 0.0 if (alpha <= 1.2e-26) tmp = Float64(1.0 / t_0); else tmp = Float64(alpha / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta * (beta + 3.0);
tmp = 0.0;
if (alpha <= 1.2e-26)
tmp = 1.0 / t_0;
else
tmp = alpha / 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[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 1.2e-26], N[(1.0 / t$95$0), $MachinePrecision], N[(alpha / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta \cdot \left(\beta + 3\right)\\
\mathbf{if}\;\alpha \leq 1.2 \cdot 10^{-26}:\\
\;\;\;\;\frac{1}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{t\_0}\\
\end{array}
\end{array}
if alpha < 1.2e-26Initial program 99.9%
Taylor expanded in beta around inf 31.7%
Taylor expanded in alpha around 0 31.3%
if 1.2e-26 < alpha Initial program 84.9%
Taylor expanded in beta around inf 20.2%
Taylor expanded in alpha around 0 19.8%
+-commutative19.8%
Simplified19.8%
Taylor expanded in alpha around inf 18.4%
+-commutative18.4%
Simplified18.4%
Final simplification26.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (+ 1.0 alpha) (* beta beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return (1.0 + alpha) / (beta * beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = (1.0d0 + alpha) / (beta * beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return (1.0 + alpha) / (beta * beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return (1.0 + alpha) / (beta * beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(1.0 + alpha) / Float64(beta * beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = (1.0 + alpha) / (beta * beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1 + \alpha}{\beta \cdot \beta}
\end{array}
Initial program 94.8%
Taylor expanded in beta around inf 27.8%
*-un-lft-identity27.8%
associate-/l/28.6%
+-commutative28.6%
metadata-eval28.6%
associate-+l+28.6%
metadata-eval28.6%
associate-+r+28.6%
Applied egg-rr28.6%
*-lft-identity28.6%
+-commutative28.6%
*-commutative28.6%
+-commutative28.6%
+-commutative28.6%
+-commutative28.6%
Simplified28.6%
Taylor expanded in beta around inf 27.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (beta * (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 * (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (beta * (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[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot \left(\beta + 3\right)}
\end{array}
Initial program 94.8%
Taylor expanded in beta around inf 27.8%
Taylor expanded in alpha around 0 25.5%
Final simplification25.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (beta * 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 1.0d0 / (beta * 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (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[(beta * 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot 3}
\end{array}
Initial program 94.8%
Taylor expanded in beta around inf 27.8%
*-un-lft-identity27.8%
associate-/l/28.6%
+-commutative28.6%
metadata-eval28.6%
associate-+l+28.6%
metadata-eval28.6%
associate-+r+28.6%
Applied egg-rr28.6%
*-lft-identity28.6%
+-commutative28.6%
*-commutative28.6%
+-commutative28.6%
+-commutative28.6%
+-commutative28.6%
Simplified28.6%
Taylor expanded in alpha around 0 25.5%
+-commutative25.5%
Simplified25.5%
Taylor expanded in beta around 0 4.5%
*-commutative4.5%
Simplified4.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.3333333333333333d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\beta}
\end{array}
Initial program 94.8%
Taylor expanded in beta around inf 27.8%
*-un-lft-identity27.8%
associate-/l/28.6%
+-commutative28.6%
metadata-eval28.6%
associate-+l+28.6%
metadata-eval28.6%
associate-+r+28.6%
Applied egg-rr28.6%
*-lft-identity28.6%
+-commutative28.6%
*-commutative28.6%
+-commutative28.6%
+-commutative28.6%
+-commutative28.6%
Simplified28.6%
Taylor expanded in alpha around 0 25.5%
+-commutative25.5%
Simplified25.5%
Taylor expanded in beta around 0 4.2%
herbie shell --seed 2024170
(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)))