Octave 3.8, jcobi/4

Percentage Accurate: 16.3% → 85.1%

Time: 13.9s

Alternatives: 9

Speedup: 115.0×

Specification

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

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_2 := t\_1 \cdot t\_1\\ \frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (* i (+ (+ alpha beta) i)))
        (t_1 (+ (+ alpha beta) (* 2.0 i)))
        (t_2 (* t_1 t_1)))
   (/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = i * ((alpha + beta) + i)
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = t_1 * t_1
    code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Python

def code(alpha, beta, i):
	t_0 = i * ((alpha + beta) + i)
	t_1 = (alpha + beta) + (2.0 * i)
	t_2 = t_1 * t_1
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)

Julia

function code(alpha, beta, i)
	t_0 = Float64(i * Float64(Float64(alpha + beta) + i))
	t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_2 = Float64(t_1 * t_1)
	return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0))
end

MATLAB

function tmp = code(alpha, beta, i)
	t_0 = i * ((alpha + beta) + i);
	t_1 = (alpha + beta) + (2.0 * i);
	t_2 = t_1 * t_1;
	tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]

Initial Program: 16.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_2 := t\_1 \cdot t\_1\\ \frac{\frac{t\_0 \cdot \left(\beta \cdot \alpha + t\_0\right)}{t\_2}}{t\_2 - 1} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (* i (+ (+ alpha beta) i)))
        (t_1 (+ (+ alpha beta) (* 2.0 i)))
        (t_2 (* t_1 t_1)))
   (/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = i * ((alpha + beta) + i)
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = t_1 * t_1
    code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Python

def code(alpha, beta, i):
	t_0 = i * ((alpha + beta) + i)
	t_1 = (alpha + beta) + (2.0 * i)
	t_2 = t_1 * t_1
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)

Julia

function code(alpha, beta, i)
	t_0 = Float64(i * Float64(Float64(alpha + beta) + i))
	t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_2 = Float64(t_1 * t_1)
	return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0))
end

MATLAB

function tmp = code(alpha, beta, i)
	t_0 = i * ((alpha + beta) + i);
	t_1 = (alpha + beta) + (2.0 * i);
	t_2 = t_1 * t_1;
	tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]

Alternative 1: 85.1% accurate, 2.7× speedup

Math

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.2e+187) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} 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 <= 3.2d+187) then
        tmp = 0.0625d0 + (0.015625d0 / (i * i))
    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 <= 3.2e+187) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} 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 <= 3.2e+187:
		tmp = 0.0625 + (0.015625 / (i * i))
	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 <= 3.2e+187)
		tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i)));
	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 <= 3.2e+187)
		tmp = 0.0625 + (0.015625 / (i * i));
	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, 3.2e+187], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 3.19999999999999993e187

   1. Initial program 19.5%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. sub-neg N/A

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

      19. unpow2 N/A

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

      20. metadata-eval N/A

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

      21. lower-fma.f64 N/A

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

   5. Applied rewrites 17.6%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\frac{{i}^{2}}{4 \cdot {i}^{2} - 1}} \]
   7. Step-by-step derivation

   8. Applied rewrites 31.3%

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

   9. Taylor expanded in i around inf

      \[\leadsto \frac{1}{16} + \frac{1}{64} \cdot \color{blue}{\frac{1}{{i}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 81.7%

       \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   if 3.19999999999999993e187 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 24.8

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

   5. Applied rewrites 24.8%

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

   7. Applied rewrites 26.6%

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

   9. Applied rewrites 77.7%

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

   11. Applied rewrites 78.1%

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

4. Final simplification 81.3%

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

Alternative 2: 85.0% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.19999999999999993e187

   1. Initial program 19.5%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. sub-neg N/A

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

      19. unpow2 N/A

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

      20. metadata-eval N/A

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

      21. lower-fma.f64 N/A

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

   5. Applied rewrites 17.6%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\frac{{i}^{2}}{4 \cdot {i}^{2} - 1}} \]
   7. Step-by-step derivation

   8. Applied rewrites 31.3%

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

   9. Taylor expanded in i around inf

      \[\leadsto \frac{1}{16} + \frac{1}{64} \cdot \color{blue}{\frac{1}{{i}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 81.7%

       \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   if 3.19999999999999993e187 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 24.8

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

   5. Applied rewrites 24.8%

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

   7. Applied rewrites 78.1%

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

Alternative 3: 83.0% accurate, 3.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.19999999999999993e187

   1. Initial program 19.5%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. sub-neg N/A

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

      19. unpow2 N/A

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

      20. metadata-eval N/A

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

      21. lower-fma.f64 N/A

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

   5. Applied rewrites 17.6%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\frac{{i}^{2}}{4 \cdot {i}^{2} - 1}} \]
   7. Step-by-step derivation

   8. Applied rewrites 31.3%

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

   9. Taylor expanded in i around inf

      \[\leadsto \frac{1}{16} + \frac{1}{64} \cdot \color{blue}{\frac{1}{{i}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 81.7%

       \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   if 3.19999999999999993e187 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 24.8

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

   5. Applied rewrites 24.8%

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

   7. Applied rewrites 26.6%

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

   9. Applied rewrites 77.7%

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

   10. Taylor expanded in alpha around 0

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

   12. Applied rewrites 70.7%

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

4. Final simplification 80.6%

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

Alternative 4: 76.6% accurate, 3.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 7.99999999999999926e187

   1. Initial program 19.5%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. sub-neg N/A

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

      19. unpow2 N/A

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

      20. metadata-eval N/A

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

      21. lower-fma.f64 N/A

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

   5. Applied rewrites 17.6%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\frac{{i}^{2}}{4 \cdot {i}^{2} - 1}} \]
   7. Step-by-step derivation

   8. Applied rewrites 31.3%

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

   9. Taylor expanded in i around inf

      \[\leadsto \frac{1}{16} + \frac{1}{64} \cdot \color{blue}{\frac{1}{{i}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 81.7%

       \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   if 7.99999999999999926e187 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 24.8

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

   5. Applied rewrites 24.8%

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

   7. Applied rewrites 77.6%

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

   8. Taylor expanded in i around inf

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

   10. Applied rewrites 55.2%

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

Alternative 5: 73.9% accurate, 3.4× speedup

Math

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 7.5e+262) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} 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 <= 7.5d+262) then
        tmp = 0.0625d0 + (0.015625d0 / (i * i))
    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 <= 7.5e+262) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} 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 <= 7.5e+262:
		tmp = 0.0625 + (0.015625 / (i * i))
	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 <= 7.5e+262)
		tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i)));
	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 <= 7.5e+262)
		tmp = 0.0625 + (0.015625 / (i * i));
	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, 7.5e+262], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 7.49999999999999977e262

   1. Initial program 18.0%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. sub-neg N/A

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

      19. unpow2 N/A

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

      20. metadata-eval N/A

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

      21. lower-fma.f64 N/A

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

   5. Applied rewrites 16.2%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\frac{{i}^{2}}{4 \cdot {i}^{2} - 1}} \]
   7. Step-by-step derivation

   8. Applied rewrites 29.1%

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

   9. Taylor expanded in i around inf

      \[\leadsto \frac{1}{16} + \frac{1}{64} \cdot \color{blue}{\frac{1}{{i}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 77.3%

       \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   if 7.49999999999999977e262 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 31.4

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

   5. Applied rewrites 31.4%

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

   6. Taylor expanded in i around 0

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

   8. Applied rewrites 34.0%

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

   10. Applied rewrites 47.1%

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

4. Final simplification 76.5%

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

Alternative 6: 73.3% accurate, 3.4× speedup

Math

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

FPCore

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

C

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

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 7.5e+262)
		tmp = 0.0625 + (0.015625 / (i * i));
	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, 7.5e+262], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(alpha * N[(N[(i / beta), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 7.49999999999999977e262

   1. Initial program 18.0%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. sub-neg N/A

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

      19. unpow2 N/A

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

      20. metadata-eval N/A

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

      21. lower-fma.f64 N/A

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

   5. Applied rewrites 16.2%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\frac{{i}^{2}}{4 \cdot {i}^{2} - 1}} \]
   7. Step-by-step derivation

   8. Applied rewrites 29.1%

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

   9. Taylor expanded in i around inf

      \[\leadsto \frac{1}{16} + \frac{1}{64} \cdot \color{blue}{\frac{1}{{i}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 77.3%

       \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   if 7.49999999999999977e262 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 31.4

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

   5. Applied rewrites 31.4%

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

   6. Taylor expanded in i around 0

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

   8. Applied rewrites 34.0%

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

   10. Applied rewrites 34.0%

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

Alternative 7: 73.3% accurate, 4.4× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 7.49999999999999977e262

   1. Initial program 18.0%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. sub-neg N/A

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

      19. unpow2 N/A

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

      20. metadata-eval N/A

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

      21. lower-fma.f64 N/A

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

   5. Applied rewrites 16.2%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\frac{{i}^{2}}{4 \cdot {i}^{2} - 1}} \]
   7. Step-by-step derivation

   8. Applied rewrites 29.1%

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

   9. Taylor expanded in i around inf

      \[\leadsto \frac{1}{16} + \frac{1}{64} \cdot \color{blue}{\frac{1}{{i}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 77.3%

       \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   if 7.49999999999999977e262 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 3.7%

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

   6. Taylor expanded in i around inf

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

      1. cancel-sign-sub-inv N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. distribute-lft-out N/A

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

      7. lower-*.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 N/A

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

      12. lower-+.f64 34.0

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

   8. Applied rewrites 34.0%

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

   9. Taylor expanded in i around 0

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

   11. Applied rewrites 34.0%

       \[\leadsto \frac{0}{\color{blue}{i}} \]

   12. Taylor expanded in i around 0

       \[\leadsto 0 \]
   13. Step-by-step derivation

   14. Applied rewrites 34.0%

       \[\leadsto 0 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 73.0% accurate, 16.4× speedup

Math

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

C

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

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 7.5e+262:
		tmp = 0.0625
	else:
		tmp = 0.0
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 7.5e+262)
		tmp = 0.0625;
	else
		tmp = 0.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 <= 7.5e+262)
		tmp = 0.0625;
	else
		tmp = 0.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, 7.5e+262], 0.0625, 0.0]

Derivation

1. Split input into 2 regimes

2. if beta < 7.49999999999999977e262

   1. Initial program 18.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 77.3%

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

   if 7.49999999999999977e262 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 3.7%

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

   6. Taylor expanded in i around inf

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

      1. cancel-sign-sub-inv N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. distribute-lft-out N/A

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

      7. lower-*.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 N/A

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

      12. lower-+.f64 34.0

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

   8. Applied rewrites 34.0%

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

   9. Taylor expanded in i around 0

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

   11. Applied rewrites 34.0%

       \[\leadsto \frac{0}{\color{blue}{i}} \]

   12. Taylor expanded in i around 0

       \[\leadsto 0 \]
   13. Step-by-step derivation

   14. Applied rewrites 34.0%

       \[\leadsto 0 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 70.0% accurate, 115.0× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = 0.0625d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 17.5%

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

3. Taylor expanded in i around inf

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

5. Applied rewrites 75.3%

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

Reproduce

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