
(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 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 2e+137)
(/
(/ (+ (+ beta alpha) (+ (* beta alpha) 1.0)) t_0)
(* t_0 (+ (+ beta alpha) 3.0)))
(/ (/ (- alpha -1.0) beta) (+ 1.0 (+ (+ beta alpha) 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2e+137) {
tmp = (((beta + alpha) + ((beta * alpha) + 1.0)) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2d+137) then
tmp = (((beta + alpha) + ((beta * alpha) + 1.0d0)) / t_0) / (t_0 * ((beta + alpha) + 3.0d0))
else
tmp = ((alpha - (-1.0d0)) / beta) / (1.0d0 + ((beta + alpha) + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2e+137) {
tmp = (((beta + alpha) + ((beta * alpha) + 1.0)) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2e+137: tmp = (((beta + alpha) + ((beta * alpha) + 1.0)) / t_0) / (t_0 * ((beta + alpha) + 3.0)) else: tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2e+137) tmp = Float64(Float64(Float64(Float64(beta + alpha) + Float64(Float64(beta * alpha) + 1.0)) / t_0) / Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2e+137)
tmp = (((beta + alpha) + ((beta * alpha) + 1.0)) / t_0) / (t_0 * ((beta + alpha) + 3.0));
else
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+137], N[(N[(N[(N[(beta + alpha), $MachinePrecision] + N[(N[(beta * alpha), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+137}:\\
\;\;\;\;\frac{\frac{\left(\beta + \alpha\right) + \left(\beta \cdot \alpha + 1\right)}{t_0}}{t_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\end{array}
\end{array}
if beta < 2.0000000000000001e137Initial program 98.4%
associate-/l/97.5%
associate-+l+97.5%
*-commutative97.5%
metadata-eval97.5%
associate-+l+97.5%
metadata-eval97.5%
associate-+l+97.5%
metadata-eval97.5%
metadata-eval97.5%
associate-+l+97.5%
Simplified97.5%
if 2.0000000000000001e137 < beta Initial program 80.3%
Taylor expanded in beta around -inf 90.2%
associate-*r/90.2%
mul-1-neg90.2%
sub-neg90.2%
mul-1-neg90.2%
distribute-neg-in90.2%
+-commutative90.2%
mul-1-neg90.2%
distribute-lft-in90.2%
metadata-eval90.2%
mul-1-neg90.2%
unsub-neg90.2%
Simplified90.2%
Final simplification96.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 2e+19)
(* (+ beta 1.0) (/ (/ (+ alpha 1.0) t_0) (* t_0 (+ alpha (+ beta 3.0)))))
(/ (/ (- alpha -1.0) beta) (+ 1.0 (+ (+ beta alpha) 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2e+19) {
tmp = (beta + 1.0) * (((alpha + 1.0) / t_0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2d+19) then
tmp = (beta + 1.0d0) * (((alpha + 1.0d0) / t_0) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((alpha - (-1.0d0)) / beta) / (1.0d0 + ((beta + alpha) + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2e+19) {
tmp = (beta + 1.0) * (((alpha + 1.0) / t_0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2e+19: tmp = (beta + 1.0) * (((alpha + 1.0) / t_0) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2e+19) tmp = Float64(Float64(beta + 1.0) * Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2e+19)
tmp = (beta + 1.0) * (((alpha + 1.0) / t_0) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+19], N[(N[(beta + 1.0), $MachinePrecision] * N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+19}:\\
\;\;\;\;\left(\beta + 1\right) \cdot \frac{\frac{\alpha + 1}{t_0}}{t_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\end{array}
\end{array}
if beta < 2e19Initial program 99.8%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+l+99.9%
distribute-rgt1-in99.9%
*-rgt-identity99.9%
distribute-lft-out99.9%
+-commutative99.9%
associate-*r/99.8%
associate-*r/99.9%
Simplified99.9%
if 2e19 < beta Initial program 84.6%
Taylor expanded in beta around -inf 80.8%
associate-*r/80.8%
mul-1-neg80.8%
sub-neg80.8%
mul-1-neg80.8%
distribute-neg-in80.8%
+-commutative80.8%
mul-1-neg80.8%
distribute-lft-in80.8%
metadata-eval80.8%
mul-1-neg80.8%
unsub-neg80.8%
Simplified80.8%
Final simplification94.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 3e+137)
(* (/ (+ beta 1.0) (+ alpha (+ beta 3.0))) (/ (+ alpha 1.0) (* t_0 t_0)))
(/ (/ (- alpha -1.0) beta) (+ 1.0 (+ (+ beta alpha) 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3e+137) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((alpha + 1.0) / (t_0 * t_0));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 3d+137) then
tmp = ((beta + 1.0d0) / (alpha + (beta + 3.0d0))) * ((alpha + 1.0d0) / (t_0 * t_0))
else
tmp = ((alpha - (-1.0d0)) / beta) / (1.0d0 + ((beta + alpha) + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3e+137) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((alpha + 1.0) / (t_0 * t_0));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 3e+137: tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((alpha + 1.0) / (t_0 * t_0)) else: tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3e+137) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(alpha + 1.0) / Float64(t_0 * t_0))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 3e+137)
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((alpha + 1.0) / (t_0 * t_0));
else
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3e+137], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 3 \cdot 10^{+137}:\\
\;\;\;\;\frac{\beta + 1}{\alpha + \left(\beta + 3\right)} \cdot \frac{\alpha + 1}{t_0 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\end{array}
\end{array}
if beta < 3.0000000000000001e137Initial program 98.4%
associate-/l/97.5%
associate-/l/87.8%
associate-+l+87.8%
+-commutative87.8%
associate-+r+87.8%
associate-+l+87.8%
distribute-rgt1-in87.8%
*-rgt-identity87.8%
distribute-lft-out87.8%
+-commutative87.8%
times-frac98.9%
Simplified98.9%
if 3.0000000000000001e137 < beta Initial program 80.3%
Taylor expanded in beta around -inf 90.2%
associate-*r/90.2%
mul-1-neg90.2%
sub-neg90.2%
mul-1-neg90.2%
distribute-neg-in90.2%
+-commutative90.2%
mul-1-neg90.2%
distribute-lft-in90.2%
metadata-eval90.2%
mul-1-neg90.2%
unsub-neg90.2%
Simplified90.2%
Final simplification97.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1.4e+60)
(/ (* (+ beta 1.0) (+ alpha 1.0)) (* t_0 (* t_0 (+ alpha (+ beta 3.0)))))
(/ (/ (- alpha -1.0) beta) (+ 1.0 (+ (+ beta alpha) 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.4e+60) {
tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.4d+60) then
tmp = ((beta + 1.0d0) * (alpha + 1.0d0)) / (t_0 * (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((alpha - (-1.0d0)) / beta) / (1.0d0 + ((beta + alpha) + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.4e+60) {
tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.4e+60: tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.4e+60) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(alpha + 1.0)) / Float64(t_0 * Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.4e+60)
tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.4e+60], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.4 \cdot 10^{+60}:\\
\;\;\;\;\frac{\left(\beta + 1\right) \cdot \left(\alpha + 1\right)}{t_0 \cdot \left(t_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\end{array}
\end{array}
if beta < 1.4e60Initial program 99.8%
associate-/l/99.9%
associate-/r*94.0%
associate-+l+94.0%
+-commutative94.0%
associate-+r+94.0%
associate-+l+94.1%
distribute-rgt1-in94.1%
*-rgt-identity94.1%
distribute-lft-out94.1%
*-commutative94.1%
metadata-eval94.1%
associate-+l+94.1%
+-commutative94.1%
Simplified94.0%
if 1.4e60 < beta Initial program 81.7%
Taylor expanded in beta around -inf 81.4%
associate-*r/81.4%
mul-1-neg81.4%
sub-neg81.4%
mul-1-neg81.4%
distribute-neg-in81.4%
+-commutative81.4%
mul-1-neg81.4%
distribute-lft-in81.4%
metadata-eval81.4%
mul-1-neg81.4%
unsub-neg81.4%
Simplified81.4%
Final simplification90.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4e+39) (/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 2.0) (+ beta (+ alpha 3.0))))) (/ (/ (- alpha -1.0) beta) (+ 1.0 (+ (+ beta alpha) 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+39) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + (alpha + 3.0))));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4d+39) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 2.0d0) * (beta + (alpha + 3.0d0))))
else
tmp = ((alpha - (-1.0d0)) / beta) / (1.0d0 + ((beta + alpha) + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+39) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + (alpha + 3.0))));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4e+39: tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + (alpha + 3.0)))) else: tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4e+39) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(beta + Float64(alpha + 3.0))))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4e+39)
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + (alpha + 3.0))));
else
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4e+39], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4 \cdot 10^{+39}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + \left(\alpha + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\end{array}
\end{array}
if beta < 3.99999999999999976e39Initial program 99.8%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+l+99.9%
distribute-rgt1-in99.9%
*-rgt-identity99.9%
distribute-lft-out99.9%
+-commutative99.9%
associate-*r/99.8%
associate-*r/99.9%
Simplified99.8%
Taylor expanded in alpha around 0 84.2%
Taylor expanded in alpha around 0 67.9%
expm1-log1p-u67.9%
expm1-udef75.9%
associate-*r/75.9%
+-commutative75.9%
+-commutative75.9%
div-inv75.9%
+-commutative75.9%
Applied egg-rr75.9%
expm1-def67.9%
expm1-log1p67.9%
+-commutative67.9%
associate-+r+67.9%
+-commutative67.9%
Simplified67.9%
expm1-log1p-u67.9%
expm1-udef75.9%
+-commutative75.9%
Applied egg-rr75.9%
expm1-def67.9%
expm1-log1p67.9%
associate-/l/67.9%
*-commutative67.9%
+-commutative67.9%
Simplified67.9%
if 3.99999999999999976e39 < beta Initial program 82.7%
Taylor expanded in beta around -inf 81.1%
associate-*r/81.1%
mul-1-neg81.1%
sub-neg81.1%
mul-1-neg81.1%
distribute-neg-in81.1%
+-commutative81.1%
mul-1-neg81.1%
distribute-lft-in81.1%
metadata-eval81.1%
mul-1-neg81.1%
unsub-neg81.1%
Simplified81.1%
Final simplification71.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.4e+39) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta (+ alpha 3.0)))) (/ (/ (- alpha -1.0) beta) (+ 1.0 (+ (+ beta alpha) 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4e+39) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + (alpha + 3.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.4d+39) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + (alpha + 3.0d0)))
else
tmp = ((alpha - (-1.0d0)) / beta) / (1.0d0 + ((beta + alpha) + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4e+39) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + (alpha + 3.0)));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.4e+39: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + (alpha + 3.0))) else: tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.4e+39) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.4e+39)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + (alpha + 3.0)));
else
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.4e+39], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.4 \cdot 10^{+39}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\end{array}
\end{array}
if beta < 4.4000000000000003e39Initial program 99.8%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+l+99.9%
distribute-rgt1-in99.9%
*-rgt-identity99.9%
distribute-lft-out99.9%
+-commutative99.9%
associate-*r/99.8%
associate-*r/99.9%
Simplified99.8%
Taylor expanded in alpha around 0 84.2%
Taylor expanded in alpha around 0 67.9%
expm1-log1p-u67.9%
expm1-udef75.9%
associate-*r/75.9%
+-commutative75.9%
+-commutative75.9%
div-inv75.9%
+-commutative75.9%
Applied egg-rr75.9%
expm1-def67.9%
expm1-log1p67.9%
+-commutative67.9%
associate-+r+67.9%
+-commutative67.9%
Simplified67.9%
if 4.4000000000000003e39 < beta Initial program 82.7%
Taylor expanded in beta around -inf 81.1%
associate-*r/81.1%
mul-1-neg81.1%
sub-neg81.1%
mul-1-neg81.1%
distribute-neg-in81.1%
+-commutative81.1%
mul-1-neg81.1%
distribute-lft-in81.1%
metadata-eval81.1%
mul-1-neg81.1%
unsub-neg81.1%
Simplified81.1%
Final simplification71.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5) (/ (+ 0.5 (* beta 0.25)) (* (+ beta 2.0) (+ beta (+ alpha 3.0)))) (/ (- alpha -1.0) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + (alpha + 3.0)));
} else {
tmp = (alpha - -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) :: tmp
if (beta <= 6.5d0) then
tmp = (0.5d0 + (beta * 0.25d0)) / ((beta + 2.0d0) * (beta + (alpha + 3.0d0)))
else
tmp = (alpha - (-1.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.5) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + (alpha + 3.0)));
} else {
tmp = (alpha - -1.0) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.5: tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + (alpha + 3.0))) else: tmp = (alpha - -1.0) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5) tmp = Float64(Float64(0.5 + Float64(beta * 0.25)) / Float64(Float64(beta + 2.0) * Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(alpha - -1.0) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.5)
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + (alpha + 3.0)));
else
tmp = (alpha - -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_] := If[LessEqual[beta, 6.5], N[(N[(0.5 + N[(beta * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha - -1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5:\\
\;\;\;\;\frac{0.5 + \beta \cdot 0.25}{\left(\beta + 2\right) \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+l+99.9%
distribute-rgt1-in99.9%
*-rgt-identity99.9%
distribute-lft-out99.9%
+-commutative99.9%
associate-*r/99.9%
associate-*r/99.9%
Simplified99.9%
Taylor expanded in alpha around 0 83.8%
Taylor expanded in alpha around 0 68.0%
expm1-log1p-u68.0%
expm1-udef80.0%
associate-*r/80.0%
+-commutative80.0%
+-commutative80.0%
div-inv80.0%
+-commutative80.0%
Applied egg-rr80.0%
expm1-def68.0%
expm1-log1p68.0%
+-commutative68.0%
associate-+r+68.0%
+-commutative68.0%
Simplified68.0%
Taylor expanded in beta around 0 67.7%
*-commutative67.7%
Simplified67.7%
if 6.5 < beta Initial program 86.0%
associate-/l/81.9%
associate-+l+81.9%
*-commutative81.9%
metadata-eval81.9%
associate-+l+81.9%
metadata-eval81.9%
associate-+l+81.9%
metadata-eval81.9%
metadata-eval81.9%
associate-+l+81.9%
Simplified81.9%
Taylor expanded in beta around -inf 74.2%
associate-*r/74.2%
mul-1-neg74.2%
sub-neg74.2%
mul-1-neg74.2%
distribute-neg-in74.2%
+-commutative74.2%
mul-1-neg74.2%
distribute-lft-in74.2%
metadata-eval74.2%
mul-1-neg74.2%
unsub-neg74.2%
unpow274.2%
Simplified74.2%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.1e+16) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (- alpha -1.0) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.1e+16) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (alpha - -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) :: tmp
if (beta <= 4.1d+16) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = (alpha - (-1.0d0)) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.1e+16) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (alpha - -1.0) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.1e+16: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = (alpha - -1.0) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.1e+16) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(alpha - -1.0) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.1e+16)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = (alpha - -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_] := If[LessEqual[beta, 4.1e+16], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha - -1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.1 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 4.1e16Initial program 99.8%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+l+99.9%
distribute-rgt1-in99.9%
*-rgt-identity99.9%
distribute-lft-out99.9%
+-commutative99.9%
associate-*r/99.8%
associate-*r/99.9%
Simplified99.9%
Taylor expanded in alpha around 0 83.9%
Taylor expanded in alpha around 0 67.7%
expm1-log1p-u67.7%
expm1-udef78.9%
associate-*r/78.9%
+-commutative78.9%
+-commutative78.9%
div-inv78.9%
+-commutative78.9%
Applied egg-rr78.9%
expm1-def67.7%
expm1-log1p67.7%
+-commutative67.7%
associate-+r+67.7%
+-commutative67.7%
Simplified67.7%
Taylor expanded in alpha around 0 65.8%
if 4.1e16 < beta Initial program 84.8%
associate-/l/80.3%
associate-+l+80.3%
*-commutative80.3%
metadata-eval80.3%
associate-+l+80.3%
metadata-eval80.3%
associate-+l+80.3%
metadata-eval80.3%
metadata-eval80.3%
associate-+l+80.3%
Simplified80.3%
Taylor expanded in beta around -inf 78.0%
associate-*r/78.0%
mul-1-neg78.0%
sub-neg78.0%
mul-1-neg78.0%
distribute-neg-in78.0%
+-commutative78.0%
mul-1-neg78.0%
distribute-lft-in78.0%
metadata-eval78.0%
mul-1-neg78.0%
unsub-neg78.0%
unpow278.0%
Simplified78.0%
Final simplification69.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6e+39) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (- alpha -1.0) beta) (+ 1.0 (+ (+ beta alpha) 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6e+39) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.6d+39) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((alpha - (-1.0d0)) / beta) / (1.0d0 + ((beta + alpha) + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6e+39) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6e+39: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6e+39) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.6e+39)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((alpha - -1.0) / beta) / (1.0 + ((beta + alpha) + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.6e+39], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+39}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\end{array}
\end{array}
if beta < 3.59999999999999984e39Initial program 99.8%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+l+99.9%
distribute-rgt1-in99.9%
*-rgt-identity99.9%
distribute-lft-out99.9%
+-commutative99.9%
associate-*r/99.8%
associate-*r/99.9%
Simplified99.8%
Taylor expanded in alpha around 0 84.2%
Taylor expanded in alpha around 0 67.9%
expm1-log1p-u67.9%
expm1-udef75.9%
associate-*r/75.9%
+-commutative75.9%
+-commutative75.9%
div-inv75.9%
+-commutative75.9%
Applied egg-rr75.9%
expm1-def67.9%
expm1-log1p67.9%
+-commutative67.9%
associate-+r+67.9%
+-commutative67.9%
Simplified67.9%
Taylor expanded in alpha around 0 66.1%
if 3.59999999999999984e39 < beta Initial program 82.7%
Taylor expanded in beta around -inf 81.1%
associate-*r/81.1%
mul-1-neg81.1%
sub-neg81.1%
mul-1-neg81.1%
distribute-neg-in81.1%
+-commutative81.1%
mul-1-neg81.1%
distribute-lft-in81.1%
metadata-eval81.1%
mul-1-neg81.1%
unsub-neg81.1%
Simplified81.1%
Final simplification70.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta (+ beta 5.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * (beta + 5.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.1d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / (beta * (beta + 5.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * (beta + 5.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / (beta * (beta + 5.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 5.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 1.0 / (beta * (beta + 5.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 5\right)}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+l+99.9%
distribute-rgt1-in99.9%
*-rgt-identity99.9%
distribute-lft-out99.9%
+-commutative99.9%
associate-*r/99.9%
associate-*r/99.9%
Simplified99.9%
Taylor expanded in alpha around 0 83.8%
Taylor expanded in alpha around 0 68.0%
Taylor expanded in beta around 0 66.6%
+-commutative66.6%
Simplified66.6%
if 2.10000000000000009 < beta Initial program 86.0%
associate-/l/81.9%
associate-+l+81.9%
*-commutative81.9%
metadata-eval81.9%
associate-+l+81.9%
metadata-eval81.9%
associate-+l+81.9%
metadata-eval81.9%
metadata-eval81.9%
associate-+l+81.9%
Simplified81.9%
Taylor expanded in beta around -inf 83.7%
mul-1-neg83.7%
sub-neg83.7%
mul-1-neg83.7%
distribute-neg-in83.7%
+-commutative83.7%
mul-1-neg83.7%
distribute-lft-in83.7%
metadata-eval83.7%
mul-1-neg83.7%
unsub-neg83.7%
Simplified83.7%
Taylor expanded in alpha around 0 71.2%
Taylor expanded in beta around inf 71.2%
unpow271.2%
distribute-rgt-out71.2%
+-commutative71.2%
Simplified71.2%
Final simplification68.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) (/ 0.25 (+ alpha 3.0)) (/ (- alpha -1.0) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = (alpha - -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) :: tmp
if (beta <= 4.0d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = (alpha - (-1.0d0)) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = (alpha - -1.0) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.25 / (alpha + 3.0) else: tmp = (alpha - -1.0) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(Float64(alpha - -1.0) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.25 / (alpha + 3.0);
else
tmp = (alpha - -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_] := If[LessEqual[beta, 4.0], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha - -1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+l+99.9%
distribute-rgt1-in99.9%
*-rgt-identity99.9%
distribute-lft-out99.9%
+-commutative99.9%
associate-*r/99.9%
associate-*r/99.9%
Simplified99.9%
Taylor expanded in alpha around 0 83.8%
Taylor expanded in alpha around 0 68.0%
Taylor expanded in beta around 0 66.6%
+-commutative66.6%
Simplified66.6%
if 4 < beta Initial program 86.0%
associate-/l/81.9%
associate-+l+81.9%
*-commutative81.9%
metadata-eval81.9%
associate-+l+81.9%
metadata-eval81.9%
associate-+l+81.9%
metadata-eval81.9%
metadata-eval81.9%
associate-+l+81.9%
Simplified81.9%
Taylor expanded in beta around -inf 74.2%
associate-*r/74.2%
mul-1-neg74.2%
sub-neg74.2%
mul-1-neg74.2%
distribute-neg-in74.2%
+-commutative74.2%
mul-1-neg74.2%
distribute-lft-in74.2%
metadata-eval74.2%
mul-1-neg74.2%
unsub-neg74.2%
unpow274.2%
Simplified74.2%
Final simplification69.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 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) :: tmp
if (beta <= 3.6d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.6)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 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_] := If[LessEqual[beta, 3.6], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+l+99.9%
distribute-rgt1-in99.9%
*-rgt-identity99.9%
distribute-lft-out99.9%
+-commutative99.9%
associate-*r/99.9%
associate-*r/99.9%
Simplified99.9%
Taylor expanded in alpha around 0 83.8%
Taylor expanded in alpha around 0 68.0%
Taylor expanded in beta around 0 66.6%
+-commutative66.6%
Simplified66.6%
if 3.60000000000000009 < beta Initial program 86.0%
associate-/l/81.9%
associate-+l+81.9%
+-commutative81.9%
associate-+r+81.9%
associate-+l+81.9%
distribute-rgt1-in81.9%
*-rgt-identity81.9%
distribute-lft-out81.9%
+-commutative81.9%
associate-*r/92.0%
associate-*r/79.3%
Simplified79.3%
Taylor expanded in alpha around 0 71.1%
Taylor expanded in beta around inf 71.0%
unpow271.0%
Simplified71.0%
Final simplification68.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ alpha 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (alpha + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.25d0 / (alpha + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (alpha + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (alpha + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(alpha + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (alpha + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\alpha + 3}
\end{array}
Initial program 95.2%
associate-/l/93.8%
associate-+l+93.8%
+-commutative93.8%
associate-+r+93.8%
associate-+l+93.8%
distribute-rgt1-in93.8%
*-rgt-identity93.8%
distribute-lft-out93.8%
+-commutative93.8%
associate-*r/97.2%
associate-*r/93.0%
Simplified93.0%
Taylor expanded in alpha around 0 79.5%
Taylor expanded in alpha around 0 67.7%
Taylor expanded in beta around 0 46.0%
+-commutative46.0%
Simplified46.0%
Final simplification46.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.16666666666666666)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.16666666666666666 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.16666666666666666
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.16666666666666666
\end{array}
Initial program 95.2%
associate-/l/93.8%
associate-+l+93.8%
*-commutative93.8%
metadata-eval93.8%
associate-+l+93.8%
metadata-eval93.8%
associate-+l+93.8%
metadata-eval93.8%
metadata-eval93.8%
associate-+l+93.8%
Simplified93.8%
Taylor expanded in beta around -inf 47.8%
mul-1-neg47.8%
sub-neg47.8%
mul-1-neg47.8%
distribute-neg-in47.8%
+-commutative47.8%
mul-1-neg47.8%
distribute-lft-in47.8%
metadata-eval47.8%
mul-1-neg47.8%
unsub-neg47.8%
Simplified47.8%
Taylor expanded in alpha around 0 33.2%
Taylor expanded in beta around 0 10.6%
Final simplification10.6%
herbie shell --seed 2023217
(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)))