
(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 12 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
(let* ((t_0 (fma 2.0 i (+ alpha beta))))
(*
(/ (* (+ i beta) (/ i (fma i 2.0 beta))) (- (fma i 2.0 beta) 1.0))
(/ (* (/ i t_0) (+ i (+ alpha beta))) (+ 1.0 t_0)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(2.0, i, (alpha + beta));
return (((i + beta) * (i / fma(i, 2.0, beta))) / (fma(i, 2.0, beta) - 1.0)) * (((i / t_0) * (i + (alpha + beta))) / (1.0 + t_0));
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(2.0, i, Float64(alpha + beta)) return Float64(Float64(Float64(Float64(i + beta) * Float64(i / fma(i, 2.0, beta))) / Float64(fma(i, 2.0, beta) - 1.0)) * Float64(Float64(Float64(i / t_0) * Float64(i + Float64(alpha + beta))) / Float64(1.0 + t_0))) 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[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(i + beta), $MachinePrecision] * N[(i / N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(i * 2.0 + beta), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i / t$95$0), $MachinePrecision] * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
\frac{\left(i + \beta\right) \cdot \frac{i}{\mathsf{fma}\left(i, 2, \beta\right)}}{\mathsf{fma}\left(i, 2, \beta\right) - 1} \cdot \frac{\frac{i}{t\_0} \cdot \left(i + \left(\alpha + \beta\right)\right)}{1 + t\_0}
\end{array}
\end{array}
Initial program 19.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6419.2
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6419.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6419.2
Applied rewrites19.2%
Applied rewrites46.3%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f6439.1
Applied rewrites39.1%
Applied rewrites85.9%
Final simplification85.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 (fma 2.0 i (+ alpha beta))))
(*
(* (/ i (- (fma i 2.0 beta) 1.0)) (/ (+ i beta) (fma i 2.0 beta)))
(/ (* (/ i t_0) (+ i (+ alpha beta))) (+ 1.0 t_0)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(2.0, i, (alpha + beta));
return ((i / (fma(i, 2.0, beta) - 1.0)) * ((i + beta) / fma(i, 2.0, beta))) * (((i / t_0) * (i + (alpha + beta))) / (1.0 + t_0));
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(2.0, i, Float64(alpha + beta)) return Float64(Float64(Float64(i / Float64(fma(i, 2.0, beta) - 1.0)) * Float64(Float64(i + beta) / fma(i, 2.0, beta))) * Float64(Float64(Float64(i / t_0) * Float64(i + Float64(alpha + beta))) / Float64(1.0 + t_0))) 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[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(i / N[(N[(i * 2.0 + beta), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i / t$95$0), $MachinePrecision] * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
\left(\frac{i}{\mathsf{fma}\left(i, 2, \beta\right) - 1} \cdot \frac{i + \beta}{\mathsf{fma}\left(i, 2, \beta\right)}\right) \cdot \frac{\frac{i}{t\_0} \cdot \left(i + \left(\alpha + \beta\right)\right)}{1 + t\_0}
\end{array}
\end{array}
Initial program 19.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6419.2
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6419.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6419.2
Applied rewrites19.2%
Applied rewrites46.3%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f6439.1
Applied rewrites39.1%
Applied rewrites85.9%
Final simplification85.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 (fma 2.0 i (+ alpha beta))))
(if (<= beta 3.6e+216)
(-
(fma 0.0625 (/ (* 2.0 (+ alpha beta)) i) 0.0625)
(* (/ (+ alpha beta) i) 0.125))
(*
(/ (+ i alpha) (- t_0 1.0))
(/ (* (/ i t_0) (+ i (+ alpha beta))) (+ 1.0 t_0))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(2.0, i, (alpha + beta));
double tmp;
if (beta <= 3.6e+216) {
tmp = fma(0.0625, ((2.0 * (alpha + beta)) / i), 0.0625) - (((alpha + beta) / i) * 0.125);
} else {
tmp = ((i + alpha) / (t_0 - 1.0)) * (((i / t_0) * (i + (alpha + beta))) / (1.0 + t_0));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(2.0, i, Float64(alpha + beta)) tmp = 0.0 if (beta <= 3.6e+216) tmp = Float64(fma(0.0625, Float64(Float64(2.0 * Float64(alpha + beta)) / i), 0.0625) - Float64(Float64(Float64(alpha + beta) / i) * 0.125)); else tmp = Float64(Float64(Float64(i + alpha) / Float64(t_0 - 1.0)) * Float64(Float64(Float64(i / t_0) * Float64(i + Float64(alpha + beta))) / Float64(1.0 + t_0))); 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[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.6e+216], N[(N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] + 0.0625), $MachinePrecision] - N[(N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / N[(t$95$0 - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i / t$95$0), $MachinePrecision] * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+216}:\\
\;\;\;\;\mathsf{fma}\left(0.0625, \frac{2 \cdot \left(\alpha + \beta\right)}{i}, 0.0625\right) - \frac{\alpha + \beta}{i} \cdot 0.125\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{t\_0 - 1} \cdot \frac{\frac{i}{t\_0} \cdot \left(i + \left(\alpha + \beta\right)\right)}{1 + t\_0}\\
\end{array}
\end{array}
if beta < 3.6000000000000002e216Initial program 21.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6421.1
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6421.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6421.1
Applied rewrites21.1%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6421.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6421.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6421.2
Applied rewrites21.2%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
distribute-lft-inN/A
lower-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f6482.4
Applied rewrites82.4%
if 3.6000000000000002e216 < beta Initial program 0.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f640.0
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f640.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f640.0
Applied rewrites0.0%
Applied rewrites10.7%
Taylor expanded in beta around inf
+-commutativeN/A
lower-+.f6483.5
Applied rewrites83.5%
Final simplification82.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma 2.0 i (+ alpha beta))))
(if (<= beta 3.6e+216)
(-
(fma 0.0625 (/ (* 2.0 (+ alpha beta)) i) 0.0625)
(* (/ (+ alpha beta) i) 0.125))
(*
(/ (+ i alpha) beta)
(/ (* (/ i t_0) (+ i (+ alpha beta))) (+ 1.0 t_0))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(2.0, i, (alpha + beta));
double tmp;
if (beta <= 3.6e+216) {
tmp = fma(0.0625, ((2.0 * (alpha + beta)) / i), 0.0625) - (((alpha + beta) / i) * 0.125);
} else {
tmp = ((i + alpha) / beta) * (((i / t_0) * (i + (alpha + beta))) / (1.0 + t_0));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(2.0, i, Float64(alpha + beta)) tmp = 0.0 if (beta <= 3.6e+216) tmp = Float64(fma(0.0625, Float64(Float64(2.0 * Float64(alpha + beta)) / i), 0.0625) - Float64(Float64(Float64(alpha + beta) / i) * 0.125)); else tmp = Float64(Float64(Float64(i + alpha) / beta) * Float64(Float64(Float64(i / t_0) * Float64(i + Float64(alpha + beta))) / Float64(1.0 + t_0))); 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[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.6e+216], N[(N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] + 0.0625), $MachinePrecision] - N[(N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(N[(N[(i / t$95$0), $MachinePrecision] * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+216}:\\
\;\;\;\;\mathsf{fma}\left(0.0625, \frac{2 \cdot \left(\alpha + \beta\right)}{i}, 0.0625\right) - \frac{\alpha + \beta}{i} \cdot 0.125\\
\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{\frac{i}{t\_0} \cdot \left(i + \left(\alpha + \beta\right)\right)}{1 + t\_0}\\
\end{array}
\end{array}
if beta < 3.6000000000000002e216Initial program 21.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6421.1
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6421.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6421.1
Applied rewrites21.1%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6421.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6421.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6421.2
Applied rewrites21.2%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
distribute-lft-inN/A
lower-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f6482.4
Applied rewrites82.4%
if 3.6000000000000002e216 < beta Initial program 0.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f640.0
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f640.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f640.0
Applied rewrites0.0%
Applied rewrites10.7%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f6482.5
Applied rewrites82.5%
Final simplification82.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 3.6e+216)
(-
(fma 0.0625 (/ (* 2.0 (+ alpha beta)) i) 0.0625)
(* (/ (+ alpha beta) i) 0.125))
(/ (/ (+ i alpha) beta) (/ beta i))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.6e+216) {
tmp = fma(0.0625, ((2.0 * (alpha + beta)) / i), 0.0625) - (((alpha + beta) / i) * 0.125);
} else {
tmp = ((i + alpha) / beta) / (beta / i);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.6e+216) tmp = Float64(fma(0.0625, Float64(Float64(2.0 * Float64(alpha + beta)) / i), 0.0625) - Float64(Float64(Float64(alpha + beta) / i) * 0.125)); else tmp = Float64(Float64(Float64(i + alpha) / beta) / Float64(beta / i)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 3.6e+216], N[(N[(0.0625 * N[(N[(2.0 * N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] + 0.0625), $MachinePrecision] - N[(N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+216}:\\
\;\;\;\;\mathsf{fma}\left(0.0625, \frac{2 \cdot \left(\alpha + \beta\right)}{i}, 0.0625\right) - \frac{\alpha + \beta}{i} \cdot 0.125\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i + \alpha}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 3.6000000000000002e216Initial program 21.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6421.1
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6421.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6421.1
Applied rewrites21.1%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6421.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6421.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6421.2
Applied rewrites21.2%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
distribute-lft-inN/A
lower-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f6482.4
Applied rewrites82.4%
if 3.6000000000000002e216 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6482.2
Applied rewrites82.2%
Applied rewrites82.4%
Final simplification82.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.6e+216) (- (fma 0.125 (/ beta i) 0.0625) (* (/ (+ alpha beta) i) 0.125)) (/ (/ (+ i alpha) beta) (/ beta i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.6e+216) {
tmp = fma(0.125, (beta / i), 0.0625) - (((alpha + beta) / i) * 0.125);
} else {
tmp = ((i + alpha) / beta) / (beta / i);
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.6e+216) tmp = Float64(fma(0.125, Float64(beta / i), 0.0625) - Float64(Float64(Float64(alpha + beta) / i) * 0.125)); else tmp = Float64(Float64(Float64(i + alpha) / beta) / Float64(beta / i)); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 3.6e+216], N[(N[(0.125 * N[(beta / i), $MachinePrecision] + 0.0625), $MachinePrecision] - N[(N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+216}:\\
\;\;\;\;\mathsf{fma}\left(0.125, \frac{\beta}{i}, 0.0625\right) - \frac{\alpha + \beta}{i} \cdot 0.125\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i + \alpha}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 3.6000000000000002e216Initial program 21.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6421.1
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6421.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6421.1
Applied rewrites21.1%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6421.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6421.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6421.2
Applied rewrites21.2%
Taylor expanded in i around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
distribute-lft-inN/A
lower-*.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-+.f6482.4
Applied rewrites82.4%
Taylor expanded in alpha around 0
Applied rewrites77.6%
if 3.6000000000000002e216 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6482.2
Applied rewrites82.2%
Applied rewrites82.4%
Final simplification78.1%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.6e+216) 0.0625 (/ (/ (+ i alpha) beta) (/ beta i))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.6e+216) {
tmp = 0.0625;
} else {
tmp = ((i + alpha) / beta) / (beta / i);
}
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 <= 3.6d+216) then
tmp = 0.0625d0
else
tmp = ((i + alpha) / beta) / (beta / i)
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 <= 3.6e+216) {
tmp = 0.0625;
} else {
tmp = ((i + alpha) / beta) / (beta / i);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3.6e+216: tmp = 0.0625 else: tmp = ((i + alpha) / beta) / (beta / i) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.6e+216) tmp = 0.0625; else tmp = Float64(Float64(Float64(i + alpha) / beta) / Float64(beta / i)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.6e+216)
tmp = 0.0625;
else
tmp = ((i + alpha) / beta) / (beta / i);
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, 3.6e+216], 0.0625, N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+216}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i + \alpha}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 3.6000000000000002e216Initial program 21.2%
Taylor expanded in i around inf
Applied rewrites78.7%
if 3.6000000000000002e216 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6482.2
Applied rewrites82.2%
Applied rewrites82.4%
Final simplification79.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.6e+216) 0.0625 (* (/ i beta) (/ (+ i alpha) beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.6e+216) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / 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 <= 3.6d+216) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((i + alpha) / 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 <= 3.6e+216) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3.6e+216: tmp = 0.0625 else: tmp = (i / beta) * ((i + alpha) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.6e+216) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / 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 <= 3.6e+216)
tmp = 0.0625;
else
tmp = (i / beta) * ((i + alpha) / 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, 3.6e+216], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+216}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 3.6000000000000002e216Initial program 21.2%
Taylor expanded in i around inf
Applied rewrites78.7%
if 3.6000000000000002e216 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6482.2
Applied rewrites82.2%
Final simplification79.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.6e+216) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.6e+216) {
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 <= 3.6d+216) 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 <= 3.6e+216) {
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 <= 3.6e+216: 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 <= 3.6e+216) 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 <= 3.6e+216)
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, 3.6e+216], 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 3.6 \cdot 10^{+216}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 3.6000000000000002e216Initial program 21.2%
Taylor expanded in i around inf
Applied rewrites78.7%
if 3.6000000000000002e216 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6482.2
Applied rewrites82.2%
Taylor expanded in alpha around 0
Applied rewrites78.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.6e+216) 0.0625 (* (/ (/ i beta) beta) i)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.6e+216) {
tmp = 0.0625;
} else {
tmp = ((i / beta) / beta) * i;
}
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 <= 3.6d+216) then
tmp = 0.0625d0
else
tmp = ((i / beta) / beta) * i
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 <= 3.6e+216) {
tmp = 0.0625;
} else {
tmp = ((i / beta) / beta) * i;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3.6e+216: tmp = 0.0625 else: tmp = ((i / beta) / beta) * i return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.6e+216) tmp = 0.0625; else tmp = Float64(Float64(Float64(i / beta) / beta) * i); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.6e+216)
tmp = 0.0625;
else
tmp = ((i / beta) / beta) * i;
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, 3.6e+216], 0.0625, N[(N[(N[(i / beta), $MachinePrecision] / beta), $MachinePrecision] * i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+216}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{i}{\beta}}{\beta} \cdot i\\
\end{array}
\end{array}
if beta < 3.6000000000000002e216Initial program 21.2%
Taylor expanded in i around inf
Applied rewrites78.7%
if 3.6000000000000002e216 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6482.2
Applied rewrites82.2%
Applied rewrites82.3%
Taylor expanded in alpha around 0
Applied rewrites27.5%
Applied rewrites41.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3e+267) 0.0625 (* (/ i (* beta beta)) alpha)))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3e+267) {
tmp = 0.0625;
} else {
tmp = (i / (beta * beta)) * alpha;
}
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 <= 3d+267) then
tmp = 0.0625d0
else
tmp = (i / (beta * beta)) * alpha
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 <= 3e+267) {
tmp = 0.0625;
} else {
tmp = (i / (beta * beta)) * alpha;
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3e+267: tmp = 0.0625 else: tmp = (i / (beta * beta)) * alpha return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3e+267) tmp = 0.0625; else tmp = Float64(Float64(i / Float64(beta * beta)) * alpha); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3e+267)
tmp = 0.0625;
else
tmp = (i / (beta * beta)) * alpha;
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, 3e+267], 0.0625, N[(N[(i / N[(beta * beta), $MachinePrecision]), $MachinePrecision] * alpha), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3 \cdot 10^{+267}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta \cdot \beta} \cdot \alpha\\
\end{array}
\end{array}
if beta < 2.9999999999999999e267Initial program 20.4%
Taylor expanded in i around inf
Applied rewrites76.2%
if 2.9999999999999999e267 < beta Initial program 0.0%
Taylor expanded in beta around inf
*-commutativeN/A
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6494.6
Applied rewrites94.6%
Taylor expanded in alpha around inf
Applied rewrites42.1%
Final simplification74.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
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.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 19.3%
Taylor expanded in i around inf
Applied rewrites72.5%
herbie shell --seed 2024283
(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)))