Octave 3.8, jcobi/4

Percentage Accurate: 16.6% → 83.8%

Time: 18.8s

Alternatives: 12

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.8% 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 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_3 := \beta + \left(i + \alpha\right)\\ t_4 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\ \mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\ \;\;\;\;\frac{i \cdot t\_3}{\mathsf{fma}\left(t\_4, t\_4, -1\right)} \cdot \frac{\frac{\mathsf{fma}\left(i, t\_3, \alpha \cdot \beta\right)}{t\_4}}{t\_4}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + \frac{\beta \cdot 0.125}{i}\right) - 0.125 \cdot \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
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (* i (+ i (+ alpha beta))))
        (t_3 (+ beta (+ i alpha)))
        (t_4 (fma i 2.0 (+ alpha beta))))
   (if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
     (*
      (/ (* i t_3) (fma t_4 t_4 -1.0))
      (/ (/ (fma i t_3 (* alpha beta)) t_4) t_4))
     (- (+ 0.0625 (/ (* beta 0.125) i)) (* 0.125 (/ beta i))))))

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 = beta + (i + alpha);
	double t_4 = fma(i, 2.0, (alpha + beta));
	double tmp;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
		tmp = ((i * t_3) / fma(t_4, t_4, -1.0)) * ((fma(i, t_3, (alpha * beta)) / t_4) / t_4);
	} else {
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (beta / i));
	}
	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(beta + Float64(i + alpha))
	t_4 = fma(i, 2.0, Float64(alpha + beta))
	tmp = 0.0
	if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf)
		tmp = Float64(Float64(Float64(i * t_3) / fma(t_4, t_4, -1.0)) * Float64(Float64(fma(i, t_3, Float64(alpha * beta)) / t_4) / t_4));
	else
		tmp = Float64(Float64(0.0625 + Float64(Float64(beta * 0.125) / i)) - Float64(0.125 * Float64(beta / i)));
	end
	return tmp
end

Wolfram

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

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

      1. associate-/l/ 50.4%

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

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

      \[\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 inf 69.1%

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

   7. Taylor expanded in alpha around 0 68.0%

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

      1. associate-*r/ 68.0%

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

      2. *-commutative 68.0%

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

   9. Simplified 68.0%

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

   10. Taylor expanded in alpha around 0 69.7%

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

4. Final simplification 80.4%

   \[\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 + \frac{\beta \cdot 0.125}{i}\right) - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 83.8% 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 := t\_1 + -1\\ t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_4 := i \cdot \left(\beta + \left(i + \alpha\right)\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\_2} \leq \infty:\\ \;\;\;\;\frac{\frac{t\_4}{t\_5} \cdot \frac{\mathsf{fma}\left(\alpha, \beta, t\_4\right)}{t\_5}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + \frac{\beta \cdot 0.125}{i}\right) - 0.125 \cdot \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
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (+ t_1 -1.0))
        (t_3 (* i (+ i (+ alpha beta))))
        (t_4 (* i (+ beta (+ i alpha))))
        (t_5 (fma i 2.0 (+ alpha beta))))
   (if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
     (/ (* (/ t_4 t_5) (/ (fma alpha beta t_4) t_5)) t_2)
     (- (+ 0.0625 (/ (* beta 0.125) i)) (* 0.125 (/ beta i))))))

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 = t_1 + -1.0;
	double t_3 = i * (i + (alpha + beta));
	double t_4 = i * (beta + (i + alpha));
	double t_5 = fma(i, 2.0, (alpha + beta));
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = ((t_4 / t_5) * (fma(alpha, beta, t_4) / t_5)) / t_2;
	} else {
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (beta / i));
	}
	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(t_1 + -1.0)
	t_3 = Float64(i * Float64(i + Float64(alpha + beta)))
	t_4 = Float64(i * 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) / t_2) <= Inf)
		tmp = Float64(Float64(Float64(t_4 / t_5) * Float64(fma(alpha, beta, t_4) / t_5)) / t_2);
	else
		tmp = Float64(Float64(0.0625 + Float64(Float64(beta * 0.125) / i)) - Float64(0.125 * Float64(beta / i)));
	end
	return tmp
end

Wolfram

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

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

      1. times-frac 99.5%

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

      2. +-commutative 99.5%

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

      3. associate-+r+ 99.5%

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

      4. +-commutative 99.5%

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

      5. +-commutative 99.5%

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

      6. *-commutative 99.5%

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

      7. fma-undefine 99.5%

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

      8. *-commutative 99.5%

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

      9. +-commutative 99.5%

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

      10. fma-undefine 99.5%

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

      11. associate-+r+ 99.5%

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

      12. +-commutative 99.5%

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

      13. +-commutative 99.5%

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

      14. *-commutative 99.5%

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

      15. fma-undefine 99.5%

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

   4. Applied egg-rr 99.5%

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

   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 5.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 74.5%

      \[\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 inf 69.1%

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

   7. Taylor expanded in alpha around 0 68.0%

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

      1. associate-*r/ 68.0%

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

      2. *-commutative 68.0%

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

   9. Simplified 68.0%

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

   10. Taylor expanded in alpha around 0 69.7%

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

4. Final simplification 80.3%

   \[\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{\frac{i \cdot \left(\beta + \left(i + \alpha\right)\right)}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)} \cdot \frac{\mathsf{fma}\left(\alpha, \beta, i \cdot \left(\beta + \left(i + \alpha\right)\right)\right)}{\mathsf{fma}\left(i, 2, \alpha + \beta\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 + \frac{\beta \cdot 0.125}{i}\right) - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 83.2% 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 := t\_1 + -1\\ t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ \mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\ \;\;\;\;\frac{{i}^{2} \cdot \frac{{\left(i + \beta\right)}^{2}}{{i}^{2} \cdot 4 + \beta \cdot \left(\beta + i \cdot 4\right)}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + \frac{\beta \cdot 0.125}{i}\right) - 0.125 \cdot \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
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (+ t_1 -1.0))
        (t_3 (* i (+ i (+ alpha beta)))))
   (if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
     (/
      (*
       (pow i 2.0)
       (/
        (pow (+ i beta) 2.0)
        (+ (* (pow i 2.0) 4.0) (* beta (+ beta (* i 4.0))))))
      t_2)
     (- (+ 0.0625 (/ (* beta 0.125) i)) (* 0.125 (/ beta i))))))

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 = t_1 + -1.0;
	double t_3 = i * (i + (alpha + beta));
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = (pow(i, 2.0) * (pow((i + beta), 2.0) / ((pow(i, 2.0) * 4.0) + (beta * (beta + (i * 4.0)))))) / t_2;
	} else {
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (beta / i));
	}
	return tmp;
}

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 = t_1 + -1.0;
	double t_3 = i * (i + (alpha + beta));
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
		tmp = (Math.pow(i, 2.0) * (Math.pow((i + beta), 2.0) / ((Math.pow(i, 2.0) * 4.0) + (beta * (beta + (i * 4.0)))))) / t_2;
	} else {
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (beta / i));
	}
	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 = t_1 + -1.0
	t_3 = i * (i + (alpha + beta))
	tmp = 0
	if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= math.inf:
		tmp = (math.pow(i, 2.0) * (math.pow((i + beta), 2.0) / ((math.pow(i, 2.0) * 4.0) + (beta * (beta + (i * 4.0)))))) / t_2
	else:
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (beta / i))
	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(t_1 + -1.0)
	t_3 = Float64(i * Float64(i + Float64(alpha + beta)))
	tmp = 0.0
	if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64((i ^ 2.0) * Float64((Float64(i + beta) ^ 2.0) / Float64(Float64((i ^ 2.0) * 4.0) + Float64(beta * Float64(beta + Float64(i * 4.0)))))) / t_2);
	else
		tmp = Float64(Float64(0.0625 + Float64(Float64(beta * 0.125) / i)) - Float64(0.125 * Float64(beta / i)));
	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 = t_1 + -1.0;
	t_3 = i * (i + (alpha + beta));
	tmp = 0.0;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = ((i ^ 2.0) * (((i + beta) ^ 2.0) / (((i ^ 2.0) * 4.0) + (beta * (beta + (i * 4.0)))))) / t_2;
	else
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (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_] := 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[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[Power[i, 2.0], $MachinePrecision] * N[(N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision] / N[(N[(N[Power[i, 2.0], $MachinePrecision] * 4.0), $MachinePrecision] + N[(beta * N[(beta + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(N[(beta * 0.125), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $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 52.9%

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

   3. Taylor expanded in alpha around 0 48.5%

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

      1. associate-/l* 91.5%

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

   5. Simplified 91.5%

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

   6. Taylor expanded in beta around 0 91.6%

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

   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 5.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 74.5%

      \[\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 inf 69.1%

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

   7. Taylor expanded in alpha around 0 68.0%

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

      1. associate-*r/ 68.0%

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

      2. *-commutative 68.0%

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

   9. Simplified 68.0%

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

   10. Taylor expanded in alpha around 0 69.7%

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

4. Final simplification 77.5%

   \[\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}^{2} \cdot \frac{{\left(i + \beta\right)}^{2}}{{i}^{2} \cdot 4 + \beta \cdot \left(\beta + i \cdot 4\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 + \frac{\beta \cdot 0.125}{i}\right) - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 83.2% 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 := t\_1 + -1\\ t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ \mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\ \;\;\;\;\frac{{i}^{2} \cdot \frac{{\left(i + \beta\right)}^{2}}{{\left(\beta + i \cdot 2\right)}^{2}}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + \frac{\beta \cdot 0.125}{i}\right) - 0.125 \cdot \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
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (+ t_1 -1.0))
        (t_3 (* i (+ i (+ alpha beta)))))
   (if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
     (/
      (* (pow i 2.0) (/ (pow (+ i beta) 2.0) (pow (+ beta (* i 2.0)) 2.0)))
      t_2)
     (- (+ 0.0625 (/ (* beta 0.125) i)) (* 0.125 (/ beta i))))))

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 = t_1 + -1.0;
	double t_3 = i * (i + (alpha + beta));
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = (pow(i, 2.0) * (pow((i + beta), 2.0) / pow((beta + (i * 2.0)), 2.0))) / t_2;
	} else {
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (beta / i));
	}
	return tmp;
}

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 = t_1 + -1.0;
	double t_3 = i * (i + (alpha + beta));
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
		tmp = (Math.pow(i, 2.0) * (Math.pow((i + beta), 2.0) / Math.pow((beta + (i * 2.0)), 2.0))) / t_2;
	} else {
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (beta / i));
	}
	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 = t_1 + -1.0
	t_3 = i * (i + (alpha + beta))
	tmp = 0
	if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= math.inf:
		tmp = (math.pow(i, 2.0) * (math.pow((i + beta), 2.0) / math.pow((beta + (i * 2.0)), 2.0))) / t_2
	else:
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (beta / i))
	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(t_1 + -1.0)
	t_3 = Float64(i * Float64(i + Float64(alpha + beta)))
	tmp = 0.0
	if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64((i ^ 2.0) * Float64((Float64(i + beta) ^ 2.0) / (Float64(beta + Float64(i * 2.0)) ^ 2.0))) / t_2);
	else
		tmp = Float64(Float64(0.0625 + Float64(Float64(beta * 0.125) / i)) - Float64(0.125 * Float64(beta / i)));
	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 = t_1 + -1.0;
	t_3 = i * (i + (alpha + beta));
	tmp = 0.0;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = ((i ^ 2.0) * (((i + beta) ^ 2.0) / ((beta + (i * 2.0)) ^ 2.0))) / t_2;
	else
		tmp = (0.0625 + ((beta * 0.125) / i)) - (0.125 * (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_] := 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[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[Power[i, 2.0], $MachinePrecision] * N[(N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision] / N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(N[(beta * 0.125), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $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 52.9%

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

   3. Taylor expanded in alpha around 0 48.5%

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

      1. associate-/l* 91.5%

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

   5. Simplified 91.5%

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

   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 5.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 74.5%

      \[\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 inf 69.1%

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

   7. Taylor expanded in alpha around 0 68.0%

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

      1. associate-*r/ 68.0%

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

      2. *-commutative 68.0%

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

   9. Simplified 68.0%

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

   10. Taylor expanded in alpha around 0 69.7%

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

4. Final simplification 77.5%

   \[\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}^{2} \cdot \frac{{\left(i + \beta\right)}^{2}}{{\left(\beta + i \cdot 2\right)}^{2}}}{\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 + \frac{\beta \cdot 0.125}{i}\right) - 0.125 \cdot \frac{\beta}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 77.9% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 8.5000000000000002e155

   1. Initial program 22.1%

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

   3. Simplified 43.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

   5. Taylor expanded in i around inf 78.9%

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

   if 8.5000000000000002e155 < 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 11.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 beta around inf 32.6%

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

   6. Taylor expanded in i around 0 60.3%

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

   7. Taylor expanded in beta around inf 59.8%

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

      1. mul-1-neg 59.8%

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

      2. unsub-neg 59.8%

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

   9. Simplified 59.8%

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

4. Final simplification 76.1%

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

Alternative 6: 77.9% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 7.7999999999999996e155

   1. Initial program 22.1%

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

   3. Simplified 43.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

   5. Taylor expanded in i around inf 78.9%

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

   if 7.7999999999999996e155 < 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 11.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 beta around inf 32.6%

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

   6. Taylor expanded in i around 0 60.3%

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

4. Final simplification 76.2%

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

Alternative 7: 77.9% accurate, 3.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.05999999999999993e156

   1. Initial program 22.1%

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

   3. Simplified 43.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

   5. Taylor expanded in i around inf 78.9%

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

   if 1.05999999999999993e156 < 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 11.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 beta around inf 32.6%

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

   6. Taylor expanded in beta around inf 60.2%

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

4. Final simplification 76.2%

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

Alternative 8: 76.7% accurate, 3.8× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 5.2000000000000004e155

   1. Initial program 22.1%

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

   3. Simplified 43.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

   5. Taylor expanded in i around inf 78.9%

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

   if 5.2000000000000004e155 < 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 11.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 beta around inf 32.6%

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

   6. Taylor expanded in i around 0 60.3%

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

   7. Taylor expanded in i around inf 32.6%

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

      1. associate-/r* 59.3%

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

   9. Simplified 59.3%

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

Alternative 9: 73.6% accurate, 3.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.59999999999999981e261

   1. Initial program 19.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 40.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 73.6%

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

   if 2.59999999999999981e261 < 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 7.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 65.0%

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

   6. Taylor expanded in i around 0 71.0%

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

   7. Taylor expanded in i around 0 65.0%

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

      1. associate-/r* 65.0%

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

   9. Simplified 65.0%

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

Alternative 10: 73.6% accurate, 3.8× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.7999999999999999e255

   1. Initial program 19.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 40.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 73.6%

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

   if 3.7999999999999999e255 < 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 7.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 65.0%

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

   6. Taylor expanded in i around 0 71.0%

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

   7. Taylor expanded in i around 0 64.4%

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

      1. associate-/l* 65.0%

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

      2. associate-/r* 65.1%

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

   9. Simplified 65.1%

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

Alternative 11: 73.6% accurate, 3.8× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.2999999999999999e256

   1. Initial program 19.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 40.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 73.6%

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

   if 3.2999999999999999e256 < 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 15.4%

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

      1. cancel-sign-sub-inv 15.4%

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

      2. distribute-lft-out 15.4%

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

      3. metadata-eval 15.4%

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

   5. Simplified 15.4%

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

   6. Taylor expanded in beta around inf 4.4%

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

   7. Taylor expanded in alpha around inf 64.7%

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

      1. associate-/l* 64.9%

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

      2. distribute-rgt-out-- 64.9%

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

      3. metadata-eval 64.9%

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

      4. *-commutative 64.9%

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

   9. Simplified 64.9%

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

4. Final simplification 73.1%

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

Alternative 12: 70.7% 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 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 38.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 70.1%

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

Reproduce

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