Octave 3.8, jcobi/4

Percentage Accurate: 15.7% → 83.6%

Time: 14.4s

Alternatives: 7

Speedup: 115.0×

Specification

\[\left(\alpha > -1 \land \beta > -1\right) \land i > 1\]

Math

\[\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

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

C

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

Fortran

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

Java

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

Python

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)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 15.7% accurate, 1.0× speedup

Math

\[\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

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

C

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

Fortran

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

Java

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

Python

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)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 83.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := i + \left(\alpha + \beta\right)\\ t_1 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\ \mathbf{if}\;i \leq 8.2 \cdot 10^{+114}:\\ \;\;\;\;\frac{\frac{i \cdot t\_0}{t\_1}}{t\_1 + 1} \cdot \frac{\frac{\mathsf{fma}\left(i, t\_0, \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.125, \frac{\beta}{i}, 0.0625\right) - \frac{\beta \cdot 0.125}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ i (+ alpha beta))) (t_1 (fma i 2.0 (+ alpha beta))))
   (if (<= i 8.2e+114)
     (*
      (/ (/ (* i t_0) t_1) (+ t_1 1.0))
      (/ (/ (fma i t_0 (* alpha beta)) t_1) (+ t_1 -1.0)))
     (- (fma 0.125 (/ beta i) 0.0625) (/ (* beta 0.125) i)))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = i + (alpha + beta);
	double t_1 = fma(i, 2.0, (alpha + beta));
	double tmp;
	if (i <= 8.2e+114) {
		tmp = (((i * t_0) / t_1) / (t_1 + 1.0)) * ((fma(i, t_0, (alpha * beta)) / t_1) / (t_1 + -1.0));
	} else {
		tmp = fma(0.125, (beta / i), 0.0625) - ((beta * 0.125) / i);
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(i + Float64(alpha + beta))
	t_1 = fma(i, 2.0, Float64(alpha + beta))
	tmp = 0.0
	if (i <= 8.2e+114)
		tmp = Float64(Float64(Float64(Float64(i * t_0) / t_1) / Float64(t_1 + 1.0)) * Float64(Float64(fma(i, t_0, Float64(alpha * beta)) / t_1) / Float64(t_1 + -1.0)));
	else
		tmp = Float64(fma(0.125, Float64(beta / i), 0.0625) - Float64(Float64(beta * 0.125) / i));
	end
	return tmp
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 8.2e+114], N[(N[(N[(N[(i * t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i * t$95$0 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.125 * N[(beta / i), $MachinePrecision] + 0.0625), $MachinePrecision] - N[(N[(beta * 0.125), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if i < 8.2000000000000001e114

   1. Initial program 41.3%

      \[\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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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} \]

      4. lift-*.f64 N/A

         \[\leadsto \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)}{\color{blue}{\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} \]

      5. times-frac N/A

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

      6. lift--.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. difference-of-sqr-1 N/A

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

   4. Applied rewrites 88.8%

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

   if 8.2000000000000001e114 < i

   1. Initial program 0.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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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} \]

      4. lift-*.f64 N/A

         \[\leadsto \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)}{\color{blue}{\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} \]

      5. times-frac N/A

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

      6. lift--.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. difference-of-sqr-1 N/A

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

   4. Applied rewrites 22.3%

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

   5. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\left(\frac{1}{16} + \frac{1}{16} \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i}} \]
   6. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{16} + \frac{1}{16} \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i}} \]

      2. lower-+.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{16} + \frac{1}{16} \cdot \frac{2 \cdot \alpha + 2 \cdot \beta}{i}\right)} - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i} \]

      3. distribute-lft-in N/A

         \[\leadsto \left(\frac{1}{16} + \frac{1}{16} \cdot \frac{\color{blue}{2 \cdot \left(\alpha + \beta\right)}}{i}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i} \]

      4. associate-*r/ N/A

         \[\leadsto \left(\frac{1}{16} + \color{blue}{\frac{\frac{1}{16} \cdot \left(2 \cdot \left(\alpha + \beta\right)\right)}{i}}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i} \]

      5. distribute-lft-in N/A

         \[\leadsto \left(\frac{1}{16} + \frac{\frac{1}{16} \cdot \color{blue}{\left(2 \cdot \alpha + 2 \cdot \beta\right)}}{i}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i} \]

      6. lower-/.f64 N/A

         \[\leadsto \left(\frac{1}{16} + \color{blue}{\frac{\frac{1}{16} \cdot \left(2 \cdot \alpha + 2 \cdot \beta\right)}{i}}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i} \]

      7. distribute-lft-in N/A

         \[\leadsto \left(\frac{1}{16} + \frac{\frac{1}{16} \cdot \color{blue}{\left(2 \cdot \left(\alpha + \beta\right)\right)}}{i}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i} \]

      8. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{16} + \frac{\color{blue}{\frac{1}{16} \cdot \left(2 \cdot \left(\alpha + \beta\right)\right)}}{i}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i} \]

      9. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{16} + \frac{\frac{1}{16} \cdot \color{blue}{\left(2 \cdot \left(\alpha + \beta\right)\right)}}{i}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i} \]

      10. lower-+.f64 N/A

          \[\leadsto \left(\frac{1}{16} + \frac{\frac{1}{16} \cdot \left(2 \cdot \color{blue}{\left(\alpha + \beta\right)}\right)}{i}\right) - \frac{1}{256} \cdot \frac{2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)}{i} \]

      11. associate-*r/ N/A

          \[\leadsto \left(\frac{1}{16} + \frac{\frac{1}{16} \cdot \left(2 \cdot \left(\alpha + \beta\right)\right)}{i}\right) - \color{blue}{\frac{\frac{1}{256} \cdot \left(2 \cdot \left(4 \cdot \left(\left(\alpha + \beta\right) - 1\right) + 8 \cdot \left(\alpha + \beta\right)\right) + 8 \cdot \left(1 + \left(\alpha + \beta\right)\right)\right)}{i}} \]

   7. Applied rewrites 88.4%

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

   8. Taylor expanded in beta around inf

      \[\leadsto \left(\frac{1}{16} + \frac{\frac{1}{16} \cdot \left(2 \cdot \left(\alpha + \beta\right)\right)}{i}\right) - \frac{\frac{1}{8} \cdot \beta}{i} \]
   9. Step-by-step derivation

   10. Applied rewrites 87.1%

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

   11. Taylor expanded in alpha around 0

       \[\leadsto \left(\frac{1}{16} + \frac{1}{8} \cdot \frac{\beta}{i}\right) - \frac{\color{blue}{\beta \cdot \frac{1}{8}}}{i} \]
   12. Step-by-step derivation

   13. Applied rewrites 87.5%

       \[\leadsto \mathsf{fma}\left(0.125, \frac{\beta}{i}, 0.0625\right) - \frac{\color{blue}{\beta \cdot 0.125}}{i} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 85.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.6 \cdot 10^{+144}:\\ \;\;\;\;\mathsf{fma}\left(0.0625, \frac{\beta \cdot \beta}{i \cdot i}, 0.0625\right) + -0.00390625 \cdot \frac{\mathsf{fma}\left(\beta \cdot \beta, 20, 4 \cdot \mathsf{fma}\left(\beta, \beta, -1\right)\right)}{i \cdot i}\\ \mathbf{else}:\\ \;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.6e+144)
   (+
    (fma 0.0625 (/ (* beta beta) (* i i)) 0.0625)
    (*
     -0.00390625
     (/ (fma (* beta beta) 20.0 (* 4.0 (fma beta beta -1.0))) (* i i))))
   (* (/ (+ i alpha) beta) (/ i beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.6e+144) {
		tmp = fma(0.0625, ((beta * beta) / (i * i)), 0.0625) + (-0.00390625 * (fma((beta * beta), 20.0, (4.0 * fma(beta, beta, -1.0))) / (i * i)));
	} else {
		tmp = ((i + alpha) / beta) * (i / beta);
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.6e+144)
		tmp = Float64(fma(0.0625, Float64(Float64(beta * beta) / Float64(i * i)), 0.0625) + Float64(-0.00390625 * Float64(fma(Float64(beta * beta), 20.0, Float64(4.0 * fma(beta, beta, -1.0))) / Float64(i * i))));
	else
		tmp = Float64(Float64(Float64(i + alpha) / beta) * Float64(i / beta));
	end
	return tmp
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.6e+144], N[(N[(0.0625 * N[(N[(beta * beta), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision] + 0.0625), $MachinePrecision] + N[(-0.00390625 * N[(N[(N[(beta * beta), $MachinePrecision] * 20.0 + N[(4.0 * N[(beta * beta + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.6e144

   1. Initial program 18.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. Add Preprocessing

   3. Taylor expanded in alpha around 0

      \[\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)}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{{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)} \]

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(i \cdot i\right)} \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. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. sub-neg N/A

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

      19. unpow2 N/A

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

      20. metadata-eval N/A

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

      21. lower-fma.f64 N/A

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

   5. Applied rewrites 15.8%

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

   6. Taylor expanded in i around inf

      \[\leadsto \left(\frac{1}{16} + \frac{1}{16} \cdot \frac{{\beta}^{2}}{{i}^{2}}\right) - \color{blue}{\frac{1}{256} \cdot \frac{4 \cdot \left({\beta}^{2} - 1\right) + \left(4 \cdot {\beta}^{2} + 16 \cdot {\beta}^{2}\right)}{{i}^{2}}} \]
   7. Step-by-step derivation

   8. Applied rewrites 82.8%

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

   if 1.6e144 < beta

   1. Initial program 2.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. Add Preprocessing

   3. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{i \cdot \left(\alpha + i\right)}}{{\beta}^{2}} \]

      3. lower-+.f64 N/A

         \[\leadsto \frac{i \cdot \color{blue}{\left(\alpha + i\right)}}{{\beta}^{2}} \]

      4. unpow2 N/A

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

      5. lower-*.f64 29.7

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

   5. Applied rewrites 29.7%

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{\beta \cdot \beta}} \]
   6. Step-by-step derivation

   7. Applied rewrites 83.3%

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

Alternative 3: 85.2% accurate, 3.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.6 \cdot 10^{+144}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.6e+144) 0.0625 (* (/ (+ i alpha) beta) (/ i beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.6e+144) {
		tmp = 0.0625;
	} else {
		tmp = ((i + alpha) / beta) * (i / beta);
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 1.6d+144) then
        tmp = 0.0625d0
    else
        tmp = ((i + alpha) / beta) * (i / beta)
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.6e+144) {
		tmp = 0.0625;
	} else {
		tmp = ((i + alpha) / beta) * (i / beta);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.6e+144:
		tmp = 0.0625
	else:
		tmp = ((i + alpha) / beta) * (i / beta)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.6e+144)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(Float64(i + alpha) / beta) * Float64(i / beta));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.6e+144)
		tmp = 0.0625;
	else
		tmp = ((i + alpha) / beta) * (i / beta);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.6e+144], 0.0625, N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.6e144

   1. Initial program 18.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. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16}} \]
   4. Step-by-step derivation

   5. Applied rewrites 82.5%

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

   if 1.6e144 < beta

   1. Initial program 2.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. Add Preprocessing

   3. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{i \cdot \left(\alpha + i\right)}}{{\beta}^{2}} \]

      3. lower-+.f64 N/A

         \[\leadsto \frac{i \cdot \color{blue}{\left(\alpha + i\right)}}{{\beta}^{2}} \]

      4. unpow2 N/A

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

      5. lower-*.f64 29.7

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

   5. Applied rewrites 29.7%

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{\beta \cdot \beta}} \]
   6. Step-by-step derivation

   7. Applied rewrites 83.3%

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

Alternative 4: 76.9% accurate, 3.4× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.6 \cdot 10^{+144}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{i \cdot i}{\beta}}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.6e+144) 0.0625 (/ (/ (* i i) beta) beta)))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.6e+144) {
		tmp = 0.0625;
	} else {
		tmp = ((i * i) / beta) / beta;
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 1.6d+144) then
        tmp = 0.0625d0
    else
        tmp = ((i * i) / beta) / beta
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.6e+144) {
		tmp = 0.0625;
	} else {
		tmp = ((i * i) / beta) / beta;
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.6e+144:
		tmp = 0.0625
	else:
		tmp = ((i * i) / beta) / beta
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.6e+144)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(Float64(i * i) / beta) / beta);
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.6e+144)
		tmp = 0.0625;
	else
		tmp = ((i * i) / beta) / beta;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.6e+144], 0.0625, N[(N[(N[(i * i), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.6e144

   1. Initial program 18.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. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16}} \]
   4. Step-by-step derivation

   5. Applied rewrites 82.5%

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

   if 1.6e144 < beta

   1. Initial program 2.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. Add Preprocessing

   3. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{i \cdot \left(\alpha + i\right)}}{{\beta}^{2}} \]

      3. lower-+.f64 N/A

         \[\leadsto \frac{i \cdot \color{blue}{\left(\alpha + i\right)}}{{\beta}^{2}} \]

      4. unpow2 N/A

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

      5. lower-*.f64 29.7

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

   5. Applied rewrites 29.7%

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{\beta \cdot \beta}} \]
   6. Step-by-step derivation

   7. Applied rewrites 59.7%

      \[\leadsto \frac{\frac{i \cdot \left(i + \alpha\right)}{\beta}}{\color{blue}{\beta}} \]

   8. Taylor expanded in i around inf

      \[\leadsto \frac{\frac{{i}^{2}}{\beta}}{\beta} \]
   9. Step-by-step derivation

   10. Applied rewrites 51.7%

       \[\leadsto \frac{\frac{i \cdot i}{\beta}}{\beta} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 75.8% accurate, 3.4× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.7 \cdot 10^{+225}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.7e+225) 0.0625 (* (/ i beta) (/ alpha beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.7e+225) {
		tmp = 0.0625;
	} else {
		tmp = (i / beta) * (alpha / beta);
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 1.7d+225) then
        tmp = 0.0625d0
    else
        tmp = (i / beta) * (alpha / beta)
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.7e+225) {
		tmp = 0.0625;
	} else {
		tmp = (i / beta) * (alpha / beta);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.7e+225:
		tmp = 0.0625
	else:
		tmp = (i / beta) * (alpha / beta)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.7e+225)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(i / beta) * Float64(alpha / beta));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.7e+225)
		tmp = 0.0625;
	else
		tmp = (i / beta) * (alpha / beta);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.7e+225], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.70000000000000009e225

   1. Initial program 18.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16}} \]
   4. Step-by-step derivation

   5. Applied rewrites 78.6%

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

   if 1.70000000000000009e225 < 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. Add Preprocessing

   3. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{i \cdot \left(\alpha + i\right)}}{{\beta}^{2}} \]

      3. lower-+.f64 N/A

         \[\leadsto \frac{i \cdot \color{blue}{\left(\alpha + i\right)}}{{\beta}^{2}} \]

      4. unpow2 N/A

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

      5. lower-*.f64 37.4

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

   5. Applied rewrites 37.4%

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{\beta \cdot \beta}} \]

   6. Taylor expanded in i around 0

      \[\leadsto \frac{\alpha \cdot i}{\color{blue}{\beta} \cdot \beta} \]
   7. Step-by-step derivation

   8. Applied rewrites 39.0%

      \[\leadsto \frac{\alpha \cdot i}{\color{blue}{\beta} \cdot \beta} \]

   9. Taylor expanded in i around 0

      \[\leadsto \frac{\alpha \cdot i}{\color{blue}{{\beta}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 39.7%

       \[\leadsto \alpha \cdot \color{blue}{\frac{i}{\beta \cdot \beta}} \]
   12. Step-by-step derivation

   13. Applied rewrites 49.5%

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

4. Final simplification 76.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.7 \cdot 10^{+225}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 74.8% accurate, 4.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.3 \cdot 10^{+238}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\alpha \cdot \frac{i}{\beta \cdot \beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.3e+238) 0.0625 (* alpha (/ i (* beta beta)))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.3e+238) {
		tmp = 0.0625;
	} else {
		tmp = alpha * (i / (beta * beta));
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 1.3d+238) then
        tmp = 0.0625d0
    else
        tmp = alpha * (i / (beta * beta))
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.3e+238) {
		tmp = 0.0625;
	} else {
		tmp = alpha * (i / (beta * beta));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.3e+238:
		tmp = 0.0625
	else:
		tmp = alpha * (i / (beta * beta))
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.3e+238)
		tmp = 0.0625;
	else
		tmp = Float64(alpha * Float64(i / Float64(beta * beta)));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.3e+238)
		tmp = 0.0625;
	else
		tmp = alpha * (i / (beta * beta));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.3e+238], 0.0625, N[(alpha * N[(i / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.3e238

   1. Initial program 17.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. Add Preprocessing

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16}} \]
   4. Step-by-step derivation

   5. Applied rewrites 78.4%

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

   if 1.3e238 < 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. Add Preprocessing

   3. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{{\beta}^{2}}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{i \cdot \left(\alpha + i\right)}}{{\beta}^{2}} \]

      3. lower-+.f64 N/A

         \[\leadsto \frac{i \cdot \color{blue}{\left(\alpha + i\right)}}{{\beta}^{2}} \]

      4. unpow2 N/A

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

      5. lower-*.f64 41.2

         \[\leadsto \frac{i \cdot \left(\alpha + i\right)}{\color{blue}{\beta \cdot \beta}} \]

   5. Applied rewrites 41.2%

      \[\leadsto \color{blue}{\frac{i \cdot \left(\alpha + i\right)}{\beta \cdot \beta}} \]

   6. Taylor expanded in i around 0

      \[\leadsto \frac{\alpha \cdot i}{\color{blue}{\beta} \cdot \beta} \]
   7. Step-by-step derivation

   8. Applied rewrites 42.9%

      \[\leadsto \frac{\alpha \cdot i}{\color{blue}{\beta} \cdot \beta} \]

   9. Taylor expanded in i around 0

      \[\leadsto \frac{\alpha \cdot i}{\color{blue}{{\beta}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 43.6%

       \[\leadsto \alpha \cdot \color{blue}{\frac{i}{\beta \cdot \beta}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 71.6% accurate, 115.0× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ 0.0625 \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i) :precision binary64 0.0625)

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return 0.0625;
}

Fortran

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

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return 0.0625;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return 0.0625

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return 0.0625
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = 0.0625;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := 0.0625

Derivation

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. Add Preprocessing

3. Taylor expanded in i around inf

   \[\leadsto \color{blue}{\frac{1}{16}} \]
4. Step-by-step derivation

5. Applied rewrites 74.2%

   \[\leadsto \color{blue}{0.0625} \]
6. Add Preprocessing

Reproduce

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