Octave 3.8, jcobi/4

Percentage Accurate: 15.7% → 85.9%

Time: 14.8s

Alternatives: 6

Speedup: 53.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: 85.9% accurate, 1.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \beta + i \cdot 2\\ \mathbf{if}\;\beta \leq 4 \cdot 10^{+183}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta}{\alpha + \left(t\_0 + 1\right)} \cdot \frac{\frac{\alpha + i}{\frac{\beta + \alpha}{i}}}{\left(\alpha + t\_0\right) + -1}\\ \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 (+ beta (* i 2.0))))
   (if (<= beta 4e+183)
     0.0625
     (*
      (/ beta (+ alpha (+ t_0 1.0)))
      (/ (/ (+ alpha i) (/ (+ beta alpha) i)) (+ (+ alpha t_0) -1.0))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = beta + (i * 2.0);
	double tmp;
	if (beta <= 4e+183) {
		tmp = 0.0625;
	} else {
		tmp = (beta / (alpha + (t_0 + 1.0))) * (((alpha + i) / ((beta + alpha) / i)) / ((alpha + t_0) + -1.0));
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = beta + (i * 2.0d0)
    if (beta <= 4d+183) then
        tmp = 0.0625d0
    else
        tmp = (beta / (alpha + (t_0 + 1.0d0))) * (((alpha + i) / ((beta + alpha) / i)) / ((alpha + t_0) + (-1.0d0)))
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = beta + (i * 2.0);
	double tmp;
	if (beta <= 4e+183) {
		tmp = 0.0625;
	} else {
		tmp = (beta / (alpha + (t_0 + 1.0))) * (((alpha + i) / ((beta + alpha) / i)) / ((alpha + t_0) + -1.0));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = beta + (i * 2.0)
	tmp = 0
	if beta <= 4e+183:
		tmp = 0.0625
	else:
		tmp = (beta / (alpha + (t_0 + 1.0))) * (((alpha + i) / ((beta + alpha) / i)) / ((alpha + t_0) + -1.0))
	return tmp

Julia

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

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = beta + (i * 2.0);
	tmp = 0.0;
	if (beta <= 4e+183)
		tmp = 0.0625;
	else
		tmp = (beta / (alpha + (t_0 + 1.0))) * (((alpha + i) / ((beta + alpha) / i)) / ((alpha + t_0) + -1.0));
	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_] := Block[{t$95$0 = N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+183], 0.0625, N[(N[(beta / N[(alpha + N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(alpha + i), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 3.99999999999999979e183

   1. Initial program 18.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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 41.3%

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

   5. Taylor expanded in i around inf

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

   7. Simplified 82.3%

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

   if 3.99999999999999979e183 < 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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 5.6%

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

   5. Taylor expanded in i around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(i, \mathsf{+.f64}\left(\alpha, \beta\right)\right)\right), \mathsf{*.f64}\left(\alpha, \beta\right)\right), \color{blue}{\left(\frac{i}{\alpha + \beta}\right)}\right), \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right), \mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right)\right), -1\right)\right) \]
   6. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(i, \mathsf{+.f64}\left(\alpha, \beta\right)\right)\right), \mathsf{*.f64}\left(\alpha, \beta\right)\right), \mathsf{/.f64}\left(i, \left(\alpha + \beta\right)\right)\right), \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right), \color{blue}{\mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right)}\right), -1\right)\right) \]

      2. +-lowering-+.f64 5.6%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(i, \mathsf{+.f64}\left(\alpha, \beta\right)\right)\right), \mathsf{*.f64}\left(\alpha, \beta\right)\right), \mathsf{/.f64}\left(i, \mathsf{+.f64}\left(\alpha, \beta\right)\right)\right), \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right), \mathsf{+.f64}\left(\alpha, \color{blue}{\mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)}\right)\right), -1\right)\right) \]

   7. Simplified 5.6%

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

   8. Taylor expanded in beta around inf

      \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(\color{blue}{\left(\beta \cdot \left(\alpha + i\right)\right)}, \mathsf{/.f64}\left(i, \mathsf{+.f64}\left(\alpha, \beta\right)\right)\right), \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right), \mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right)\right), -1\right)\right) \]
   9. Step-by-step derivation

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{*.f64}\left(\beta, \left(\alpha + i\right)\right), \mathsf{/.f64}\left(i, \mathsf{+.f64}\left(\alpha, \beta\right)\right)\right), \mathsf{+.f64}\left(\mathsf{*.f64}\left(\color{blue}{\mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right)}, \mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right)\right), -1\right)\right) \]

      2. +-lowering-+.f64 5.6%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{*.f64}\left(\beta, \mathsf{+.f64}\left(\alpha, i\right)\right), \mathsf{/.f64}\left(i, \mathsf{+.f64}\left(\alpha, \beta\right)\right)\right), \mathsf{+.f64}\left(\mathsf{*.f64}\left(\mathsf{+.f64}\left(\alpha, \color{blue}{\mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)}\right), \mathsf{+.f64}\left(\alpha, \mathsf{+.f64}\left(\beta, \mathsf{*.f64}\left(i, 2\right)\right)\right)\right), -1\right)\right) \]

   10. Simplified 5.6%

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

       1. associate-*l* N/A

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

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

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

       3. associate-+r+ N/A

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

       4. *-commutative N/A

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

       5. associate-+r+ N/A

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

       6. *-commutative N/A

          \[\leadsto \frac{\beta \cdot \left(\left(\alpha + i\right) \cdot \frac{i}{\alpha + \beta}\right)}{\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)} \]

       7. times-frac N/A

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

       8. *-lowering-*.f64 N/A

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

   12. Applied egg-rr 83.8%

       \[\leadsto \color{blue}{\frac{\beta}{\alpha + \left(\left(\beta + i \cdot 2\right) + 1\right)} \cdot \frac{\frac{i + \alpha}{\frac{\alpha + \beta}{i}}}{\left(\alpha + \left(\beta + i \cdot 2\right)\right) + -1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 4 \cdot 10^{+183}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta}{\alpha + \left(\left(\beta + i \cdot 2\right) + 1\right)} \cdot \frac{\frac{\alpha + i}{\frac{\beta + \alpha}{i}}}{\left(\alpha + \left(\beta + i \cdot 2\right)\right) + -1}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 85.5% accurate, 3.8× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.45 \cdot 10^{+184}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha + i}{\beta}}{\frac{\beta}{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
 (if (<= beta 1.45e+184) 0.0625 (/ (/ (+ alpha i) beta) (/ beta i))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.45e+184) {
		tmp = 0.0625;
	} else {
		tmp = ((alpha + i) / beta) / (beta / i);
	}
	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.45d+184) then
        tmp = 0.0625d0
    else
        tmp = ((alpha + i) / beta) / (beta / i)
    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.45e+184) {
		tmp = 0.0625;
	} else {
		tmp = ((alpha + i) / beta) / (beta / i);
	}
	return tmp;
}

Python

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

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.45e+184)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(Float64(alpha + i) / beta) / Float64(beta / i));
	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.45e+184)
		tmp = 0.0625;
	else
		tmp = ((alpha + i) / beta) / (beta / i);
	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.45e+184], 0.0625, N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.4499999999999999e184

   1. Initial program 18.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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 41.3%

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

   5. Taylor expanded in i around inf

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

   7. Simplified 82.3%

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

   if 1.4499999999999999e184 < 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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 5.6%

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

   5. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(i \cdot \left(\alpha + i\right)\right), \color{blue}{\left({\beta}^{2}\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \left(\alpha + i\right)\right), \left({\color{blue}{\beta}}^{2}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \left({\beta}^{2}\right)\right) \]

      4. unpow2 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \left(\beta \cdot \color{blue}{\beta}\right)\right) \]

      5. *-lowering-*.f64 23.2%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \mathsf{*.f64}\left(\beta, \color{blue}{\beta}\right)\right) \]

   7. Simplified 23.2%

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

      1. *-commutative N/A

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

      2. times-frac N/A

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

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(\frac{\alpha + i}{\beta}\right), \color{blue}{\left(\frac{i}{\beta}\right)}\right) \]

      4. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\left(\alpha + i\right), \beta\right), \left(\frac{\color{blue}{i}}{\beta}\right)\right) \]

      5. +-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\left(i + \alpha\right), \beta\right), \left(\frac{i}{\beta}\right)\right) \]

      6. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \left(\frac{i}{\beta}\right)\right) \]

      7. /-lowering-/.f64 77.4%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \mathsf{/.f64}\left(i, \color{blue}{\beta}\right)\right) \]

   9. Applied egg-rr 77.4%

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

       1. clear-num N/A

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

       2. un-div-inv N/A

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

       3. /-lowering-/.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(\left(\frac{i + \alpha}{\beta}\right), \color{blue}{\left(\frac{\beta}{i}\right)}\right) \]

       4. /-lowering-/.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(\mathsf{/.f64}\left(\left(i + \alpha\right), \beta\right), \left(\frac{\color{blue}{\beta}}{i}\right)\right) \]

       5. +-lowering-+.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \left(\frac{\beta}{i}\right)\right) \]

       6. /-lowering-/.f64 77.7%

          \[\leadsto \mathsf{/.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \mathsf{/.f64}\left(\beta, \color{blue}{i}\right)\right) \]

   11. Applied egg-rr 77.7%

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

4. Final simplification 81.7%

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

Alternative 3: 85.5% accurate, 3.8× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 6.8 \cdot 10^{+183}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{\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 6.8e+183) 0.0625 (* (/ (+ alpha i) beta) (/ i beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 6.8e+183) {
		tmp = 0.0625;
	} else {
		tmp = ((alpha + i) / 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 <= 6.8d+183) then
        tmp = 0.0625d0
    else
        tmp = ((alpha + i) / 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 <= 6.8e+183) {
		tmp = 0.0625;
	} else {
		tmp = ((alpha + i) / beta) * (i / beta);
	}
	return tmp;
}

Python

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

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 6.8e+183)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(Float64(alpha + i) / 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 <= 6.8e+183)
		tmp = 0.0625;
	else
		tmp = ((alpha + i) / 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, 6.8e+183], 0.0625, N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 6.8e183

   1. Initial program 18.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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 41.3%

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

   5. Taylor expanded in i around inf

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

   7. Simplified 82.3%

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

   if 6.8e183 < 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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 5.6%

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

   5. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(i \cdot \left(\alpha + i\right)\right), \color{blue}{\left({\beta}^{2}\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \left(\alpha + i\right)\right), \left({\color{blue}{\beta}}^{2}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \left({\beta}^{2}\right)\right) \]

      4. unpow2 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \left(\beta \cdot \color{blue}{\beta}\right)\right) \]

      5. *-lowering-*.f64 23.2%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \mathsf{*.f64}\left(\beta, \color{blue}{\beta}\right)\right) \]

   7. Simplified 23.2%

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

      1. *-commutative N/A

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

      2. times-frac N/A

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

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(\frac{\alpha + i}{\beta}\right), \color{blue}{\left(\frac{i}{\beta}\right)}\right) \]

      4. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\left(\alpha + i\right), \beta\right), \left(\frac{\color{blue}{i}}{\beta}\right)\right) \]

      5. +-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\left(i + \alpha\right), \beta\right), \left(\frac{i}{\beta}\right)\right) \]

      6. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \left(\frac{i}{\beta}\right)\right) \]

      7. /-lowering-/.f64 77.4%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \mathsf{/.f64}\left(i, \color{blue}{\beta}\right)\right) \]

   9. Applied egg-rr 77.4%

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

4. Final simplification 81.6%

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

Alternative 4: 83.5% accurate, 4.4× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.05 \cdot 10^{+190}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{i}{\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.05e+190) 0.0625 (* (/ i beta) (/ i beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.05e+190) {
		tmp = 0.0625;
	} else {
		tmp = (i / 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.05d+190) then
        tmp = 0.0625d0
    else
        tmp = (i / 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.05e+190) {
		tmp = 0.0625;
	} else {
		tmp = (i / beta) * (i / beta);
	}
	return tmp;
}

Python

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

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.05e+190)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(i / 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.05e+190)
		tmp = 0.0625;
	else
		tmp = (i / 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.05e+190], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.05e190

   1. Initial program 18.5%

      \[\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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 40.7%

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

   5. Taylor expanded in i around inf

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

   7. Simplified 81.8%

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

   if 1.05e190 < 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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 6.1%

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

   5. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(i \cdot \left(\alpha + i\right)\right), \color{blue}{\left({\beta}^{2}\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \left(\alpha + i\right)\right), \left({\color{blue}{\beta}}^{2}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \left({\beta}^{2}\right)\right) \]

      4. unpow2 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \left(\beta \cdot \color{blue}{\beta}\right)\right) \]

      5. *-lowering-*.f64 25.3%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \mathsf{*.f64}\left(\beta, \color{blue}{\beta}\right)\right) \]

   7. Simplified 25.3%

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

      1. *-commutative N/A

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

      2. times-frac N/A

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

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(\frac{\alpha + i}{\beta}\right), \color{blue}{\left(\frac{i}{\beta}\right)}\right) \]

      4. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\left(\alpha + i\right), \beta\right), \left(\frac{\color{blue}{i}}{\beta}\right)\right) \]

      5. +-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\left(i + \alpha\right), \beta\right), \left(\frac{i}{\beta}\right)\right) \]

      6. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \left(\frac{i}{\beta}\right)\right) \]

      7. /-lowering-/.f64 80.0%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \mathsf{/.f64}\left(i, \color{blue}{\beta}\right)\right) \]

   9. Applied egg-rr 80.0%

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

   10. Taylor expanded in i around inf

       \[\leadsto \mathsf{*.f64}\left(\color{blue}{\left(\frac{i}{\beta}\right)}, \mathsf{/.f64}\left(i, \beta\right)\right) \]
   11. Step-by-step derivation

       1. /-lowering-/.f64 78.2%

          \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(i, \beta\right), \mathsf{/.f64}\left(\color{blue}{i}, \beta\right)\right) \]

   12. Simplified 78.2%

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

Alternative 5: 75.7% accurate, 4.4× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.15 \cdot 10^{+213}:\\ \;\;\;\;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 2.15e+213) 0.0625 (* (/ i beta) (/ alpha beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 2.15e+213) {
		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 <= 2.15d+213) 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 <= 2.15e+213) {
		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 <= 2.15e+213:
		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 <= 2.15e+213)
		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 <= 2.15e+213)
		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, 2.15e+213], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.14999999999999997e213

   1. Initial program 18.2%

      \[\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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 40.2%

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

   5. Taylor expanded in i around inf

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

   7. Simplified 81.3%

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

   if 2.14999999999999997e213 < 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. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

   3. Simplified 6.7%

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

   5. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(i \cdot \left(\alpha + i\right)\right), \color{blue}{\left({\beta}^{2}\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \left(\alpha + i\right)\right), \left({\color{blue}{\beta}}^{2}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \left({\beta}^{2}\right)\right) \]

      4. unpow2 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \left(\beta \cdot \color{blue}{\beta}\right)\right) \]

      5. *-lowering-*.f64 27.6%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\right)\right), \mathsf{*.f64}\left(\beta, \color{blue}{\beta}\right)\right) \]

   7. Simplified 27.6%

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

      1. *-commutative N/A

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

      2. times-frac N/A

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

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(\frac{\alpha + i}{\beta}\right), \color{blue}{\left(\frac{i}{\beta}\right)}\right) \]

      4. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\left(\alpha + i\right), \beta\right), \left(\frac{\color{blue}{i}}{\beta}\right)\right) \]

      5. +-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\left(i + \alpha\right), \beta\right), \left(\frac{i}{\beta}\right)\right) \]

      6. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \left(\frac{i}{\beta}\right)\right) \]

      7. /-lowering-/.f64 87.4%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(i, \alpha\right), \beta\right), \mathsf{/.f64}\left(i, \color{blue}{\beta}\right)\right) \]

   9. Applied egg-rr 87.4%

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

   10. Taylor expanded in i around 0

       \[\leadsto \mathsf{*.f64}\left(\color{blue}{\left(\frac{\alpha}{\beta}\right)}, \mathsf{/.f64}\left(i, \beta\right)\right) \]
   11. Step-by-step derivation

       1. /-lowering-/.f64 33.0%

          \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(\alpha, \beta\right), \mathsf{/.f64}\left(\color{blue}{i}, \beta\right)\right) \]

   12. Simplified 33.0%

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

4. Final simplification 75.7%

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

Alternative 6: 71.1% accurate, 53.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.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. Step-by-step derivation

   1. /-lowering-/.f64 N/A

      \[\leadsto \mathsf{/.f64}\left(\left(\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)}\right), \color{blue}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right)}\right) \]

3. Simplified 36.3%

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

5. Taylor expanded in i around inf

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

7. Simplified 73.1%

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

Reproduce

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