
(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 13 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 (* (log (exp (/ (+ 1.0 beta) (+ alpha (+ beta 2.0))))) (/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
return log(exp(((1.0 + beta) / (alpha + (beta + 2.0))))) * (((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = log(exp(((1.0d0 + beta) / (alpha + (beta + 2.0d0))))) * (((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return Math.log(Math.exp(((1.0 + beta) / (alpha + (beta + 2.0))))) * (((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return math.log(math.exp(((1.0 + beta) / (alpha + (beta + 2.0))))) * (((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(log(exp(Float64(Float64(1.0 + beta) / Float64(alpha + Float64(beta + 2.0))))) * Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = log(exp(((1.0 + beta) / (alpha + (beta + 2.0))))) * (((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[Log[N[Exp[N[(N[(1.0 + beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\log \left(e^{\frac{1 + \beta}{\alpha + \left(\beta + 2\right)}}\right) \cdot \frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}
\end{array}
Initial program 91.7%
associate-/l/90.1%
associate-+l+90.1%
+-commutative90.1%
associate-+r+90.1%
associate-+l+90.1%
distribute-rgt1-in90.1%
*-rgt-identity90.1%
distribute-lft-out90.0%
+-commutative90.0%
associate-*l/95.5%
*-commutative95.5%
associate-*r/92.1%
Simplified92.1%
associate-*r/95.5%
+-commutative95.5%
Applied egg-rr95.5%
+-commutative95.5%
*-commutative95.5%
+-commutative95.5%
associate-*r/95.5%
associate-/r*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
add-log-exp89.1%
associate-+r+89.1%
+-commutative89.1%
Applied egg-rr89.1%
Final simplification89.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 9.2e+141)
(* (+ 1.0 alpha) (/ (/ (+ 1.0 beta) t_1) (* t_1 t_0)))
(*
(/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) t_0)
(+ 1.0 (/ (- -1.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 9.2e+141) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_1) / (t_1 * t_0));
} else {
tmp = (((1.0 + alpha) / (beta + (alpha + 2.0))) / t_0) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 9.2d+141) then
tmp = (1.0d0 + alpha) * (((1.0d0 + beta) / t_1) / (t_1 * t_0))
else
tmp = (((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / t_0) * (1.0d0 + (((-1.0d0) - alpha) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 9.2e+141) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_1) / (t_1 * t_0));
} else {
tmp = (((1.0 + alpha) / (beta + (alpha + 2.0))) / t_0) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 9.2e+141: tmp = (1.0 + alpha) * (((1.0 + beta) / t_1) / (t_1 * t_0)) else: tmp = (((1.0 + alpha) / (beta + (alpha + 2.0))) / t_0) * (1.0 + ((-1.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 9.2e+141) tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(1.0 + beta) / t_1) / Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / t_0) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 9.2e+141)
tmp = (1.0 + alpha) * (((1.0 + beta) / t_1) / (t_1 * t_0));
else
tmp = (((1.0 + alpha) / (beta + (alpha + 2.0))) / t_0) * (1.0 + ((-1.0 - alpha) / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 9.2e+141], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 9.2 \cdot 10^{+141}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{\frac{1 + \beta}{t_1}}{t_1 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{t_0} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 9.2000000000000006e141Initial program 98.8%
associate-/l/98.7%
associate-+l+98.7%
+-commutative98.7%
associate-+r+98.7%
associate-+l+98.7%
distribute-rgt1-in98.7%
*-rgt-identity98.7%
distribute-lft-out98.7%
+-commutative98.7%
associate-*l/99.3%
*-commutative99.3%
associate-*r/95.1%
Simplified95.1%
if 9.2000000000000006e141 < beta Initial program 65.4%
associate-/l/57.7%
associate-+l+57.7%
+-commutative57.7%
associate-+r+57.7%
associate-+l+57.7%
distribute-rgt1-in57.7%
*-rgt-identity57.7%
distribute-lft-out57.7%
+-commutative57.7%
associate-*l/81.0%
*-commutative81.0%
associate-*r/81.0%
Simplified81.0%
associate-*r/81.0%
+-commutative81.0%
Applied egg-rr81.0%
+-commutative81.0%
*-commutative81.0%
+-commutative81.0%
associate-*r/81.0%
associate-/r*99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
Simplified99.9%
Taylor expanded in beta around inf 86.6%
mul-1-neg85.7%
unsub-neg85.7%
Simplified86.6%
Final simplification93.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 2.0))))
(if (<= beta 16000000000000.0)
(* (/ (+ 1.0 beta) t_0) (/ 1.0 (* (+ beta 2.0) (+ beta 3.0))))
(*
(/ (/ (+ 1.0 alpha) t_0) (+ alpha (+ beta 3.0)))
(+ 1.0 (/ (- -1.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 16000000000000.0) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = beta + (alpha + 2.0d0)
if (beta <= 16000000000000.0d0) then
tmp = ((1.0d0 + beta) / t_0) * (1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) / (alpha + (beta + 3.0d0))) * (1.0d0 + (((-1.0d0) - alpha) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 16000000000000.0) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) tmp = 0 if beta <= 16000000000000.0: tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0))) else: tmp = (((1.0 + alpha) / t_0) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) tmp = 0.0 if (beta <= 16000000000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(alpha + Float64(beta + 3.0))) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = 0.0;
if (beta <= 16000000000000.0)
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 16000000000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\mathbf{if}\;\beta \leq 16000000000000:\\
\;\;\;\;\frac{1 + \beta}{t_0} \cdot \frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\alpha + \left(\beta + 3\right)} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 1.6e13Initial program 99.8%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*l/99.8%
*-commutative99.8%
associate-*r/94.9%
Simplified94.9%
associate-*r/99.8%
+-commutative99.8%
Applied egg-rr99.8%
+-commutative99.8%
*-commutative99.8%
+-commutative99.8%
associate-*r/99.8%
associate-/r*99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 74.8%
if 1.6e13 < beta Initial program 78.5%
associate-/l/74.1%
associate-+l+74.1%
+-commutative74.1%
associate-+r+74.1%
associate-+l+74.1%
distribute-rgt1-in74.1%
*-rgt-identity74.1%
distribute-lft-out74.1%
+-commutative74.1%
associate-*l/88.4%
*-commutative88.4%
associate-*r/87.5%
Simplified87.5%
associate-*r/88.4%
+-commutative88.4%
Applied egg-rr88.4%
+-commutative88.4%
*-commutative88.4%
+-commutative88.4%
associate-*r/88.4%
associate-/r*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 85.5%
mul-1-neg84.4%
unsub-neg84.4%
Simplified85.5%
Final simplification78.9%
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+14)
(* (/ (+ 1.0 beta) (+ beta 3.0)) (/ (+ 1.0 alpha) (* t_0 t_0)))
(*
(/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0)))
(+ 1.0 (/ (- -1.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3e+14) {
tmp = ((1.0 + beta) / (beta + 3.0)) * ((1.0 + alpha) / (t_0 * t_0));
} else {
tmp = (((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 3d+14) then
tmp = ((1.0d0 + beta) / (beta + 3.0d0)) * ((1.0d0 + alpha) / (t_0 * t_0))
else
tmp = (((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / (alpha + (beta + 3.0d0))) * (1.0d0 + (((-1.0d0) - alpha) / beta))
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+14) {
tmp = ((1.0 + beta) / (beta + 3.0)) * ((1.0 + alpha) / (t_0 * t_0));
} else {
tmp = (((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 3e+14: tmp = ((1.0 + beta) / (beta + 3.0)) * ((1.0 + alpha) / (t_0 * t_0)) else: tmp = (((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta)) 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+14) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 3.0)) * Float64(Float64(1.0 + alpha) / Float64(t_0 * t_0))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / Float64(alpha + Float64(beta + 3.0))) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))); 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+14)
tmp = ((1.0 + beta) / (beta + 3.0)) * ((1.0 + alpha) / (t_0 * t_0));
else
tmp = (((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3e+14], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $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^{+14}:\\
\;\;\;\;\frac{1 + \beta}{\beta + 3} \cdot \frac{1 + \alpha}{t_0 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 3e14Initial program 99.8%
associate-/l/99.7%
associate-/l/94.6%
associate-+l+94.6%
+-commutative94.6%
associate-+r+94.6%
associate-+l+94.6%
distribute-rgt1-in94.6%
*-rgt-identity94.6%
distribute-lft-out94.6%
+-commutative94.6%
times-frac99.8%
Simplified99.8%
Taylor expanded in alpha around 0 83.0%
if 3e14 < beta Initial program 78.3%
associate-/l/73.9%
associate-+l+73.9%
+-commutative73.9%
associate-+r+73.9%
associate-+l+73.9%
distribute-rgt1-in73.9%
*-rgt-identity73.9%
distribute-lft-out73.9%
+-commutative73.9%
associate-*l/88.3%
*-commutative88.3%
associate-*r/87.4%
Simplified87.4%
associate-*r/88.3%
+-commutative88.3%
Applied egg-rr88.3%
+-commutative88.3%
*-commutative88.3%
+-commutative88.3%
associate-*r/88.3%
associate-/r*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 85.3%
mul-1-neg84.4%
unsub-neg84.4%
Simplified85.3%
Final simplification83.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ beta (+ alpha 2.0)))) (* (/ (/ (+ 1.0 alpha) t_0) (+ alpha (+ beta 3.0))) (/ (+ 1.0 beta) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + alpha) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + beta) / t_0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = beta + (alpha + 2.0d0)
code = (((1.0d0 + alpha) / t_0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + beta) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + alpha) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + beta) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return (((1.0 + alpha) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + beta) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + beta) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = (((1.0 + alpha) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + beta) / t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\frac{\frac{1 + \alpha}{t_0}}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \beta}{t_0}
\end{array}
\end{array}
Initial program 91.7%
associate-/l/90.1%
associate-+l+90.1%
+-commutative90.1%
associate-+r+90.1%
associate-+l+90.1%
distribute-rgt1-in90.1%
*-rgt-identity90.1%
distribute-lft-out90.0%
+-commutative90.0%
associate-*l/95.5%
*-commutative95.5%
associate-*r/92.1%
Simplified92.1%
associate-*r/95.5%
+-commutative95.5%
Applied egg-rr95.5%
+-commutative95.5%
*-commutative95.5%
+-commutative95.5%
associate-*r/95.5%
associate-/r*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5e+15)
(*
(/ (+ 1.0 beta) (+ beta (+ alpha 2.0)))
(/ 1.0 (* (+ beta 2.0) (+ beta 3.0))))
(*
(+ 1.0 (/ (- -1.0 alpha) beta))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+15) {
tmp = ((1.0 + beta) / (beta + (alpha + 2.0))) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((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 <= 5d+15) then
tmp = ((1.0d0 + beta) / (beta + (alpha + 2.0d0))) * (1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = (1.0d0 + (((-1.0d0) - alpha) / beta)) * (((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 <= 5e+15) {
tmp = ((1.0 + beta) / (beta + (alpha + 2.0))) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (alpha + (beta + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5e+15: tmp = ((1.0 + beta) / (beta + (alpha + 2.0))) * (1.0 / ((beta + 2.0) * (beta + 3.0))) else: tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (alpha + (beta + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + Float64(alpha + 2.0))) * Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) * 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 <= 5e+15)
tmp = ((1.0 + beta) / (beta + (alpha + 2.0))) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
else
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((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, 5e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{\beta + \left(\alpha + 2\right)} \cdot \frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{-1 - \alpha}{\beta}\right) \cdot \frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5e15Initial program 99.8%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*l/99.8%
*-commutative99.8%
associate-*r/94.9%
Simplified94.9%
associate-*r/99.8%
+-commutative99.8%
Applied egg-rr99.8%
+-commutative99.8%
*-commutative99.8%
+-commutative99.8%
associate-*r/99.8%
associate-/r*99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 75.0%
if 5e15 < beta Initial program 78.3%
associate-/l/73.9%
associate-+l+73.9%
+-commutative73.9%
associate-+r+73.9%
associate-+l+73.9%
distribute-rgt1-in73.9%
*-rgt-identity73.9%
distribute-lft-out73.9%
+-commutative73.9%
associate-*l/88.3%
*-commutative88.3%
associate-*r/87.4%
Simplified87.4%
associate-*r/88.3%
+-commutative88.3%
Applied egg-rr88.3%
+-commutative88.3%
*-commutative88.3%
+-commutative88.3%
associate-*r/88.3%
associate-/r*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 85.0%
Taylor expanded in beta around inf 84.4%
mul-1-neg84.4%
unsub-neg84.4%
Simplified84.4%
Final simplification78.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.2) (/ (/ (+ 1.0 beta) (+ 6.0 (* beta 5.0))) (+ beta 2.0)) (/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = ((1.0 + beta) / (6.0 + (beta * 5.0))) / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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 <= 2.2d0) then
tmp = ((1.0d0 + beta) / (6.0d0 + (beta * 5.0d0))) / (beta + 2.0d0)
else
tmp = ((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / (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 <= 2.2) {
tmp = ((1.0 + beta) / (6.0 + (beta * 5.0))) / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = ((1.0 + beta) / (6.0 + (beta * 5.0))) / (beta + 2.0) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(6.0 + Float64(beta * 5.0))) / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / 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 <= 2.2)
tmp = ((1.0 + beta) / (6.0 + (beta * 5.0))) / (beta + 2.0);
else
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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, 2.2], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $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 2.2:\\
\;\;\;\;\frac{\frac{1 + \beta}{6 + \beta \cdot 5}}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.8%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*r/99.8%
associate-*r/99.7%
Simplified99.7%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 99.1%
*-commutative99.1%
Simplified99.1%
Taylor expanded in alpha around 0 73.8%
associate-/r*73.8%
*-commutative73.8%
Simplified73.8%
if 2.2000000000000002 < beta Initial program 79.0%
associate-/l/74.6%
associate-+l+74.6%
+-commutative74.6%
associate-+r+74.6%
associate-+l+74.6%
distribute-rgt1-in74.6%
*-rgt-identity74.6%
distribute-lft-out74.6%
+-commutative74.6%
associate-*l/88.7%
*-commutative88.7%
associate-*r/87.7%
Simplified87.7%
associate-*r/88.7%
+-commutative88.7%
Applied egg-rr88.7%
associate-/r*99.8%
associate-*r/79.0%
+-commutative79.0%
+-commutative79.0%
*-commutative79.0%
+-commutative79.0%
+-commutative79.0%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 83.6%
Final simplification77.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.6) (/ (+ 1.0 beta) (* (+ beta 2.0) (+ 6.0 (* beta 5.0)))) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * 5.0)));
} else {
tmp = (1.0 + alpha) / (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.6d0) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * (6.0d0 + (beta * 5.0d0)))
else
tmp = (1.0d0 + alpha) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * 5.0)));
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.6: tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * 5.0))) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.6) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(6.0 + Float64(beta * 5.0)))); else tmp = Float64(Float64(1.0 + alpha) / 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.6)
tmp = (1.0 + beta) / ((beta + 2.0) * (6.0 + (beta * 5.0)));
else
tmp = (1.0 + alpha) / (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.6], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.6:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.5999999999999996Initial program 99.8%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*r/99.8%
associate-*r/99.7%
Simplified99.7%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 73.8%
if 6.5999999999999996 < beta Initial program 79.0%
associate-/l/74.6%
associate-+l+74.6%
+-commutative74.6%
associate-+r+74.6%
associate-+l+74.6%
distribute-rgt1-in74.6%
*-rgt-identity74.6%
distribute-lft-out74.6%
+-commutative74.6%
associate-*l/88.7%
*-commutative88.7%
associate-*r/87.7%
Simplified87.7%
associate-*r/88.7%
+-commutative88.7%
Applied egg-rr88.7%
+-commutative88.7%
*-commutative88.7%
+-commutative88.7%
associate-*r/88.6%
associate-/r*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 83.6%
Taylor expanded in beta around inf 83.0%
mul-1-neg83.0%
unsub-neg83.0%
Simplified83.0%
Taylor expanded in beta around inf 79.3%
unpow279.3%
Simplified79.3%
Final simplification75.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.6) (/ (/ (+ 1.0 beta) (+ 6.0 (* beta 5.0))) (+ beta 2.0)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = ((1.0 + beta) / (6.0 + (beta * 5.0))) / (beta + 2.0);
} else {
tmp = (1.0 + alpha) / (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.6d0) then
tmp = ((1.0d0 + beta) / (6.0d0 + (beta * 5.0d0))) / (beta + 2.0d0)
else
tmp = (1.0d0 + alpha) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = ((1.0 + beta) / (6.0 + (beta * 5.0))) / (beta + 2.0);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.6: tmp = ((1.0 + beta) / (6.0 + (beta * 5.0))) / (beta + 2.0) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.6) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(6.0 + Float64(beta * 5.0))) / Float64(beta + 2.0)); else tmp = Float64(Float64(1.0 + alpha) / 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.6)
tmp = ((1.0 + beta) / (6.0 + (beta * 5.0))) / (beta + 2.0);
else
tmp = (1.0 + alpha) / (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.6], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.6:\\
\;\;\;\;\frac{\frac{1 + \beta}{6 + \beta \cdot 5}}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.5999999999999996Initial program 99.8%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*r/99.8%
associate-*r/99.7%
Simplified99.7%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 99.1%
*-commutative99.1%
Simplified99.1%
Taylor expanded in alpha around 0 73.8%
associate-/r*73.8%
*-commutative73.8%
Simplified73.8%
if 6.5999999999999996 < beta Initial program 79.0%
associate-/l/74.6%
associate-+l+74.6%
+-commutative74.6%
associate-+r+74.6%
associate-+l+74.6%
distribute-rgt1-in74.6%
*-rgt-identity74.6%
distribute-lft-out74.6%
+-commutative74.6%
associate-*l/88.7%
*-commutative88.7%
associate-*r/87.7%
Simplified87.7%
associate-*r/88.7%
+-commutative88.7%
Applied egg-rr88.7%
+-commutative88.7%
*-commutative88.7%
+-commutative88.7%
associate-*r/88.6%
associate-/r*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 83.6%
Taylor expanded in beta around inf 83.0%
mul-1-neg83.0%
unsub-neg83.0%
Simplified83.0%
Taylor expanded in beta around inf 79.3%
unpow279.3%
Simplified79.3%
Final simplification75.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 3.4e+142) (/ 0.16666666666666666 beta) (/ 1.0 (* alpha alpha))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 3.4e+142) {
tmp = 0.16666666666666666 / beta;
} else {
tmp = 1.0 / (alpha * 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 (alpha <= 3.4d+142) then
tmp = 0.16666666666666666d0 / beta
else
tmp = 1.0d0 / (alpha * alpha)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= 3.4e+142) {
tmp = 0.16666666666666666 / beta;
} else {
tmp = 1.0 / (alpha * alpha);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 3.4e+142: tmp = 0.16666666666666666 / beta else: tmp = 1.0 / (alpha * alpha) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 3.4e+142) tmp = Float64(0.16666666666666666 / beta); else tmp = Float64(1.0 / Float64(alpha * alpha)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (alpha <= 3.4e+142)
tmp = 0.16666666666666666 / beta;
else
tmp = 1.0 / (alpha * 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[alpha, 3.4e+142], N[(0.16666666666666666 / beta), $MachinePrecision], N[(1.0 / N[(alpha * alpha), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 3.4 \cdot 10^{+142}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\alpha \cdot \alpha}\\
\end{array}
\end{array}
if alpha < 3.3999999999999998e142Initial program 98.0%
associate-/l/96.2%
associate-+l+96.2%
+-commutative96.2%
associate-+r+96.2%
associate-+l+96.2%
distribute-rgt1-in96.2%
*-rgt-identity96.2%
distribute-lft-out96.2%
+-commutative96.2%
associate-*r/98.0%
associate-*r/91.4%
Simplified91.4%
Taylor expanded in beta around inf 27.9%
Taylor expanded in alpha around 0 25.4%
associate-/r*32.6%
+-commutative32.6%
Simplified32.6%
Taylor expanded in beta around 0 4.8%
if 3.3999999999999998e142 < alpha Initial program 53.5%
associate-/l/52.8%
associate-/l/45.3%
associate-+l+45.3%
+-commutative45.3%
associate-+r+45.3%
associate-+l+45.3%
distribute-rgt1-in45.3%
*-rgt-identity45.3%
distribute-lft-out45.3%
+-commutative45.3%
times-frac80.1%
Simplified80.1%
Taylor expanded in alpha around inf 77.4%
+-commutative77.4%
unpow277.4%
Simplified77.4%
Taylor expanded in beta around 0 77.7%
unpow277.7%
Simplified77.7%
Final simplification15.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (+ 1.0 alpha) (* beta beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return (1.0 + alpha) / (beta * beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = (1.0d0 + alpha) / (beta * beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return (1.0 + alpha) / (beta * beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return (1.0 + alpha) / (beta * beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(1.0 + alpha) / Float64(beta * beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = (1.0 + alpha) / (beta * beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1 + \alpha}{\beta \cdot \beta}
\end{array}
Initial program 91.7%
associate-/l/90.1%
associate-+l+90.1%
+-commutative90.1%
associate-+r+90.1%
associate-+l+90.1%
distribute-rgt1-in90.1%
*-rgt-identity90.1%
distribute-lft-out90.0%
+-commutative90.0%
associate-*l/95.5%
*-commutative95.5%
associate-*r/92.1%
Simplified92.1%
associate-*r/95.5%
+-commutative95.5%
Applied egg-rr95.5%
+-commutative95.5%
*-commutative95.5%
+-commutative95.5%
associate-*r/95.5%
associate-/r*99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 34.4%
Taylor expanded in beta around inf 32.7%
mul-1-neg32.7%
unsub-neg32.7%
Simplified32.7%
Taylor expanded in beta around inf 32.9%
unpow232.9%
Simplified32.9%
Final simplification32.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (beta * beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 1.0d0 / (beta * beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (beta * beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot \beta}
\end{array}
Initial program 91.7%
associate-/l/90.1%
associate-+l+90.1%
+-commutative90.1%
associate-+r+90.1%
associate-+l+90.1%
distribute-rgt1-in90.1%
*-rgt-identity90.1%
distribute-lft-out90.0%
+-commutative90.0%
associate-*r/95.5%
associate-*r/89.8%
Simplified89.8%
Taylor expanded in beta around inf 29.1%
Taylor expanded in alpha around 0 25.5%
associate-/r*31.2%
+-commutative31.2%
Simplified31.2%
Taylor expanded in beta around inf 31.4%
unpow231.4%
Simplified31.4%
Final simplification31.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / 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.16666666666666666d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta}
\end{array}
Initial program 91.7%
associate-/l/90.1%
associate-+l+90.1%
+-commutative90.1%
associate-+r+90.1%
associate-+l+90.1%
distribute-rgt1-in90.1%
*-rgt-identity90.1%
distribute-lft-out90.0%
+-commutative90.0%
associate-*r/95.5%
associate-*r/89.8%
Simplified89.8%
Taylor expanded in beta around inf 29.1%
Taylor expanded in alpha around 0 25.5%
associate-/r*31.2%
+-commutative31.2%
Simplified31.2%
Taylor expanded in beta around 0 4.8%
Final simplification4.8%
herbie shell --seed 2023194
(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)))