Octave 3.8, jcobi/4

Percentage Accurate: 16.6% → 83.5%

Time: 17.2s

Alternatives: 8

Speedup: 53.0×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 16.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 83.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t\_0 \cdot t\_0\\ t_2 := 0.125 \cdot \frac{\beta}{i}\\ t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_4 := \beta + \left(i + \alpha\right)\\ t_5 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\ \mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\ \;\;\;\;\frac{i \cdot t\_4}{\mathsf{fma}\left(t\_5, t\_5, -1\right)} \cdot \frac{\frac{\mathsf{fma}\left(i, t\_4, \alpha \cdot \beta\right)}{t\_5}}{t\_5}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + t\_2\right) - t\_2\\ \end{array} \end{array} \]

FPCore

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = 0.125 * (beta / i);
	double t_3 = i * (i + (alpha + beta));
	double t_4 = beta + (i + alpha);
	double t_5 = fma(i, 2.0, (alpha + beta));
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
		tmp = ((i * t_4) / fma(t_5, t_5, -1.0)) * ((fma(i, t_4, (alpha * beta)) / t_5) / t_5);
	} else {
		tmp = (0.0625 + t_2) - t_2;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0

   1. Initial program 40.0%

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

      1. associate-/l/ 34.5%

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

      2. times-frac 99.7%

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

   3. Simplified 99.7%

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

   if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

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

   3. Simplified 2.9%

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

   5. Taylor expanded in i around inf 80.3%

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

   6. Taylor expanded in alpha around 0 74.4%

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

      1. associate-*r/ 74.4%

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

   8. Simplified 74.4%

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

   9. Taylor expanded in i around inf 74.4%

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

   10. Taylor expanded in alpha around 0 75.3%

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

4. Final simplification 84.7%

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

Alternative 2: 83.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t\_0 \cdot t\_0\\ t_2 := 0.125 \cdot \frac{\beta}{i}\\ t_3 := i + \left(\alpha + \beta\right)\\ t_4 := i \cdot t\_3\\ t_5 := \alpha + \mathsf{fma}\left(i, 2, \beta\right)\\ \mathbf{if}\;\frac{\frac{t\_4 \cdot \left(t\_4 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\ \;\;\;\;i \cdot \left(\frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{\mathsf{fma}\left(t\_5, t\_5, -1\right)} \cdot \frac{t\_3}{t\_5 \cdot t\_5}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + t\_2\right) - t\_2\\ \end{array} \end{array} \]

FPCore

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = 0.125 * (beta / i);
	double t_3 = i + (alpha + beta);
	double t_4 = i * t_3;
	double t_5 = alpha + fma(i, 2.0, beta);
	double tmp;
	if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
		tmp = i * ((fma(i, t_3, (alpha * beta)) / fma(t_5, t_5, -1.0)) * (t_3 / (t_5 * t_5)));
	} else {
		tmp = (0.0625 + t_2) - t_2;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0

   1. Initial program 40.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} \]

   3. Simplified 99.4%

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

   if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

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

   3. Simplified 2.9%

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

   5. Taylor expanded in i around inf 80.3%

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

   6. Taylor expanded in alpha around 0 74.4%

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

      1. associate-*r/ 74.4%

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

   8. Simplified 74.4%

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

   9. Taylor expanded in i around inf 74.4%

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

   10. Taylor expanded in alpha around 0 75.3%

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

4. Final simplification 84.6%

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

Alternative 3: 82.5% accurate, 0.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^{+112}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 5.5 \cdot 10^{+130}:\\ \;\;\;\;i \cdot \frac{i + \alpha}{\beta \cdot \beta}\\ \mathbf{elif}\;\beta \leq 1.1 \cdot 10^{+179}:\\ \;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{1}{\frac{i}{\left(\alpha + \beta\right) \cdot 2}}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{i}{\beta}\right)}^{2}\\ \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+112)
   0.0625
   (if (<= beta 5.5e+130)
     (* i (/ (+ i alpha) (* beta beta)))
     (if (<= beta 1.1e+179)
       (-
        (+ 0.0625 (* 0.0625 (/ 1.0 (/ i (* (+ alpha beta) 2.0)))))
        (* 0.125 (/ (+ alpha beta) i)))
       (pow (/ i beta) 2.0)))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 7.5e+112) {
		tmp = 0.0625;
	} else if (beta <= 5.5e+130) {
		tmp = i * ((i + alpha) / (beta * beta));
	} else if (beta <= 1.1e+179) {
		tmp = (0.0625 + (0.0625 * (1.0 / (i / ((alpha + beta) * 2.0))))) - (0.125 * ((alpha + beta) / i));
	} else {
		tmp = pow((i / beta), 2.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+112) then
        tmp = 0.0625d0
    else if (beta <= 5.5d+130) then
        tmp = i * ((i + alpha) / (beta * beta))
    else if (beta <= 1.1d+179) then
        tmp = (0.0625d0 + (0.0625d0 * (1.0d0 / (i / ((alpha + beta) * 2.0d0))))) - (0.125d0 * ((alpha + beta) / i))
    else
        tmp = (i / beta) ** 2.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+112) {
		tmp = 0.0625;
	} else if (beta <= 5.5e+130) {
		tmp = i * ((i + alpha) / (beta * beta));
	} else if (beta <= 1.1e+179) {
		tmp = (0.0625 + (0.0625 * (1.0 / (i / ((alpha + beta) * 2.0))))) - (0.125 * ((alpha + beta) / i));
	} else {
		tmp = Math.pow((i / beta), 2.0);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 7.5e+112:
		tmp = 0.0625
	elif beta <= 5.5e+130:
		tmp = i * ((i + alpha) / (beta * beta))
	elif beta <= 1.1e+179:
		tmp = (0.0625 + (0.0625 * (1.0 / (i / ((alpha + beta) * 2.0))))) - (0.125 * ((alpha + beta) / i))
	else:
		tmp = math.pow((i / beta), 2.0)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 7.5e+112)
		tmp = 0.0625;
	elseif (beta <= 5.5e+130)
		tmp = Float64(i * Float64(Float64(i + alpha) / Float64(beta * beta)));
	elseif (beta <= 1.1e+179)
		tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(1.0 / Float64(i / Float64(Float64(alpha + beta) * 2.0))))) - Float64(0.125 * Float64(Float64(alpha + beta) / i)));
	else
		tmp = Float64(i / beta) ^ 2.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+112)
		tmp = 0.0625;
	elseif (beta <= 5.5e+130)
		tmp = i * ((i + alpha) / (beta * beta));
	elseif (beta <= 1.1e+179)
		tmp = (0.0625 + (0.0625 * (1.0 / (i / ((alpha + beta) * 2.0))))) - (0.125 * ((alpha + beta) / i));
	else
		tmp = (i / beta) ^ 2.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+112], 0.0625, If[LessEqual[beta, 5.5e+130], N[(i * N[(N[(i + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.1e+179], N[(N[(0.0625 + N[(0.0625 * N[(1.0 / N[(i / N[(N[(alpha + beta), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[N[(i / beta), $MachinePrecision], 2.0], $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if beta < 7.5e112

   1. Initial program 18.8%

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

   3. Simplified 45.1%

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

   5. Taylor expanded in i around inf 83.0%

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

   if 7.5e112 < beta < 5.4999999999999997e130

   1. Initial program 1.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} \]

   3. Simplified 56.7%

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

   5. Taylor expanded in beta around inf 57.8%

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

      1. unpow2 57.8%

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

   7. Applied egg-rr 57.8%

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

   if 5.4999999999999997e130 < beta < 1.1e179

   1. Initial program 0.6%

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

   3. Simplified 28.7%

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

   5. Taylor expanded in i around inf 57.8%

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

      1. clear-num 57.8%

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

      2. inv-pow 57.8%

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

      3. distribute-lft-out 57.8%

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

   7. Applied egg-rr 57.8%

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

      1. unpow-1 57.8%

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

   9. Simplified 57.8%

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

   if 1.1e179 < 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} \]

   3. Simplified 4.1%

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

   5. Taylor expanded in beta around inf 40.2%

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

      1. add-sqr-sqrt 40.2%

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

      2. pow2 40.2%

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

      3. associate-*r/ 38.5%

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

   7. Applied egg-rr 38.5%

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

   8. Taylor expanded in i around inf 87.6%

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

4. Final simplification 81.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 7.5 \cdot 10^{+112}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 5.5 \cdot 10^{+130}:\\ \;\;\;\;i \cdot \frac{i + \alpha}{\beta \cdot \beta}\\ \mathbf{elif}\;\beta \leq 1.1 \cdot 10^{+179}:\\ \;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{1}{\frac{i}{\left(\alpha + \beta\right) \cdot 2}}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{i}{\beta}\right)}^{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 82.5% accurate, 0.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^{+112}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 1.25 \cdot 10^{+130}:\\ \;\;\;\;i \cdot \left(\left(i + \alpha\right) \cdot {\beta}^{-2}\right)\\ \mathbf{elif}\;\beta \leq 1.55 \cdot 10^{+179}:\\ \;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{1}{\frac{i}{\left(\alpha + \beta\right) \cdot 2}}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{i}{\beta}\right)}^{2}\\ \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+112)
   0.0625
   (if (<= beta 1.25e+130)
     (* i (* (+ i alpha) (pow beta -2.0)))
     (if (<= beta 1.55e+179)
       (-
        (+ 0.0625 (* 0.0625 (/ 1.0 (/ i (* (+ alpha beta) 2.0)))))
        (* 0.125 (/ (+ alpha beta) i)))
       (pow (/ i beta) 2.0)))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 7.5e+112) {
		tmp = 0.0625;
	} else if (beta <= 1.25e+130) {
		tmp = i * ((i + alpha) * pow(beta, -2.0));
	} else if (beta <= 1.55e+179) {
		tmp = (0.0625 + (0.0625 * (1.0 / (i / ((alpha + beta) * 2.0))))) - (0.125 * ((alpha + beta) / i));
	} else {
		tmp = pow((i / beta), 2.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+112) then
        tmp = 0.0625d0
    else if (beta <= 1.25d+130) then
        tmp = i * ((i + alpha) * (beta ** (-2.0d0)))
    else if (beta <= 1.55d+179) then
        tmp = (0.0625d0 + (0.0625d0 * (1.0d0 / (i / ((alpha + beta) * 2.0d0))))) - (0.125d0 * ((alpha + beta) / i))
    else
        tmp = (i / beta) ** 2.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+112) {
		tmp = 0.0625;
	} else if (beta <= 1.25e+130) {
		tmp = i * ((i + alpha) * Math.pow(beta, -2.0));
	} else if (beta <= 1.55e+179) {
		tmp = (0.0625 + (0.0625 * (1.0 / (i / ((alpha + beta) * 2.0))))) - (0.125 * ((alpha + beta) / i));
	} else {
		tmp = Math.pow((i / beta), 2.0);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 7.5e+112:
		tmp = 0.0625
	elif beta <= 1.25e+130:
		tmp = i * ((i + alpha) * math.pow(beta, -2.0))
	elif beta <= 1.55e+179:
		tmp = (0.0625 + (0.0625 * (1.0 / (i / ((alpha + beta) * 2.0))))) - (0.125 * ((alpha + beta) / i))
	else:
		tmp = math.pow((i / beta), 2.0)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 7.5e+112)
		tmp = 0.0625;
	elseif (beta <= 1.25e+130)
		tmp = Float64(i * Float64(Float64(i + alpha) * (beta ^ -2.0)));
	elseif (beta <= 1.55e+179)
		tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(1.0 / Float64(i / Float64(Float64(alpha + beta) * 2.0))))) - Float64(0.125 * Float64(Float64(alpha + beta) / i)));
	else
		tmp = Float64(i / beta) ^ 2.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+112)
		tmp = 0.0625;
	elseif (beta <= 1.25e+130)
		tmp = i * ((i + alpha) * (beta ^ -2.0));
	elseif (beta <= 1.55e+179)
		tmp = (0.0625 + (0.0625 * (1.0 / (i / ((alpha + beta) * 2.0))))) - (0.125 * ((alpha + beta) / i));
	else
		tmp = (i / beta) ^ 2.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+112], 0.0625, If[LessEqual[beta, 1.25e+130], N[(i * N[(N[(i + alpha), $MachinePrecision] * N[Power[beta, -2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.55e+179], N[(N[(0.0625 + N[(0.0625 * N[(1.0 / N[(i / N[(N[(alpha + beta), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[N[(i / beta), $MachinePrecision], 2.0], $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if beta < 7.5e112

   1. Initial program 18.8%

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

   3. Simplified 45.1%

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

   5. Taylor expanded in i around inf 83.0%

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

   if 7.5e112 < beta < 1.2499999999999999e130

   1. Initial program 1.7%

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

   3. Simplified 66.1%

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

   5. Taylor expanded in beta around inf 66.9%

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

      1. div-inv 67.3%

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

      2. pow-flip 67.5%

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

      3. metadata-eval 67.5%

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

   7. Applied egg-rr 67.5%

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

   if 1.2499999999999999e130 < beta < 1.55e179

   1. Initial program 0.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} \]

   3. Simplified 26.3%

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

   5. Taylor expanded in i around inf 61.3%

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

      1. clear-num 61.3%

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

      2. inv-pow 61.3%

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

      3. distribute-lft-out 61.3%

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

   7. Applied egg-rr 61.3%

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

      1. unpow-1 61.3%

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

   9. Simplified 61.3%

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

   if 1.55e179 < 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} \]

   3. Simplified 4.1%

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

   5. Taylor expanded in beta around inf 40.2%

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

      1. add-sqr-sqrt 40.2%

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

      2. pow2 40.2%

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

      3. associate-*r/ 38.5%

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

   7. Applied egg-rr 38.5%

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

   8. Taylor expanded in i around inf 87.6%

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

4. Final simplification 82.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 7.5 \cdot 10^{+112}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 1.25 \cdot 10^{+130}:\\ \;\;\;\;i \cdot \left(\left(i + \alpha\right) \cdot {\beta}^{-2}\right)\\ \mathbf{elif}\;\beta \leq 1.55 \cdot 10^{+179}:\\ \;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{1}{\frac{i}{\left(\alpha + \beta\right) \cdot 2}}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{i}{\beta}\right)}^{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 80.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t\_0 \cdot t\_0\\ t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_3 := \frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1}\\ t_4 := 0.125 \cdot \frac{\beta}{i}\\ \mathbf{if}\;t\_3 \leq 0.1:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + t\_4\right) - t\_4\\ \end{array} \end{array} \]

FPCore

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = i * (i + (alpha + beta));
	double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double t_4 = 0.125 * (beta / i);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (0.0625 + t_4) - t_4;
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_0 = (alpha + beta) + (i * 2.0d0)
    t_1 = t_0 * t_0
    t_2 = i * (i + (alpha + beta))
    t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + (-1.0d0))
    t_4 = 0.125d0 * (beta / i)
    if (t_3 <= 0.1d0) then
        tmp = t_3
    else
        tmp = (0.0625d0 + t_4) - t_4
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = i * (i + (alpha + beta));
	double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double t_4 = 0.125 * (beta / i);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (0.0625 + t_4) - t_4;
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (i * 2.0)
	t_1 = t_0 * t_0
	t_2 = i * (i + (alpha + beta))
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)
	t_4 = 0.125 * (beta / i)
	tmp = 0
	if t_3 <= 0.1:
		tmp = t_3
	else:
		tmp = (0.0625 + t_4) - t_4
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(i * Float64(i + Float64(alpha + beta)))
	t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0))
	t_4 = Float64(0.125 * Float64(beta / i))
	tmp = 0.0
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = Float64(Float64(0.0625 + t_4) - t_4);
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (i * 2.0);
	t_1 = t_0 * t_0;
	t_2 = i * (i + (alpha + beta));
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	t_4 = 0.125 * (beta / i);
	tmp = 0.0;
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = (0.0625 + t_4) - t_4;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 0.10000000000000001

   1. Initial program 99.6%

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

   if 0.10000000000000001 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   1. Initial program 0.8%

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

   3. Simplified 29.9%

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

   5. Taylor expanded in i around inf 80.1%

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

   6. Taylor expanded in alpha around 0 75.8%

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

      1. associate-*r/ 75.8%

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

   8. Simplified 75.8%

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

   9. Taylor expanded in i around inf 75.8%

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

   10. Taylor expanded in alpha around 0 76.5%

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

4. Final simplification 80.0%

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

Alternative 6: 72.4% accurate, 2.2× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 8.6 \cdot 10^{+112}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 1.66 \cdot 10^{+149} \lor \neg \left(\beta \leq 8.5 \cdot 10^{+248}\right):\\ \;\;\;\;i \cdot \frac{i + \alpha}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;i \cdot \frac{0.0625}{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 8.6e+112)
   0.0625
   (if (or (<= beta 1.66e+149) (not (<= beta 8.5e+248)))
     (* i (/ (+ i alpha) (* beta beta)))
     (* i (/ 0.0625 i)))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 8.6e+112) {
		tmp = 0.0625;
	} else if ((beta <= 1.66e+149) || !(beta <= 8.5e+248)) {
		tmp = i * ((i + alpha) / (beta * beta));
	} else {
		tmp = i * (0.0625 / 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 <= 8.6d+112) then
        tmp = 0.0625d0
    else if ((beta <= 1.66d+149) .or. (.not. (beta <= 8.5d+248))) then
        tmp = i * ((i + alpha) / (beta * beta))
    else
        tmp = i * (0.0625d0 / 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 <= 8.6e+112) {
		tmp = 0.0625;
	} else if ((beta <= 1.66e+149) || !(beta <= 8.5e+248)) {
		tmp = i * ((i + alpha) / (beta * beta));
	} else {
		tmp = i * (0.0625 / i);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 8.6e+112:
		tmp = 0.0625
	elif (beta <= 1.66e+149) or not (beta <= 8.5e+248):
		tmp = i * ((i + alpha) / (beta * beta))
	else:
		tmp = i * (0.0625 / i)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 8.6e+112)
		tmp = 0.0625;
	elseif ((beta <= 1.66e+149) || !(beta <= 8.5e+248))
		tmp = Float64(i * Float64(Float64(i + alpha) / Float64(beta * beta)));
	else
		tmp = Float64(i * Float64(0.0625 / 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 <= 8.6e+112)
		tmp = 0.0625;
	elseif ((beta <= 1.66e+149) || ~((beta <= 8.5e+248)))
		tmp = i * ((i + alpha) / (beta * beta));
	else
		tmp = i * (0.0625 / 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, 8.6e+112], 0.0625, If[Or[LessEqual[beta, 1.66e+149], N[Not[LessEqual[beta, 8.5e+248]], $MachinePrecision]], N[(i * N[(N[(i + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(i * N[(0.0625 / i), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if beta < 8.59999999999999966e112

   1. Initial program 18.8%

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

   3. Simplified 45.1%

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

   5. Taylor expanded in i around inf 83.0%

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

   if 8.59999999999999966e112 < beta < 1.6600000000000001e149 or 8.50000000000000032e248 < beta

   1. Initial program 0.6%

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

   3. Simplified 24.7%

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

   5. Taylor expanded in beta around inf 60.3%

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

      1. unpow2 60.3%

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

   7. Applied egg-rr 60.3%

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

   if 1.6600000000000001e149 < beta < 8.50000000000000032e248

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

   3. Simplified 7.6%

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

   5. Taylor expanded in i around inf 36.5%

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

4. Final simplification 77.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 8.6 \cdot 10^{+112}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 1.66 \cdot 10^{+149} \lor \neg \left(\beta \leq 8.5 \cdot 10^{+248}\right):\\ \;\;\;\;i \cdot \frac{i + \alpha}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;i \cdot \frac{0.0625}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 76.1% accurate, 2.3× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := 0.125 \cdot \frac{\beta}{i}\\ \mathbf{if}\;\beta \leq 10^{+113}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 2.4 \cdot 10^{+128}:\\ \;\;\;\;i \cdot \frac{i + \alpha}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + t\_0\right) - t\_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
 (let* ((t_0 (* 0.125 (/ beta i))))
   (if (<= beta 1e+113)
     0.0625
     (if (<= beta 2.4e+128)
       (* i (/ (+ i alpha) (* beta beta)))
       (- (+ 0.0625 t_0) t_0)))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = 0.125 * (beta / i);
	double tmp;
	if (beta <= 1e+113) {
		tmp = 0.0625;
	} else if (beta <= 2.4e+128) {
		tmp = i * ((i + alpha) / (beta * beta));
	} else {
		tmp = (0.0625 + t_0) - t_0;
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = 0.125 * (beta / i);
	double tmp;
	if (beta <= 1e+113) {
		tmp = 0.0625;
	} else if (beta <= 2.4e+128) {
		tmp = i * ((i + alpha) / (beta * beta));
	} else {
		tmp = (0.0625 + t_0) - t_0;
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = 0.125 * (beta / i)
	tmp = 0
	if beta <= 1e+113:
		tmp = 0.0625
	elif beta <= 2.4e+128:
		tmp = i * ((i + alpha) / (beta * beta))
	else:
		tmp = (0.0625 + t_0) - t_0
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(0.125 * Float64(beta / i))
	tmp = 0.0
	if (beta <= 1e+113)
		tmp = 0.0625;
	elseif (beta <= 2.4e+128)
		tmp = Float64(i * Float64(Float64(i + alpha) / Float64(beta * beta)));
	else
		tmp = Float64(Float64(0.0625 + t_0) - t_0);
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = 0.125 * (beta / i);
	tmp = 0.0;
	if (beta <= 1e+113)
		tmp = 0.0625;
	elseif (beta <= 2.4e+128)
		tmp = i * ((i + alpha) / (beta * beta));
	else
		tmp = (0.0625 + t_0) - t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if beta < 1e113

   1. Initial program 18.8%

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

   3. Simplified 45.1%

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

   5. Taylor expanded in i around inf 83.0%

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

   if 1e113 < beta < 2.4000000000000002e128

   1. Initial program 1.7%

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

   3. Simplified 66.1%

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

   5. Taylor expanded in beta around inf 66.9%

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

      1. unpow2 66.9%

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

   7. Applied egg-rr 66.9%

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

   if 2.4000000000000002e128 < beta

   1. Initial program 0.2%

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

   3. Simplified 10.8%

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

   5. Taylor expanded in i around inf 49.2%

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

   6. Taylor expanded in alpha around 0 49.2%

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

      1. associate-*r/ 49.2%

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

   8. Simplified 49.2%

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

   9. Taylor expanded in i around inf 49.2%

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

   10. Taylor expanded in alpha around 0 49.2%

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

4. Final simplification 77.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 10^{+113}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 2.4 \cdot 10^{+128}:\\ \;\;\;\;i \cdot \frac{i + \alpha}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 70.6% accurate, 53.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 15.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} \]

3. Simplified 40.2%

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

5. Taylor expanded in i around inf 72.6%

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

6. Final simplification 72.6%

   \[\leadsto 0.0625 \]
7. Add Preprocessing

Reproduce

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