
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t_1 \cdot t_1\\
\frac{\frac{t_0 \cdot \left(\beta \cdot \alpha + t_0\right)}{t_2}}{t_2 - 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* i (+ (+ alpha beta) i)))
(t_1 (+ (+ alpha beta) (* 2.0 i)))
(t_2 (* t_1 t_1)))
(/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))
double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: t_0
real(8) :: t_1
real(8) :: t_2
t_0 = i * ((alpha + beta) + i)
t_1 = (alpha + beta) + (2.0d0 * i)
t_2 = t_1 * t_1
code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function
public static double code(double alpha, double beta, double i) {
double t_0 = i * ((alpha + beta) + i);
double t_1 = (alpha + beta) + (2.0 * i);
double t_2 = t_1 * t_1;
return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}
def code(alpha, beta, i): t_0 = i * ((alpha + beta) + i) t_1 = (alpha + beta) + (2.0 * i) t_2 = t_1 * t_1 return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)
function code(alpha, beta, i) t_0 = Float64(i * Float64(Float64(alpha + beta) + i)) t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i)) t_2 = Float64(t_1 * t_1) return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0)) end
function tmp = code(alpha, beta, i) t_0 = i * ((alpha + beta) + i); t_1 = (alpha + beta) + (2.0 * i); t_2 = t_1 * t_1; tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0); end
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\
t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\
t_2 := t_1 \cdot t_1\\
\frac{\frac{t_0 \cdot \left(\beta \cdot \alpha + t_0\right)}{t_2}}{t_2 - 1}
\end{array}
\end{array}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 7.8e+112)
0.0625
(if (<= beta 6e+141)
(/ i (/ (pow beta 2.0) (+ i alpha)))
(if (<= beta 1.6e+146) 0.0625 (* (/ i beta) (/ i beta))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.8e+112) {
tmp = 0.0625;
} else if (beta <= 6e+141) {
tmp = i / (pow(beta, 2.0) / (i + alpha));
} else if (beta <= 1.6e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 7.8d+112) then
tmp = 0.0625d0
else if (beta <= 6d+141) then
tmp = i / ((beta ** 2.0d0) / (i + alpha))
else if (beta <= 1.6d+146) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.8e+112) {
tmp = 0.0625;
} else if (beta <= 6e+141) {
tmp = i / (Math.pow(beta, 2.0) / (i + alpha));
} else if (beta <= 1.6e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7.8e+112: tmp = 0.0625 elif beta <= 6e+141: tmp = i / (math.pow(beta, 2.0) / (i + alpha)) elif beta <= 1.6e+146: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7.8e+112) tmp = 0.0625; elseif (beta <= 6e+141) tmp = Float64(i / Float64((beta ^ 2.0) / Float64(i + alpha))); elseif (beta <= 1.6e+146) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 7.8e+112)
tmp = 0.0625;
elseif (beta <= 6e+141)
tmp = i / ((beta ^ 2.0) / (i + alpha));
elseif (beta <= 1.6e+146)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 7.8e+112], 0.0625, If[LessEqual[beta, 6e+141], N[(i / N[(N[Power[beta, 2.0], $MachinePrecision] / N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.6e+146], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.8 \cdot 10^{+112}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 6 \cdot 10^{+141}:\\
\;\;\;\;\frac{i}{\frac{{\beta}^{2}}{i + \alpha}}\\
\mathbf{elif}\;\beta \leq 1.6 \cdot 10^{+146}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 7.79999999999999937e112 or 5.9999999999999998e141 < beta < 1.6e146Initial program 16.6%
associate-/l/14.0%
associate-*l*14.0%
times-frac25.9%
Simplified25.9%
Taylor expanded in i around inf 82.0%
if 7.79999999999999937e112 < beta < 5.9999999999999998e141Initial program 1.6%
associate-/l/0.0%
associate-*l*0.0%
times-frac23.1%
Simplified23.1%
Taylor expanded in beta around inf 67.4%
associate-/l*67.6%
Simplified67.6%
if 1.6e146 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 15.9%
associate-/l*17.7%
Simplified17.7%
Taylor expanded in alpha around 0 17.7%
add-sqr-sqrt17.7%
sqrt-div17.7%
sqrt-div17.7%
unpow217.7%
sqrt-prod17.7%
add-sqr-sqrt17.7%
associate-/l*17.7%
add-sqr-sqrt17.7%
sqrt-div17.7%
sqrt-div17.7%
unpow217.7%
sqrt-prod58.8%
add-sqr-sqrt58.9%
associate-/l*58.8%
add-sqr-sqrt58.8%
Applied egg-rr58.8%
Final simplification77.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* i (+ i (+ alpha beta))))
(t_3 (+ alpha (+ i beta)))
(t_4 (+ beta (fma i 2.0 alpha)))
(t_5 (+ t_1 -1.0))
(t_6 (* 0.125 (/ beta i))))
(if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) t_5) INFINITY)
(/ (* (/ (fma i t_3 (* alpha beta)) t_4) (/ i (/ t_4 t_3))) t_5)
(- (+ 0.0625 t_6) t_6))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = i * (i + (alpha + beta));
double t_3 = alpha + (i + beta);
double t_4 = beta + fma(i, 2.0, alpha);
double t_5 = t_1 + -1.0;
double t_6 = 0.125 * (beta / i);
double tmp;
if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / t_5) <= ((double) INFINITY)) {
tmp = ((fma(i, t_3, (alpha * beta)) / t_4) * (i / (t_4 / t_3))) / t_5;
} else {
tmp = (0.0625 + t_6) - t_6;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(i * Float64(i + Float64(alpha + beta))) t_3 = Float64(alpha + Float64(i + beta)) t_4 = Float64(beta + fma(i, 2.0, alpha)) t_5 = Float64(t_1 + -1.0) t_6 = Float64(0.125 * Float64(beta / i)) tmp = 0.0 if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / t_5) <= Inf) tmp = Float64(Float64(Float64(fma(i, t_3, Float64(alpha * beta)) / t_4) * Float64(i / Float64(t_4 / t_3))) / t_5); else tmp = Float64(Float64(0.0625 + t_6) - t_6); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$6 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$5), $MachinePrecision], Infinity], N[(N[(N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision] * N[(i / N[(t$95$4 / t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[(0.0625 + t$95$6), $MachinePrecision] - t$95$6), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_3 := \alpha + \left(i + \beta\right)\\
t_4 := \beta + \mathsf{fma}\left(i, 2, \alpha\right)\\
t_5 := t_1 + -1\\
t_6 := 0.125 \cdot \frac{\beta}{i}\\
\mathbf{if}\;\frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_5} \leq \infty:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, t_3, \alpha \cdot \beta\right)}{t_4} \cdot \frac{i}{\frac{t_4}{t_3}}}{t_5}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_6\right) - t_6\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 36.5%
times-frac99.7%
associate-+l+99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
+-commutative99.7%
+-commutative99.7%
*-commutative99.7%
fma-udef99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-def99.7%
Applied egg-rr99.7%
*-commutative99.7%
*-commutative99.7%
associate-/l*99.8%
Simplified99.8%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 74.7%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in i around 0 69.7%
Taylor expanded in alpha around 0 71.2%
Final simplification81.8%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (+ t_1 -1.0))
(t_3 (* 0.125 (/ beta i)))
(t_4 (* i (+ i (+ alpha beta))))
(t_5 (+ alpha (+ i beta))))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) INFINITY)
(/
(*
i
(*
t_5
(* (fma i t_5 (* alpha beta)) (pow (+ beta (fma i 2.0 alpha)) -2.0))))
t_2)
(- (+ 0.0625 t_3) t_3))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = t_1 + -1.0;
double t_3 = 0.125 * (beta / i);
double t_4 = i * (i + (alpha + beta));
double t_5 = alpha + (i + beta);
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
tmp = (i * (t_5 * (fma(i, t_5, (alpha * beta)) * pow((beta + fma(i, 2.0, alpha)), -2.0)))) / t_2;
} else {
tmp = (0.0625 + t_3) - t_3;
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(t_1 + -1.0) t_3 = Float64(0.125 * Float64(beta / i)) t_4 = Float64(i * Float64(i + Float64(alpha + beta))) t_5 = Float64(alpha + Float64(i + beta)) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= Inf) tmp = Float64(Float64(i * Float64(t_5 * Float64(fma(i, t_5, Float64(alpha * beta)) * (Float64(beta + fma(i, 2.0, alpha)) ^ -2.0)))) / t_2); else tmp = Float64(Float64(0.0625 + t_3) - t_3); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(i * N[(t$95$5 * N[(N[(i * t$95$5 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] * N[Power[N[(beta + N[(i * 2.0 + alpha), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + t$95$3), $MachinePrecision] - t$95$3), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := t_1 + -1\\
t_3 := 0.125 \cdot \frac{\beta}{i}\\
t_4 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
t_5 := \alpha + \left(i + \beta\right)\\
\mathbf{if}\;\frac{\frac{t_4 \cdot \left(t_4 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\
\;\;\;\;\frac{i \cdot \left(t_5 \cdot \left(\mathsf{fma}\left(i, t_5, \alpha \cdot \beta\right) \cdot {\left(\beta + \mathsf{fma}\left(i, 2, \alpha\right)\right)}^{-2}\right)\right)}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_3\right) - t_3\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 36.5%
expm1-log1p-u34.0%
expm1-udef34.0%
Applied egg-rr34.0%
expm1-def34.0%
expm1-log1p36.4%
associate-*r*58.8%
associate-*l*99.5%
*-commutative99.5%
Simplified99.5%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 74.7%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in i around 0 69.7%
Taylor expanded in alpha around 0 71.2%
Final simplification81.7%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
(t_1 (* t_0 t_0))
(t_2 (* 0.125 (/ beta i)))
(t_3 (+ t_1 -1.0))
(t_4 (* i (+ i (+ alpha beta)))))
(if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_3) INFINITY)
(/
(*
i
(*
(+ alpha (+ i beta))
(/ (* i (+ i beta)) (pow (+ beta (* i 2.0)) 2.0))))
t_3)
(- (+ 0.0625 t_2) t_2))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = 0.125 * (beta / i);
double t_3 = t_1 + -1.0;
double t_4 = i * (i + (alpha + beta));
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_3) <= ((double) INFINITY)) {
tmp = (i * ((alpha + (i + beta)) * ((i * (i + beta)) / pow((beta + (i * 2.0)), 2.0)))) / t_3;
} else {
tmp = (0.0625 + t_2) - t_2;
}
return tmp;
}
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = (alpha + beta) + (i * 2.0);
double t_1 = t_0 * t_0;
double t_2 = 0.125 * (beta / i);
double t_3 = t_1 + -1.0;
double t_4 = i * (i + (alpha + beta));
double tmp;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_3) <= Double.POSITIVE_INFINITY) {
tmp = (i * ((alpha + (i + beta)) * ((i * (i + beta)) / Math.pow((beta + (i * 2.0)), 2.0)))) / t_3;
} else {
tmp = (0.0625 + t_2) - t_2;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = (alpha + beta) + (i * 2.0) t_1 = t_0 * t_0 t_2 = 0.125 * (beta / i) t_3 = t_1 + -1.0 t_4 = i * (i + (alpha + beta)) tmp = 0 if (((t_4 * (t_4 + (alpha * beta))) / t_1) / t_3) <= math.inf: tmp = (i * ((alpha + (i + beta)) * ((i * (i + beta)) / math.pow((beta + (i * 2.0)), 2.0)))) / t_3 else: tmp = (0.0625 + t_2) - t_2 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0)) t_1 = Float64(t_0 * t_0) t_2 = Float64(0.125 * Float64(beta / i)) t_3 = Float64(t_1 + -1.0) t_4 = Float64(i * Float64(i + Float64(alpha + beta))) tmp = 0.0 if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_3) <= Inf) tmp = Float64(Float64(i * Float64(Float64(alpha + Float64(i + beta)) * Float64(Float64(i * Float64(i + beta)) / (Float64(beta + Float64(i * 2.0)) ^ 2.0)))) / t_3); else tmp = Float64(Float64(0.0625 + t_2) - t_2); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = (alpha + beta) + (i * 2.0);
t_1 = t_0 * t_0;
t_2 = 0.125 * (beta / i);
t_3 = t_1 + -1.0;
t_4 = i * (i + (alpha + beta));
tmp = 0.0;
if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_3) <= Inf)
tmp = (i * ((alpha + (i + beta)) * ((i * (i + beta)) / ((beta + (i * 2.0)) ^ 2.0)))) / t_3;
else
tmp = (0.0625 + t_2) - t_2;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$4 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$3), $MachinePrecision], Infinity], N[(N[(i * N[(N[(alpha + N[(i + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[(0.0625 + t$95$2), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := 0.125 \cdot \frac{\beta}{i}\\
t_3 := t_1 + -1\\
t_4 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\
\mathbf{if}\;\frac{\frac{t_4 \cdot \left(t_4 + \alpha \cdot \beta\right)}{t_1}}{t_3} \leq \infty:\\
\;\;\;\;\frac{i \cdot \left(\left(\alpha + \left(i + \beta\right)\right) \cdot \frac{i \cdot \left(i + \beta\right)}{{\left(\beta + i \cdot 2\right)}^{2}}\right)}{t_3}\\
\mathbf{else}:\\
\;\;\;\;\left(0.0625 + t_2\right) - t_2\\
\end{array}
\end{array}
if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) < +inf.0Initial program 36.5%
expm1-log1p-u34.0%
expm1-udef34.0%
Applied egg-rr34.0%
expm1-def34.0%
expm1-log1p36.4%
associate-*r*58.8%
associate-*l*99.5%
*-commutative99.5%
Simplified99.5%
Taylor expanded in alpha around 0 90.2%
if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) 1)) Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 74.7%
Taylor expanded in alpha around 0 69.7%
Taylor expanded in i around 0 69.7%
Taylor expanded in alpha around 0 71.2%
Final simplification78.2%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 7.8e+112)
0.0625
(if (<= beta 2.75e+141)
(* (pow beta -2.0) (* i (+ i alpha)))
(if (<= beta 1.9e+146) 0.0625 (* (/ i beta) (/ i beta))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.8e+112) {
tmp = 0.0625;
} else if (beta <= 2.75e+141) {
tmp = pow(beta, -2.0) * (i * (i + alpha));
} else if (beta <= 1.9e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 7.8d+112) then
tmp = 0.0625d0
else if (beta <= 2.75d+141) then
tmp = (beta ** (-2.0d0)) * (i * (i + alpha))
else if (beta <= 1.9d+146) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.8e+112) {
tmp = 0.0625;
} else if (beta <= 2.75e+141) {
tmp = Math.pow(beta, -2.0) * (i * (i + alpha));
} else if (beta <= 1.9e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7.8e+112: tmp = 0.0625 elif beta <= 2.75e+141: tmp = math.pow(beta, -2.0) * (i * (i + alpha)) elif beta <= 1.9e+146: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7.8e+112) tmp = 0.0625; elseif (beta <= 2.75e+141) tmp = Float64((beta ^ -2.0) * Float64(i * Float64(i + alpha))); elseif (beta <= 1.9e+146) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 7.8e+112)
tmp = 0.0625;
elseif (beta <= 2.75e+141)
tmp = (beta ^ -2.0) * (i * (i + alpha));
elseif (beta <= 1.9e+146)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 7.8e+112], 0.0625, If[LessEqual[beta, 2.75e+141], N[(N[Power[beta, -2.0], $MachinePrecision] * N[(i * N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.9e+146], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.8 \cdot 10^{+112}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 2.75 \cdot 10^{+141}:\\
\;\;\;\;{\beta}^{-2} \cdot \left(i \cdot \left(i + \alpha\right)\right)\\
\mathbf{elif}\;\beta \leq 1.9 \cdot 10^{+146}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 7.79999999999999937e112 or 2.74999999999999984e141 < beta < 1.8999999999999999e146Initial program 16.6%
associate-/l/14.0%
associate-*l*14.0%
times-frac25.9%
Simplified25.9%
Taylor expanded in i around inf 82.0%
if 7.79999999999999937e112 < beta < 2.74999999999999984e141Initial program 1.6%
associate-/l/0.0%
associate-*l*0.0%
times-frac23.1%
Simplified23.1%
Taylor expanded in beta around inf 67.4%
associate-/l*67.6%
Simplified67.6%
clear-num67.8%
inv-pow67.8%
Applied egg-rr67.8%
unpow-167.8%
associate-/l/67.3%
Simplified67.3%
associate-/r/67.4%
pow-flip67.5%
metadata-eval67.5%
+-commutative67.5%
Applied egg-rr67.5%
if 1.8999999999999999e146 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 15.9%
associate-/l*17.7%
Simplified17.7%
Taylor expanded in alpha around 0 17.7%
add-sqr-sqrt17.7%
sqrt-div17.7%
sqrt-div17.7%
unpow217.7%
sqrt-prod17.7%
add-sqr-sqrt17.7%
associate-/l*17.7%
add-sqr-sqrt17.7%
sqrt-div17.7%
sqrt-div17.7%
unpow217.7%
sqrt-prod58.8%
add-sqr-sqrt58.9%
associate-/l*58.8%
add-sqr-sqrt58.8%
Applied egg-rr58.8%
Final simplification77.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7.8e+112) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.8e+112) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 7.8d+112) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.8e+112) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7.8e+112: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7.8e+112) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 7.8e+112)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 7.8e+112], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.8 \cdot 10^{+112}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 7.79999999999999937e112Initial program 16.9%
associate-/l/14.3%
associate-*l*14.2%
times-frac26.4%
Simplified26.4%
Taylor expanded in i around inf 82.8%
if 7.79999999999999937e112 < beta Initial program 0.3%
associate-/l/0.0%
associate-*l*0.0%
times-frac4.1%
Simplified4.1%
Taylor expanded in beta around inf 24.0%
associate-/l*25.4%
Simplified25.4%
Taylor expanded in alpha around 0 23.9%
add-sqr-sqrt23.9%
sqrt-div23.9%
sqrt-div23.8%
unpow223.8%
sqrt-prod23.8%
add-sqr-sqrt23.8%
associate-/l*23.9%
add-sqr-sqrt23.9%
sqrt-div23.9%
sqrt-div23.8%
unpow223.8%
sqrt-prod54.6%
add-sqr-sqrt54.7%
associate-/l*54.6%
add-sqr-sqrt54.6%
Applied egg-rr54.6%
Final simplification77.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.1e+246) 0.0625 0.0))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.1e+246) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
real(8) :: tmp
if (beta <= 1.1d+246) then
tmp = 0.0625d0
else
tmp = 0.0d0
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.1e+246) {
tmp = 0.0625;
} else {
tmp = 0.0;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.1e+246: tmp = 0.0625 else: tmp = 0.0 return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.1e+246) tmp = 0.0625; else tmp = 0.0; end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.1e+246)
tmp = 0.0625;
else
tmp = 0.0;
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.1e+246], 0.0625, 0.0]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.1 \cdot 10^{+246}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;0\\
\end{array}
\end{array}
if beta < 1.09999999999999994e246Initial program 14.5%
associate-/l/12.1%
associate-*l*12.1%
times-frac23.3%
Simplified23.3%
Taylor expanded in i around inf 75.9%
if 1.09999999999999994e246 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in i around inf 42.9%
Taylor expanded in i around 0 36.8%
div-sub36.8%
distribute-lft-in36.8%
associate-*r*36.8%
metadata-eval36.8%
associate-*r/36.8%
associate-*r/36.8%
+-inverses36.8%
Simplified36.8%
Final simplification73.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0;
}
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8), intent (in) :: i
code = 0.0d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0
\end{array}
Initial program 13.6%
associate-/l/11.4%
associate-*l*11.3%
times-frac21.8%
Simplified21.8%
Taylor expanded in i around inf 76.4%
Taylor expanded in i around 0 8.2%
div-sub8.2%
distribute-lft-in8.2%
associate-*r*8.2%
metadata-eval8.2%
associate-*r/8.2%
associate-*r/8.2%
+-inverses8.2%
Simplified8.2%
Final simplification8.2%
herbie shell --seed 2024024
(FPCore (alpha beta i)
:name "Octave 3.8, jcobi/4"
:precision binary64
:pre (and (and (> alpha -1.0) (> beta -1.0)) (> i 1.0))
(/ (/ (* (* i (+ (+ alpha beta) i)) (+ (* beta alpha) (* i (+ (+ alpha beta) i)))) (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i)))) (- (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i))) 1.0)))