
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ 2.0 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 = alpha + (2.0 + 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 = alpha + (2.0d0 + 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 = alpha + (2.0 + 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 = alpha + (2.0 + 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(alpha + Float64(2.0 + 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 = alpha + (2.0 + 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[(alpha + N[(2.0 + 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 := \alpha + \left(2 + \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 96.0%
Simplified85.6%
times-frac96.3%
+-commutative96.3%
Applied egg-rr96.3%
associate-*r/96.3%
+-commutative96.3%
Applied egg-rr96.3%
times-frac99.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 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= alpha 32000.0)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_1 t_0)))
(/ (* (+ 1.0 beta) (/ (/ alpha t_1) t_0)) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 32000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * t_0));
} else {
tmp = ((1.0 + beta) * ((alpha / t_1) / t_0)) / t_1;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (2.0d0 + beta)
if (alpha <= 32000.0d0) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_1 * t_0))
else
tmp = ((1.0d0 + beta) * ((alpha / t_1) / t_0)) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 32000.0) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * t_0));
} else {
tmp = ((1.0 + beta) * ((alpha / t_1) / t_0)) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (2.0 + beta) tmp = 0 if alpha <= 32000.0: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * t_0)) else: tmp = ((1.0 + beta) * ((alpha / t_1) / t_0)) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (alpha <= 32000.0) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(1.0 + beta) * Float64(Float64(alpha / t_1) / t_0)) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (alpha <= 32000.0)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_1 * t_0));
else
tmp = ((1.0 + beta) * ((alpha / t_1) / t_0)) / t_1;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 32000.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(alpha / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\alpha \leq 32000:\\
\;\;\;\;\frac{1 + \alpha}{t\_1} \cdot \frac{1 + \beta}{t\_1 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \frac{\frac{\alpha}{t\_1}}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if alpha < 32000Initial program 99.9%
Simplified93.8%
times-frac99.6%
+-commutative99.6%
Applied egg-rr99.6%
if 32000 < alpha Initial program 88.1%
Simplified68.7%
Taylor expanded in alpha around inf 67.7%
*-commutative67.7%
Simplified67.7%
times-frac88.2%
Applied egg-rr88.2%
associate-*l/88.3%
associate-/r*98.3%
+-commutative98.3%
+-commutative98.3%
Applied egg-rr98.3%
Final simplification99.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= alpha 30500.0)
(* (/ (+ 1.0 alpha) t_0) (/ (+ 1.0 beta) (* (+ 2.0 beta) (+ beta 3.0))))
(/ (* (+ 1.0 beta) (/ (/ alpha t_0) (+ alpha (+ beta 3.0)))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 30500.0) {
tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = ((1.0 + beta) * ((alpha / t_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 = alpha + (2.0d0 + beta)
if (alpha <= 30500.0d0) then
tmp = ((1.0d0 + alpha) / t_0) * ((1.0d0 + beta) / ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + beta) * ((alpha / t_0) / (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 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 30500.0) {
tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = ((1.0 + beta) * ((alpha / t_0) / (alpha + (beta + 3.0)))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if alpha <= 30500.0: tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((2.0 + beta) * (beta + 3.0))) else: tmp = ((1.0 + beta) * ((alpha / t_0) / (alpha + (beta + 3.0)))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (alpha <= 30500.0) tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + beta) * Float64(Float64(alpha / t_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 = alpha + (2.0 + beta);
tmp = 0.0;
if (alpha <= 30500.0)
tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((2.0 + beta) * (beta + 3.0)));
else
tmp = ((1.0 + beta) * ((alpha / t_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[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 30500.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(alpha / t$95$0), $MachinePrecision] / 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 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\alpha \leq 30500:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \frac{\frac{\alpha}{t\_0}}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if alpha < 30500Initial program 99.9%
Simplified93.8%
times-frac99.6%
+-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in alpha around 0 98.1%
+-commutative98.1%
+-commutative98.1%
Simplified98.1%
if 30500 < alpha Initial program 88.1%
Simplified68.7%
Taylor expanded in alpha around inf 67.7%
*-commutative67.7%
Simplified67.7%
times-frac88.2%
Applied egg-rr88.2%
associate-*l/88.3%
associate-/r*98.3%
+-commutative98.3%
+-commutative98.3%
Applied egg-rr98.3%
Final simplification98.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= alpha 0.0076)
(/ 1.0 (* t_0 (/ (* (+ 2.0 beta) (+ beta 3.0)) (+ 1.0 beta))))
(* (/ alpha t_0) (/ (/ beta t_0) (+ beta (+ alpha 3.0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 0.0076) {
tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)));
} else {
tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 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 + (2.0d0 + beta)
if (alpha <= 0.0076d0) then
tmp = 1.0d0 / (t_0 * (((2.0d0 + beta) * (beta + 3.0d0)) / (1.0d0 + beta)))
else
tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 3.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 0.0076) {
tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)));
} else {
tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if alpha <= 0.0076: tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta))) else: tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (alpha <= 0.0076) tmp = Float64(1.0 / Float64(t_0 * Float64(Float64(Float64(2.0 + beta) * Float64(beta + 3.0)) / Float64(1.0 + beta)))); else tmp = Float64(Float64(alpha / t_0) * Float64(Float64(beta / t_0) / Float64(beta + Float64(alpha + 3.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (alpha <= 0.0076)
tmp = 1.0 / (t_0 * (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)));
else
tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 0.0076], N[(1.0 / N[(t$95$0 * N[(N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / t$95$0), $MachinePrecision] * N[(N[(beta / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\alpha \leq 0.0076:\\
\;\;\;\;\frac{1}{t\_0 \cdot \frac{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{t\_0} \cdot \frac{\frac{\beta}{t\_0}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if alpha < 0.00759999999999999998Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
clear-num99.7%
inv-pow99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
distribute-rgt1-in99.7%
fma-define99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/r/99.7%
Simplified99.7%
Taylor expanded in alpha around 0 98.7%
if 0.00759999999999999998 < alpha Initial program 88.5%
Simplified69.8%
Taylor expanded in alpha around inf 66.3%
*-commutative66.3%
Simplified66.3%
Taylor expanded in beta around inf 47.2%
times-frac60.8%
+-commutative60.8%
+-commutative60.8%
+-commutative60.8%
associate-+r+60.8%
Applied egg-rr60.8%
+-commutative60.8%
associate-/r*70.4%
+-commutative70.4%
+-commutative70.4%
+-commutative70.4%
+-commutative70.4%
Simplified70.4%
Final simplification89.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= alpha 32000.0)
(* (/ (+ 1.0 alpha) t_0) (/ (+ 1.0 beta) (* (+ 2.0 beta) (+ beta 3.0))))
(* (/ alpha t_0) (/ (/ beta t_0) (+ beta (+ alpha 3.0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 32000.0) {
tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 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 + (2.0d0 + beta)
if (alpha <= 32000.0d0) then
tmp = ((1.0d0 + alpha) / t_0) * ((1.0d0 + beta) / ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 3.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (alpha <= 32000.0) {
tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if alpha <= 32000.0: tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((2.0 + beta) * (beta + 3.0))) else: tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (alpha <= 32000.0) tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(alpha / t_0) * Float64(Float64(beta / t_0) / Float64(beta + Float64(alpha + 3.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (alpha <= 32000.0)
tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((2.0 + beta) * (beta + 3.0)));
else
tmp = (alpha / t_0) * ((beta / t_0) / (beta + (alpha + 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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 32000.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / t$95$0), $MachinePrecision] * N[(N[(beta / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\alpha \leq 32000:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{t\_0} \cdot \frac{\frac{\beta}{t\_0}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if alpha < 32000Initial program 99.9%
Simplified93.8%
times-frac99.6%
+-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in alpha around 0 98.1%
+-commutative98.1%
+-commutative98.1%
Simplified98.1%
if 32000 < alpha Initial program 88.1%
Simplified68.7%
Taylor expanded in alpha around inf 67.7%
*-commutative67.7%
Simplified67.7%
Taylor expanded in beta around inf 48.3%
times-frac62.4%
+-commutative62.4%
+-commutative62.4%
+-commutative62.4%
associate-+r+62.4%
Applied egg-rr62.4%
+-commutative62.4%
associate-/r*72.3%
+-commutative72.3%
+-commutative72.3%
+-commutative72.3%
+-commutative72.3%
Simplified72.3%
Final simplification89.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.95e+15)
(/
1.0
(* (+ alpha (+ 2.0 beta)) (* (+ 2.0 beta) (/ (+ beta 3.0) (+ 1.0 beta)))))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.95e+15) {
tmp = 1.0 / ((alpha + (2.0 + beta)) * ((2.0 + beta) * ((beta + 3.0) / (1.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 <= 1.95d+15) then
tmp = 1.0d0 / ((alpha + (2.0d0 + beta)) * ((2.0d0 + beta) * ((beta + 3.0d0) / (1.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 <= 1.95e+15) {
tmp = 1.0 / ((alpha + (2.0 + beta)) * ((2.0 + beta) * ((beta + 3.0) / (1.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 <= 1.95e+15: tmp = 1.0 / ((alpha + (2.0 + beta)) * ((2.0 + beta) * ((beta + 3.0) / (1.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 <= 1.95e+15) tmp = Float64(1.0 / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(Float64(2.0 + beta) * Float64(Float64(beta + 3.0) / Float64(1.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 <= 1.95e+15)
tmp = 1.0 / ((alpha + (2.0 + beta)) * ((2.0 + beta) * ((beta + 3.0) / (1.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, 1.95e+15], N[(1.0 / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $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 1.95 \cdot 10^{+15}:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\left(2 + \beta\right) \cdot \frac{\beta + 3}{1 + \beta}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.95e15Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
clear-num99.9%
inv-pow99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
distribute-rgt1-in99.9%
fma-define99.9%
Applied egg-rr99.9%
unpow-199.9%
associate-/r/99.9%
Simplified99.9%
Taylor expanded in alpha around 0 66.7%
associate-/l*66.7%
+-commutative66.7%
Simplified66.7%
if 1.95e15 < beta Initial program 89.1%
Taylor expanded in beta around inf 89.0%
div-inv88.9%
metadata-eval88.9%
associate-+l+88.9%
metadata-eval88.9%
associate-+r+88.9%
Applied egg-rr88.9%
associate-*r/89.0%
*-commutative89.0%
*-lft-identity89.0%
+-commutative89.0%
Simplified89.0%
Final simplification74.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 8.5e+15)
(/
1.0
(* (+ alpha (+ 2.0 beta)) (/ (* (+ 2.0 beta) (+ beta 3.0)) (+ 1.0 beta))))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.5e+15) {
tmp = 1.0 / ((alpha + (2.0 + beta)) * (((2.0 + beta) * (beta + 3.0)) / (1.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 <= 8.5d+15) then
tmp = 1.0d0 / ((alpha + (2.0d0 + beta)) * (((2.0d0 + beta) * (beta + 3.0d0)) / (1.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 <= 8.5e+15) {
tmp = 1.0 / ((alpha + (2.0 + beta)) * (((2.0 + beta) * (beta + 3.0)) / (1.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 <= 8.5e+15: tmp = 1.0 / ((alpha + (2.0 + beta)) * (((2.0 + beta) * (beta + 3.0)) / (1.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 <= 8.5e+15) tmp = Float64(1.0 / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(Float64(Float64(2.0 + beta) * Float64(beta + 3.0)) / Float64(1.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 <= 8.5e+15)
tmp = 1.0 / ((alpha + (2.0 + beta)) * (((2.0 + beta) * (beta + 3.0)) / (1.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, 8.5e+15], N[(1.0 / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.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 8.5 \cdot 10^{+15}:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \frac{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 8.5e15Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
clear-num99.9%
inv-pow99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
distribute-rgt1-in99.9%
fma-define99.9%
Applied egg-rr99.9%
unpow-199.9%
associate-/r/99.9%
Simplified99.9%
Taylor expanded in alpha around 0 66.7%
if 8.5e15 < beta Initial program 89.1%
Taylor expanded in beta around inf 89.0%
div-inv88.9%
metadata-eval88.9%
associate-+l+88.9%
metadata-eval88.9%
associate-+r+88.9%
Applied egg-rr88.9%
associate-*r/89.0%
*-commutative89.0%
*-lft-identity89.0%
+-commutative89.0%
Simplified89.0%
Final simplification74.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.9e+16) (/ (+ 1.0 beta) (* (+ 2.0 beta) (+ 6.0 (* beta (+ beta 5.0))))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.9e+16) {
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.9d+16) then
tmp = (1.0d0 + beta) / ((2.0d0 + beta) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.9e+16) {
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.9e+16: tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0)))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.9e+16) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.9e+16)
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0))));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.9e+16], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $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.9 \cdot 10^{+16}:\\
\;\;\;\;\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.9e16Initial program 99.9%
Simplified96.5%
Taylor expanded in beta around 0 96.5%
Taylor expanded in alpha around 0 65.6%
+-commutative65.6%
Simplified65.6%
if 3.9e16 < beta Initial program 89.1%
Taylor expanded in beta around inf 89.0%
div-inv88.9%
metadata-eval88.9%
associate-+l+88.9%
metadata-eval88.9%
associate-+r+88.9%
Applied egg-rr88.9%
associate-*r/89.0%
*-commutative89.0%
*-lft-identity89.0%
+-commutative89.0%
Simplified89.0%
Final simplification74.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 24.0) (/ 0.5 (* (+ alpha (+ 2.0 beta)) (+ 3.0 (+ alpha beta)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 24.0) {
tmp = 0.5 / ((alpha + (2.0 + beta)) * (3.0 + (alpha + 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 <= 24.0d0) then
tmp = 0.5d0 / ((alpha + (2.0d0 + beta)) * (3.0d0 + (alpha + 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 <= 24.0) {
tmp = 0.5 / ((alpha + (2.0 + beta)) * (3.0 + (alpha + 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 <= 24.0: tmp = 0.5 / ((alpha + (2.0 + beta)) * (3.0 + (alpha + 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 <= 24.0) tmp = Float64(0.5 / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(3.0 + Float64(alpha + 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 <= 24.0)
tmp = 0.5 / ((alpha + (2.0 + beta)) * (3.0 + (alpha + 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, 24.0], N[(0.5 / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(3.0 + N[(alpha + 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 24:\\
\;\;\;\;\frac{0.5}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 24Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 85.0%
if 24 < beta Initial program 89.5%
Taylor expanded in beta around inf 87.3%
div-inv87.2%
metadata-eval87.2%
associate-+l+87.2%
metadata-eval87.2%
associate-+r+87.2%
Applied egg-rr87.2%
associate-*r/87.3%
*-commutative87.3%
*-lft-identity87.3%
+-commutative87.3%
Simplified87.3%
Final simplification85.9%
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 (* (+ 2.0 beta) (+ beta 3.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 = 0.5 / ((2.0 + beta) * (beta + 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 <= 4.5d0) then
tmp = 0.5d0 / ((2.0d0 + beta) * (beta + 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 <= 4.5) {
tmp = 0.5 / ((2.0 + beta) * (beta + 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 <= 4.5: tmp = 0.5 / ((2.0 + beta) * (beta + 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 <= 4.5) tmp = Float64(0.5 / Float64(Float64(2.0 + beta) * Float64(beta + 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 <= 4.5)
tmp = 0.5 / ((2.0 + beta) * (beta + 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, 4.5], N[(0.5 / N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 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 4.5:\\
\;\;\;\;\frac{0.5}{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 64.2%
if 4.5 < beta Initial program 89.5%
Taylor expanded in beta around inf 87.3%
div-inv87.2%
metadata-eval87.2%
associate-+l+87.2%
metadata-eval87.2%
associate-+r+87.2%
Applied egg-rr87.2%
associate-*r/87.3%
*-commutative87.3%
*-lft-identity87.3%
+-commutative87.3%
Simplified87.3%
Final simplification72.9%
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 (* (+ 2.0 beta) (+ beta 3.0))) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.5 / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = 0.5d0 / ((2.0d0 + beta) * (beta + 3.0d0))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.5 / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.5 / ((2.0 + beta) * (beta + 3.0)) else: tmp = (1.0 / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(0.5 / Float64(Float64(2.0 + beta) * Float64(beta + 3.0))); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 0.5 / ((2.0 + beta) * (beta + 3.0));
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(0.5 / N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{0.5}{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 64.2%
if 4.5 < beta Initial program 89.5%
Taylor expanded in beta around inf 87.3%
div-inv87.2%
metadata-eval87.2%
associate-+l+87.2%
metadata-eval87.2%
associate-+r+87.2%
Applied egg-rr87.2%
associate-*r/87.3%
*-commutative87.3%
*-lft-identity87.3%
+-commutative87.3%
Simplified87.3%
Taylor expanded in alpha around 0 75.8%
associate-/r*76.0%
+-commutative76.0%
Simplified76.0%
Final simplification68.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9.0) (/ 0.5 (* (+ 2.0 beta) (+ beta 3.0))) (/ 1.0 (* beta (/ beta (+ 1.0 alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.5 / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = 1.0 / (beta * (beta / (1.0 + 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 <= 9.0d0) then
tmp = 0.5d0 / ((2.0d0 + beta) * (beta + 3.0d0))
else
tmp = 1.0d0 / (beta * (beta / (1.0d0 + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = 0.5 / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = 1.0 / (beta * (beta / (1.0 + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.0: tmp = 0.5 / ((2.0 + beta) * (beta + 3.0)) else: tmp = 1.0 / (beta * (beta / (1.0 + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.0) tmp = Float64(0.5 / Float64(Float64(2.0 + beta) * Float64(beta + 3.0))); else tmp = Float64(1.0 / Float64(beta * Float64(beta / Float64(1.0 + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.0)
tmp = 0.5 / ((2.0 + beta) * (beta + 3.0));
else
tmp = 1.0 / (beta * (beta / (1.0 + 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, 9.0], N[(0.5 / N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9:\\
\;\;\;\;\frac{0.5}{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 9Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 64.2%
if 9 < beta Initial program 89.5%
Taylor expanded in beta around inf 87.3%
clear-num86.6%
inv-pow86.6%
metadata-eval86.6%
associate-+l+86.6%
metadata-eval86.6%
associate-+r+86.6%
Applied egg-rr86.6%
unpow-186.6%
associate-/r/86.7%
+-commutative86.7%
Simplified86.7%
Taylor expanded in beta around inf 86.5%
Final simplification72.6%
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 96.0%
Taylor expanded in beta around inf 34.3%
Taylor expanded in alpha around 0 30.1%
Final simplification30.1%
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(Float64(1.0 / 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[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{1}{\beta}}{\beta + 3}
\end{array}
Initial program 96.0%
Taylor expanded in beta around inf 34.3%
div-inv34.3%
metadata-eval34.3%
associate-+l+34.3%
metadata-eval34.3%
associate-+r+34.3%
Applied egg-rr34.3%
associate-*r/34.3%
*-commutative34.3%
*-lft-identity34.3%
+-commutative34.3%
Simplified34.3%
Taylor expanded in alpha around 0 30.1%
associate-/r*30.2%
+-commutative30.2%
Simplified30.2%
Final simplification30.2%
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 96.0%
Taylor expanded in beta around inf 34.3%
Taylor expanded in alpha around 0 30.1%
Taylor expanded in beta around 0 4.3%
Final simplification4.3%
herbie shell --seed 2024075
(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)))