Octave 3.8, jcobi/4

Percentage Accurate: 16.4% → 86.7%

Time: 14.8s

Alternatives: 11

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: 16.4% 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: 86.7% accurate, 1.8× speedup

Math

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.7e+161) {
		tmp = 0.0625;
	} else {
		tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.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) :: tmp
    if (beta <= 1.7d+161) then
        tmp = 0.0625d0
    else
        tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0d0) + 1.0d0))) * (i / ((beta + alpha) + ((i * 2.0d0) + (-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 tmp;
	if (beta <= 1.7e+161) {
		tmp = 0.0625;
	} else {
		tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.0) + -1.0)));
	}
	return tmp;
}

Python

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

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.7e+161)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(Float64(i + alpha) / Float64(Float64(beta + alpha) + Float64(Float64(i * 2.0) + 1.0))) * Float64(i / Float64(Float64(beta + alpha) + Float64(Float64(i * 2.0) + -1.0))));
	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+161)
		tmp = 0.0625;
	else
		tmp = ((i + alpha) / ((beta + alpha) + ((i * 2.0) + 1.0))) * (i / ((beta + alpha) + ((i * 2.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_] := If[LessEqual[beta, 1.7e+161], 0.0625, N[(N[(N[(i + alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + N[(N[(i * 2.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(i / N[(N[(beta + alpha), $MachinePrecision] + N[(N[(i * 2.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.69999999999999996e161

   1. Initial program 17.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 43.5%

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

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

   if 1.69999999999999996e161 < 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 9.8%

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

      2. +-lowering-+.f64 24.6%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\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) \]

   7. Simplified 24.6%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

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

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

      4. times-frac N/A

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

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

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

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

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

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

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

      8. associate-+r+ N/A

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

      9. associate-+l+ N/A

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

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

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

      11. +-commutative N/A

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

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

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

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

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

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

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

      15. /-lowering-/.f64 N/A

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

      16. associate-+r+ N/A

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

      17. associate--l+ N/A

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

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

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

   9. Applied egg-rr 69.0%

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

4. Final simplification 77.6%

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

Alternative 2: 86.0% accurate, 2.4× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.20000000000000005e168

   1. Initial program 17.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 42.9%

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

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

   if 1.20000000000000005e168 < 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 10.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 \mathsf{/.f64}\left(\color{blue}{\left(i \cdot \left(\alpha + i\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(i, \left(\alpha + i\right)\right), \mathsf{+.f64}\left(\color{blue}{\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) \]

      2. +-lowering-+.f64 26.3%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(i, \mathsf{+.f64}\left(\alpha, i\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) \]

   7. Simplified 26.3%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

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

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

      4. times-frac N/A

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

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

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

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

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

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

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

      8. associate-+r+ N/A

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

      9. associate-+l+ N/A

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

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

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

      11. +-commutative N/A

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

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

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

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

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

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

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

      15. /-lowering-/.f64 N/A

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

      16. associate-+r+ N/A

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

      17. associate--l+ N/A

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

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

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

   9. Applied egg-rr 71.3%

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

   10. Taylor expanded in beta around inf

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

       1. /-lowering-/.f64 68.9%

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

   12. Simplified 68.9%

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

Alternative 3: 85.9% accurate, 3.3× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 9.5000000000000005e173

   1. Initial program 16.9%

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

      1. /-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 42.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 78.8%

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

   if 9.5000000000000005e173 < 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 10.8%

      \[\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.0%

         \[\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.0%

      \[\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 70.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 70.0%

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

       1. clear-num N/A

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

       2. associate-/r/ N/A

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

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

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

       4. /-lowering-/.f64 70.3%

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

   11. Applied egg-rr 70.3%

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

4. Final simplification 77.5%

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

Alternative 4: 86.0% accurate, 3.8× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.4599999999999999e174

   1. Initial program 16.9%

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

      1. /-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 42.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 78.8%

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

   if 1.4599999999999999e174 < 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 10.8%

      \[\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.0%

         \[\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.0%

      \[\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 70.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 70.0%

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

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

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

Alternative 5: 85.9% accurate, 3.8× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 8.7999999999999999e173

   1. Initial program 16.9%

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

      1. /-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 42.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 78.8%

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

   if 8.7999999999999999e173 < 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 10.8%

      \[\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.0%

         \[\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.0%

      \[\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 70.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 70.0%

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

       1. *-commutative N/A

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

       2. associate-*l/ N/A

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

       3. associate-/l* N/A

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

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

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

       5. associate-/l* N/A

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

       6. clear-num N/A

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

       7. un-div-inv N/A

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

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

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

       9. /-lowering-/.f64 N/A

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

       10. +-lowering-+.f64 70.0%

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

   11. Applied egg-rr 70.0%

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

Alternative 6: 85.9% accurate, 3.8× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 9.8000000000000002e173

   1. Initial program 16.9%

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

      1. /-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 42.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 78.8%

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

   if 9.8000000000000002e173 < 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 10.8%

      \[\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.0%

         \[\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.0%

      \[\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 70.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 70.0%

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

4. Final simplification 77.5%

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

Alternative 7: 84.2% accurate, 3.8× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 9.5000000000000005e173

   1. Initial program 16.9%

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

      1. /-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 42.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 78.8%

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

   if 9.5000000000000005e173 < 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 10.8%

      \[\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.0%

         \[\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.0%

      \[\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 70.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 70.0%

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

       1. clear-num N/A

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

       2. associate-/r/ N/A

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

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

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

       4. /-lowering-/.f64 70.3%

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

   11. Applied egg-rr 70.3%

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

   12. Taylor expanded in i around inf

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

   14. Simplified 64.1%

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

4. Final simplification 76.5%

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

Alternative 8: 84.3% accurate, 4.4× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.95 \cdot 10^{+174}:\\ \;\;\;\;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.95e+174) 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.95e+174) {
		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.95d+174) 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.95e+174) {
		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.95e+174:
		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.95e+174)
		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.95e+174)
		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.95e+174], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.9499999999999999e174

   1. Initial program 16.9%

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

      1. /-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 42.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 78.8%

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

   if 1.9499999999999999e174 < 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 10.8%

      \[\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.0%

         \[\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.0%

      \[\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 70.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 70.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 63.9%

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

   12. Simplified 63.9%

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

Alternative 9: 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 4.2 \cdot 10^{+221}:\\ \;\;\;\;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 4.2e+221) 0.0625 (* (/ i beta) (/ alpha beta))))

C

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.20000000000000004e221

   1. Initial program 15.6%

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

      1. /-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.0%

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

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

   if 4.20000000000000004e221 < 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 13.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 41.7%

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

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

   8. Taylor expanded in i around 0

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

      1. associate-/l* N/A

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

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

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

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

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 43.8%

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

   10. Simplified 43.8%

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

       1. associate-*r/ N/A

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

       2. times-frac N/A

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

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

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

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

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

       5. /-lowering-/.f64 52.5%

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

   12. Applied egg-rr 52.5%

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

4. Final simplification 73.1%

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

Alternative 10: 74.7% accurate, 4.4× speedup

Math

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

C

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.00000000000000014e233

   1. Initial program 15.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. 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 39.8%

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

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

   if 3.00000000000000014e233 < 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 11.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 45.1%

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

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

   8. Taylor expanded in i around 0

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

      1. associate-/l* N/A

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

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

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

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

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 47.3%

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

   10. Simplified 47.3%

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

Alternative 11: 71.3% 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 14.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. 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 37.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 70.4%

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

Reproduce

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