Octave 3.8, jcobi/4

Percentage Accurate: 16.3% → 84.4%
Time: 15.5s
Alternatives: 9
Speedup: 53.0×

Specification

?
\[\left(\alpha > -1 \land \beta > -1\right) \land i > 1\]
\[\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} \]
(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:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 9 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 16.3% accurate, 1.0× speedup?

\[\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} \]
(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}

Alternative 1: 84.4% accurate, 0.1× speedup?

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t_0 \cdot t_0\\ t_2 := i + \left(\alpha + \beta\right)\\ t_3 := i \cdot t_2\\ t_4 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\ \mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\ \;\;\;\;\frac{i}{\mathsf{fma}\left(t_4, t_4, -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, t_2, \alpha \cdot \beta\right)}{t_4} \cdot \frac{t_2}{t_4}\right)\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\ \end{array} \end{array} \]
NOTE: alpha and beta 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 (+ alpha beta)))
        (t_3 (* i t_2))
        (t_4 (+ alpha (fma i 2.0 beta))))
   (if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
     (*
      (/ i (fma t_4 t_4 -1.0))
      (* (/ (fma i t_2 (* alpha beta)) t_4) (/ t_2 t_4)))
     (+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125))))))
assert(alpha < beta);
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 + (alpha + beta);
	double t_3 = i * t_2;
	double t_4 = alpha + fma(i, 2.0, beta);
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
		tmp = (i / fma(t_4, t_4, -1.0)) * ((fma(i, t_2, (alpha * beta)) / t_4) * (t_2 / t_4));
	} else {
		tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
	}
	return tmp;
}
alpha, beta = sort([alpha, beta])
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(alpha + beta))
	t_3 = Float64(i * t_2)
	t_4 = Float64(alpha + fma(i, 2.0, beta))
	tmp = 0.0
	if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf)
		tmp = Float64(Float64(i / fma(t_4, t_4, -1.0)) * Float64(Float64(fma(i, t_2, Float64(alpha * beta)) / t_4) * Float64(t_2 / t_4)));
	else
		tmp = Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125)));
	end
	return tmp
end
NOTE: alpha and beta 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[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i * t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(alpha + N[(i * 2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(i / N[(t$95$4 * t$95$4 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i * t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision] * N[(t$95$2 / t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + i \cdot 2\\
t_1 := t_0 \cdot t_0\\
t_2 := i + \left(\alpha + \beta\right)\\
t_3 := i \cdot t_2\\
t_4 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\
\mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\
\;\;\;\;\frac{i}{\mathsf{fma}\left(t_4, t_4, -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, t_2, \alpha \cdot \beta\right)}{t_4} \cdot \frac{t_2}{t_4}\right)\\

\mathbf{else}:\\
\;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. 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.0

    1. Initial program 43.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/35.9%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*35.6%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac67.3%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified99.5%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]

    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))

    1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/0.0%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*0.0%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac0.0%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified4.0%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in i around inf 76.1%

      \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}} \]
    5. Step-by-step derivation
      1. cancel-sign-sub-inv76.1%

        \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i}} \]
      2. distribute-lft-out76.1%

        \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{\color{blue}{2 \cdot \left(\beta + \alpha\right)}}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i} \]
      3. metadata-eval76.1%

        \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + \color{blue}{-0.125} \cdot \frac{\beta + \alpha}{i} \]
    6. Simplified76.1%

      \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + -0.125 \cdot \frac{\beta + \alpha}{i}} \]
    7. Taylor expanded in alpha around 0 71.6%

      \[\leadsto \color{blue}{-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right)} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification81.1%

    \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1} \leq \infty:\\ \;\;\;\;\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\ \end{array} \]

Alternative 2: 84.1% accurate, 0.1× speedup?

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \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)\\ \mathbf{if}\;\frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\ \;\;\;\;\frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(i + \beta\right)}^{2}}{-1 + \left(4 \cdot \left(i \cdot \left(i + \beta\right)\right) + \beta \cdot \beta\right)}\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\ \end{array} \end{array} \]
NOTE: alpha and beta 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)))))
   (if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
     (*
      (/ (* i i) (pow (fma i 2.0 beta) 2.0))
      (/
       (pow (+ i beta) 2.0)
       (+ -1.0 (+ (* 4.0 (* i (+ i beta))) (* beta beta)))))
     (+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125))))))
assert(alpha < beta);
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 tmp;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
		tmp = ((i * i) / pow(fma(i, 2.0, beta), 2.0)) * (pow((i + beta), 2.0) / (-1.0 + ((4.0 * (i * (i + beta))) + (beta * beta))));
	} else {
		tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
	}
	return tmp;
}
alpha, beta = sort([alpha, beta])
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)))
	tmp = 0.0
	if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf)
		tmp = Float64(Float64(Float64(i * i) / (fma(i, 2.0, beta) ^ 2.0)) * Float64((Float64(i + beta) ^ 2.0) / Float64(-1.0 + Float64(Float64(4.0 * Float64(i * Float64(i + beta))) + Float64(beta * beta)))));
	else
		tmp = Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125)));
	end
	return tmp
end
NOTE: alpha and beta 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]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(i * i), $MachinePrecision] / N[Power[N[(i * 2.0 + beta), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision] / N[(-1.0 + N[(N[(4.0 * N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\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)\\
\mathbf{if}\;\frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\
\;\;\;\;\frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(i + \beta\right)}^{2}}{-1 + \left(4 \cdot \left(i \cdot \left(i + \beta\right)\right) + \beta \cdot \beta\right)}\\

\mathbf{else}:\\
\;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. 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.0

    1. Initial program 43.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/35.9%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*35.6%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac67.3%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified99.5%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in alpha around 0 35.1%

      \[\leadsto \color{blue}{\frac{{i}^{2} \cdot {\left(\beta + i\right)}^{2}}{{\left(\beta + 2 \cdot i\right)}^{2} \cdot \left({\left(\beta + 2 \cdot i\right)}^{2} - 1\right)}} \]
    5. Step-by-step derivation
      1. times-frac92.5%

        \[\leadsto \color{blue}{\frac{{i}^{2}}{{\left(\beta + 2 \cdot i\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\left(\beta + 2 \cdot i\right)}^{2} - 1}} \]
      2. unpow292.4%

        \[\leadsto \frac{\color{blue}{i \cdot i}}{{\left(\beta + 2 \cdot i\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\left(\beta + 2 \cdot i\right)}^{2} - 1} \]
      3. +-commutative92.4%

        \[\leadsto \frac{i \cdot i}{{\color{blue}{\left(2 \cdot i + \beta\right)}}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\left(\beta + 2 \cdot i\right)}^{2} - 1} \]
      4. *-commutative92.4%

        \[\leadsto \frac{i \cdot i}{{\left(\color{blue}{i \cdot 2} + \beta\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\left(\beta + 2 \cdot i\right)}^{2} - 1} \]
      5. fma-udef92.4%

        \[\leadsto \frac{i \cdot i}{{\color{blue}{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\left(\beta + 2 \cdot i\right)}^{2} - 1} \]
      6. sub-neg92.4%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\color{blue}{{\left(\beta + 2 \cdot i\right)}^{2} + \left(-1\right)}} \]
      7. +-commutative92.4%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\color{blue}{\left(2 \cdot i + \beta\right)}}^{2} + \left(-1\right)} \]
      8. *-commutative92.4%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\left(\color{blue}{i \cdot 2} + \beta\right)}^{2} + \left(-1\right)} \]
      9. fma-udef92.4%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\color{blue}{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}}^{2} + \left(-1\right)} \]
      10. metadata-eval92.4%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2} + \color{blue}{-1}} \]
    6. Simplified92.4%

      \[\leadsto \color{blue}{\frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2} + -1}} \]
    7. Taylor expanded in i around 0 92.4%

      \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\color{blue}{\left(4 \cdot \left(\beta \cdot i\right) + \left({\beta}^{2} + 4 \cdot {i}^{2}\right)\right)} + -1} \]
    8. Step-by-step derivation
      1. +-commutative92.4%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\left(4 \cdot \left(\beta \cdot i\right) + \color{blue}{\left(4 \cdot {i}^{2} + {\beta}^{2}\right)}\right) + -1} \]
      2. associate-+r+92.4%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\color{blue}{\left(\left(4 \cdot \left(\beta \cdot i\right) + 4 \cdot {i}^{2}\right) + {\beta}^{2}\right)} + -1} \]
      3. distribute-lft-out92.4%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\left(\color{blue}{4 \cdot \left(\beta \cdot i + {i}^{2}\right)} + {\beta}^{2}\right) + -1} \]
      4. unpow292.4%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\left(4 \cdot \left(\beta \cdot i + \color{blue}{i \cdot i}\right) + {\beta}^{2}\right) + -1} \]
      5. distribute-rgt-in92.5%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\left(4 \cdot \color{blue}{\left(i \cdot \left(\beta + i\right)\right)} + {\beta}^{2}\right) + -1} \]
      6. +-commutative92.5%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\left(4 \cdot \left(i \cdot \color{blue}{\left(i + \beta\right)}\right) + {\beta}^{2}\right) + -1} \]
      7. unpow292.5%

        \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\left(4 \cdot \left(i \cdot \left(i + \beta\right)\right) + \color{blue}{\beta \cdot \beta}\right) + -1} \]
    9. Simplified92.5%

      \[\leadsto \frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(\beta + i\right)}^{2}}{\color{blue}{\left(4 \cdot \left(i \cdot \left(i + \beta\right)\right) + \beta \cdot \beta\right)} + -1} \]

    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))

    1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/0.0%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*0.0%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac0.0%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified4.0%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in i around inf 76.1%

      \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}} \]
    5. Step-by-step derivation
      1. cancel-sign-sub-inv76.1%

        \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i}} \]
      2. distribute-lft-out76.1%

        \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{\color{blue}{2 \cdot \left(\beta + \alpha\right)}}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i} \]
      3. metadata-eval76.1%

        \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + \color{blue}{-0.125} \cdot \frac{\beta + \alpha}{i} \]
    6. Simplified76.1%

      \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + -0.125 \cdot \frac{\beta + \alpha}{i}} \]
    7. Taylor expanded in alpha around 0 71.6%

      \[\leadsto \color{blue}{-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right)} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification78.7%

    \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1} \leq \infty:\\ \;\;\;\;\frac{i \cdot i}{{\left(\mathsf{fma}\left(i, 2, \beta\right)\right)}^{2}} \cdot \frac{{\left(i + \beta\right)}^{2}}{-1 + \left(4 \cdot \left(i \cdot \left(i + \beta\right)\right) + \beta \cdot \beta\right)}\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\ \end{array} \]

Alternative 3: 81.7% accurate, 0.5× speedup?

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \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 := \frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1}\\ \mathbf{if}\;t_3 \leq 0.1:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\ \end{array} \end{array} \]
NOTE: alpha and beta 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 (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0))))
   (if (<= t_3 0.1)
     t_3
     (+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125))))))
assert(alpha < beta);
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 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
	}
	return tmp;
}
NOTE: alpha and beta 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) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_0 = (alpha + beta) + (i * 2.0d0)
    t_1 = t_0 * t_0
    t_2 = i * (i + (alpha + beta))
    t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + (-1.0d0))
    if (t_3 <= 0.1d0) then
        tmp = t_3
    else
        tmp = ((-0.125d0) * (beta / i)) + (0.0625d0 + ((beta / i) * 0.125d0))
    end if
    code = tmp
end function
assert alpha < beta;
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 = i * (i + (alpha + beta));
	double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
	}
	return tmp;
}
[alpha, beta] = sort([alpha, beta])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (i * 2.0)
	t_1 = t_0 * t_0
	t_2 = i * (i + (alpha + beta))
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)
	tmp = 0
	if t_3 <= 0.1:
		tmp = t_3
	else:
		tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125))
	return tmp
alpha, beta = sort([alpha, beta])
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(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0))
	tmp = 0.0
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125)));
	end
	return tmp
end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (i * 2.0);
	t_1 = t_0 * t_0;
	t_2 = i * (i + (alpha + beta));
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	tmp = 0.0;
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
	end
	tmp_2 = tmp;
end
NOTE: alpha and beta 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[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\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 := \frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1}\\
\mathbf{if}\;t_3 \leq 0.1:\\
\;\;\;\;t_3\\

\mathbf{else}:\\
\;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. 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)) < 0.10000000000000001

    1. Initial program 99.7%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]

    if 0.10000000000000001 < (/.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))

    1. Initial program 0.7%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/0.0%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*0.0%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac10.3%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified26.1%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in i around inf 77.6%

      \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}} \]
    5. Step-by-step derivation
      1. cancel-sign-sub-inv77.6%

        \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i}} \]
      2. distribute-lft-out77.6%

        \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{\color{blue}{2 \cdot \left(\beta + \alpha\right)}}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i} \]
      3. metadata-eval77.6%

        \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + \color{blue}{-0.125} \cdot \frac{\beta + \alpha}{i} \]
    6. Simplified77.6%

      \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + -0.125 \cdot \frac{\beta + \alpha}{i}} \]
    7. Taylor expanded in alpha around 0 74.2%

      \[\leadsto \color{blue}{-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right)} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification77.7%

    \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1} \leq 0.1:\\ \;\;\;\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1}\\ \mathbf{else}:\\ \;\;\;\;-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)\\ \end{array} \]

Alternative 4: 78.7% accurate, 4.1× speedup?

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ -0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right) \end{array} \]
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (+ (* -0.125 (/ beta i)) (+ 0.0625 (* (/ beta i) 0.125))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
	return (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
}
NOTE: alpha and beta 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.125d0) * (beta / i)) + (0.0625d0 + ((beta / i) * 0.125d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
	return (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
}
[alpha, beta] = sort([alpha, beta])
def code(alpha, beta, i):
	return (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125))
alpha, beta = sort([alpha, beta])
function code(alpha, beta, i)
	return Float64(Float64(-0.125 * Float64(beta / i)) + Float64(0.0625 + Float64(Float64(beta / i) * 0.125)))
end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
	tmp = (-0.125 * (beta / i)) + (0.0625 + ((beta / i) * 0.125));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := N[(N[(-0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision] + N[(0.0625 + N[(N[(beta / i), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right)
\end{array}
Derivation
  1. Initial program 14.6%

    \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
  2. Step-by-step derivation
    1. associate-/l/12.2%

      \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
    2. associate-*l*12.1%

      \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
    3. times-frac22.9%

      \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
  3. Simplified36.4%

    \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
  4. Taylor expanded in i around inf 78.3%

    \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}} \]
  5. Step-by-step derivation
    1. cancel-sign-sub-inv78.3%

      \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i}} \]
    2. distribute-lft-out78.3%

      \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{\color{blue}{2 \cdot \left(\beta + \alpha\right)}}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i} \]
    3. metadata-eval78.3%

      \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + \color{blue}{-0.125} \cdot \frac{\beta + \alpha}{i} \]
  6. Simplified78.3%

    \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + -0.125 \cdot \frac{\beta + \alpha}{i}} \]
  7. Taylor expanded in alpha around 0 75.3%

    \[\leadsto \color{blue}{-0.125 \cdot \frac{\beta}{i} + \left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right)} \]
  8. Final simplification75.3%

    \[\leadsto -0.125 \cdot \frac{\beta}{i} + \left(0.0625 + \frac{\beta}{i} \cdot 0.125\right) \]

Alternative 5: 76.5% accurate, 4.8× speedup?

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 3.5 \cdot 10^{+214}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\alpha + \beta}\\ \end{array} \end{array} \]
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 3.5e+214) 0.0625 (* (/ i beta) (/ alpha (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.5e+214) {
		tmp = 0.0625;
	} else {
		tmp = (i / beta) * (alpha / (alpha + beta));
	}
	return tmp;
}
NOTE: alpha and beta 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.5d+214) then
        tmp = 0.0625d0
    else
        tmp = (i / beta) * (alpha / (alpha + beta))
    end if
    code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.5e+214) {
		tmp = 0.0625;
	} else {
		tmp = (i / beta) * (alpha / (alpha + beta));
	}
	return tmp;
}
[alpha, beta] = sort([alpha, beta])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 3.5e+214:
		tmp = 0.0625
	else:
		tmp = (i / beta) * (alpha / (alpha + beta))
	return tmp
alpha, beta = sort([alpha, beta])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 3.5e+214)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(i / beta) * Float64(alpha / Float64(alpha + beta)));
	end
	return tmp
end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 3.5e+214)
		tmp = 0.0625;
	else
		tmp = (i / beta) * (alpha / (alpha + beta));
	end
	tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 3.5e+214], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(alpha / N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5 \cdot 10^{+214}:\\
\;\;\;\;0.0625\\

\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\alpha + \beta}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if beta < 3.5e214

    1. Initial program 15.9%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/13.3%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*13.2%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac24.9%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified38.0%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in i around inf 75.9%

      \[\leadsto \color{blue}{0.0625} \]

    if 3.5e214 < beta

    1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/0.0%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*0.0%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac0.0%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified19.0%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in beta around inf 19.0%

      \[\leadsto \color{blue}{\frac{i}{{\beta}^{2}}} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right) \]
    5. Step-by-step derivation
      1. unpow219.0%

        \[\leadsto \frac{i}{\color{blue}{\beta \cdot \beta}} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right) \]
    6. Simplified19.0%

      \[\leadsto \color{blue}{\frac{i}{\beta \cdot \beta}} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right) \]
    7. Taylor expanded in i around 0 35.4%

      \[\leadsto \color{blue}{\frac{i \cdot \alpha}{\beta \cdot \left(\beta + \alpha\right)}} \]
    8. Step-by-step derivation
      1. times-frac40.5%

        \[\leadsto \color{blue}{\frac{i}{\beta} \cdot \frac{\alpha}{\beta + \alpha}} \]
      2. +-commutative40.5%

        \[\leadsto \frac{i}{\beta} \cdot \frac{\alpha}{\color{blue}{\alpha + \beta}} \]
    9. Simplified40.5%

      \[\leadsto \color{blue}{\frac{i}{\beta} \cdot \frac{\alpha}{\alpha + \beta}} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification73.0%

    \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 3.5 \cdot 10^{+214}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\alpha + \beta}\\ \end{array} \]

Alternative 6: 78.1% accurate, 4.8× speedup?

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.15 \cdot 10^{+172}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i + \alpha}{\beta \cdot \frac{\beta}{i}}\\ \end{array} \end{array} \]
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.15e+172) 0.0625 (/ (+ i alpha) (* beta (/ beta i)))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.15e+172) {
		tmp = 0.0625;
	} else {
		tmp = (i + alpha) / (beta * (beta / i));
	}
	return tmp;
}
NOTE: alpha and beta 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.15d+172) then
        tmp = 0.0625d0
    else
        tmp = (i + alpha) / (beta * (beta / i))
    end if
    code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.15e+172) {
		tmp = 0.0625;
	} else {
		tmp = (i + alpha) / (beta * (beta / i));
	}
	return tmp;
}
[alpha, beta] = sort([alpha, beta])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.15e+172:
		tmp = 0.0625
	else:
		tmp = (i + alpha) / (beta * (beta / i))
	return tmp
alpha, beta = sort([alpha, beta])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.15e+172)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(i + alpha) / Float64(beta * Float64(beta / i)));
	end
	return tmp
end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.15e+172)
		tmp = 0.0625;
	else
		tmp = (i + alpha) / (beta * (beta / i));
	end
	tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.15e+172], 0.0625, N[(N[(i + alpha), $MachinePrecision] / N[(beta * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.15 \cdot 10^{+172}:\\
\;\;\;\;0.0625\\

\mathbf{else}:\\
\;\;\;\;\frac{i + \alpha}{\beta \cdot \frac{\beta}{i}}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if beta < 1.15e172

    1. Initial program 16.7%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/13.9%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*13.8%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac26.1%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified39.3%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in i around inf 78.8%

      \[\leadsto \color{blue}{0.0625} \]

    if 1.15e172 < beta

    1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/0.0%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*0.0%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac0.0%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified16.2%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in beta around inf 26.3%

      \[\leadsto \color{blue}{\frac{i \cdot \left(i + \alpha\right)}{{\beta}^{2}}} \]
    5. Step-by-step derivation
      1. *-commutative26.3%

        \[\leadsto \frac{\color{blue}{\left(i + \alpha\right) \cdot i}}{{\beta}^{2}} \]
      2. associate-/l*30.8%

        \[\leadsto \color{blue}{\frac{i + \alpha}{\frac{{\beta}^{2}}{i}}} \]
      3. +-commutative30.8%

        \[\leadsto \frac{\color{blue}{\alpha + i}}{\frac{{\beta}^{2}}{i}} \]
      4. unpow230.8%

        \[\leadsto \frac{\alpha + i}{\frac{\color{blue}{\beta \cdot \beta}}{i}} \]
    6. Simplified30.8%

      \[\leadsto \color{blue}{\frac{\alpha + i}{\frac{\beta \cdot \beta}{i}}} \]
    7. Step-by-step derivation
      1. *-un-lft-identity30.8%

        \[\leadsto \frac{\alpha + i}{\color{blue}{1 \cdot \frac{\beta \cdot \beta}{i}}} \]
      2. associate-/l*42.8%

        \[\leadsto \frac{\alpha + i}{1 \cdot \color{blue}{\frac{\beta}{\frac{i}{\beta}}}} \]
    8. Applied egg-rr42.8%

      \[\leadsto \frac{\alpha + i}{\color{blue}{1 \cdot \frac{\beta}{\frac{i}{\beta}}}} \]
    9. Step-by-step derivation
      1. *-lft-identity42.8%

        \[\leadsto \frac{\alpha + i}{\color{blue}{\frac{\beta}{\frac{i}{\beta}}}} \]
      2. associate-/r/42.8%

        \[\leadsto \frac{\alpha + i}{\color{blue}{\frac{\beta}{i} \cdot \beta}} \]
    10. Simplified42.8%

      \[\leadsto \frac{\alpha + i}{\color{blue}{\frac{\beta}{i} \cdot \beta}} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification74.3%

    \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.15 \cdot 10^{+172}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i + \alpha}{\beta \cdot \frac{\beta}{i}}\\ \end{array} \]

Alternative 7: 76.5% accurate, 5.8× speedup?

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 3.5 \cdot 10^{+214}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\ \end{array} \end{array} \]
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 3.5e+214) 0.0625 (* (/ i beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.5e+214) {
		tmp = 0.0625;
	} else {
		tmp = (i / beta) * (alpha / beta);
	}
	return tmp;
}
NOTE: alpha and beta 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.5d+214) then
        tmp = 0.0625d0
    else
        tmp = (i / beta) * (alpha / beta)
    end if
    code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.5e+214) {
		tmp = 0.0625;
	} else {
		tmp = (i / beta) * (alpha / beta);
	}
	return tmp;
}
[alpha, beta] = sort([alpha, beta])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 3.5e+214:
		tmp = 0.0625
	else:
		tmp = (i / beta) * (alpha / beta)
	return tmp
alpha, beta = sort([alpha, beta])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 3.5e+214)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(i / beta) * Float64(alpha / beta));
	end
	return tmp
end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 3.5e+214)
		tmp = 0.0625;
	else
		tmp = (i / beta) * (alpha / beta);
	end
	tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 3.5e+214], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5 \cdot 10^{+214}:\\
\;\;\;\;0.0625\\

\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if beta < 3.5e214

    1. Initial program 15.9%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/13.3%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*13.2%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac24.9%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified38.0%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in i around inf 75.9%

      \[\leadsto \color{blue}{0.0625} \]

    if 3.5e214 < beta

    1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/0.0%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*0.0%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac0.0%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified19.0%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in beta around inf 34.3%

      \[\leadsto \color{blue}{\frac{i \cdot \left(i + \alpha\right)}{{\beta}^{2}}} \]
    5. Step-by-step derivation
      1. *-commutative34.3%

        \[\leadsto \frac{\color{blue}{\left(i + \alpha\right) \cdot i}}{{\beta}^{2}} \]
      2. associate-/l*36.1%

        \[\leadsto \color{blue}{\frac{i + \alpha}{\frac{{\beta}^{2}}{i}}} \]
      3. +-commutative36.1%

        \[\leadsto \frac{\color{blue}{\alpha + i}}{\frac{{\beta}^{2}}{i}} \]
      4. unpow236.1%

        \[\leadsto \frac{\alpha + i}{\frac{\color{blue}{\beta \cdot \beta}}{i}} \]
    6. Simplified36.1%

      \[\leadsto \color{blue}{\frac{\alpha + i}{\frac{\beta \cdot \beta}{i}}} \]
    7. Taylor expanded in alpha around inf 35.4%

      \[\leadsto \color{blue}{\frac{i \cdot \alpha}{{\beta}^{2}}} \]
    8. Step-by-step derivation
      1. *-commutative35.4%

        \[\leadsto \frac{\color{blue}{\alpha \cdot i}}{{\beta}^{2}} \]
      2. unpow235.4%

        \[\leadsto \frac{\alpha \cdot i}{\color{blue}{\beta \cdot \beta}} \]
    9. Simplified35.4%

      \[\leadsto \color{blue}{\frac{\alpha \cdot i}{\beta \cdot \beta}} \]
    10. Taylor expanded in alpha around 0 35.4%

      \[\leadsto \color{blue}{\frac{i \cdot \alpha}{{\beta}^{2}}} \]
    11. Step-by-step derivation
      1. unpow235.4%

        \[\leadsto \frac{i \cdot \alpha}{\color{blue}{\beta \cdot \beta}} \]
      2. times-frac40.5%

        \[\leadsto \color{blue}{\frac{i}{\beta} \cdot \frac{\alpha}{\beta}} \]
    12. Simplified40.5%

      \[\leadsto \color{blue}{\frac{i}{\beta} \cdot \frac{\alpha}{\beta}} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification73.0%

    \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 3.5 \cdot 10^{+214}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\ \end{array} \]

Alternative 8: 75.3% accurate, 10.5× speedup?

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 3.8 \cdot 10^{+224}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{0}{i}\\ \end{array} \end{array} \]
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 3.8e+224) 0.0625 (/ 0.0 i)))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.8e+224) {
		tmp = 0.0625;
	} else {
		tmp = 0.0 / i;
	}
	return tmp;
}
NOTE: alpha and beta 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.8d+224) then
        tmp = 0.0625d0
    else
        tmp = 0.0d0 / i
    end if
    code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.8e+224) {
		tmp = 0.0625;
	} else {
		tmp = 0.0 / i;
	}
	return tmp;
}
[alpha, beta] = sort([alpha, beta])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 3.8e+224:
		tmp = 0.0625
	else:
		tmp = 0.0 / i
	return tmp
alpha, beta = sort([alpha, beta])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 3.8e+224)
		tmp = 0.0625;
	else
		tmp = Float64(0.0 / i);
	end
	return tmp
end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 3.8e+224)
		tmp = 0.0625;
	else
		tmp = 0.0 / i;
	end
	tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 3.8e+224], 0.0625, N[(0.0 / i), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.8 \cdot 10^{+224}:\\
\;\;\;\;0.0625\\

\mathbf{else}:\\
\;\;\;\;\frac{0}{i}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if beta < 3.80000000000000025e224

    1. Initial program 15.8%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/13.2%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*13.1%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac24.7%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified37.7%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in i around inf 75.5%

      \[\leadsto \color{blue}{0.0625} \]

    if 3.80000000000000025e224 < beta

    1. Initial program 0.0%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
    2. Step-by-step derivation
      1. associate-/l/0.0%

        \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
      2. associate-*l*0.0%

        \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
      3. times-frac0.0%

        \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
    3. Simplified21.1%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
    4. Taylor expanded in i around inf 52.2%

      \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}} \]
    5. Step-by-step derivation
      1. cancel-sign-sub-inv52.2%

        \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \beta + 2 \cdot \alpha}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i}} \]
      2. distribute-lft-out52.2%

        \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{\color{blue}{2 \cdot \left(\beta + \alpha\right)}}{i}\right) + \left(-0.125\right) \cdot \frac{\beta + \alpha}{i} \]
      3. metadata-eval52.2%

        \[\leadsto \left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + \color{blue}{-0.125} \cdot \frac{\beta + \alpha}{i} \]
    6. Simplified52.2%

      \[\leadsto \color{blue}{\left(0.0625 + 0.0625 \cdot \frac{2 \cdot \left(\beta + \alpha\right)}{i}\right) + -0.125 \cdot \frac{\beta + \alpha}{i}} \]
    7. Taylor expanded in i around 0 39.3%

      \[\leadsto \color{blue}{\frac{-0.125 \cdot \left(\beta + \alpha\right) + 0.125 \cdot \left(\beta + \alpha\right)}{i}} \]
    8. Step-by-step derivation
      1. distribute-rgt-out39.3%

        \[\leadsto \frac{\color{blue}{\left(\beta + \alpha\right) \cdot \left(-0.125 + 0.125\right)}}{i} \]
      2. metadata-eval39.3%

        \[\leadsto \frac{\left(\beta + \alpha\right) \cdot \color{blue}{0}}{i} \]
      3. mul0-rgt39.3%

        \[\leadsto \frac{\color{blue}{0}}{i} \]
    9. Simplified39.3%

      \[\leadsto \color{blue}{\frac{0}{i}} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification72.9%

    \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 3.8 \cdot 10^{+224}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{0}{i}\\ \end{array} \]

Alternative 9: 72.1% accurate, 53.0× speedup?

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ 0.0625 \end{array} \]
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta);
double code(double alpha, double beta, double i) {
	return 0.0625;
}
NOTE: alpha and beta 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;
public static double code(double alpha, double beta, double i) {
	return 0.0625;
}
[alpha, beta] = sort([alpha, beta])
def code(alpha, beta, i):
	return 0.0625
alpha, beta = sort([alpha, beta])
function code(alpha, beta, i)
	return 0.0625
end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
	tmp = 0.0625;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.0625
\end{array}
Derivation
  1. Initial program 14.6%

    \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
  2. Step-by-step derivation
    1. associate-/l/12.2%

      \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]
    2. associate-*l*12.1%

      \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]
    3. times-frac22.9%

      \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]
  3. Simplified36.4%

    \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]
  4. Taylor expanded in i around inf 71.2%

    \[\leadsto \color{blue}{0.0625} \]
  5. Final simplification71.2%

    \[\leadsto 0.0625 \]

Reproduce

?
herbie shell --seed 2023208 
(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)))