Octave 3.8, jcobi/4

Percentage Accurate: 16.9% → 83.7%

Time: 22.8s

Alternatives: 9

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.9% 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.7% 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)\\ \mathbf{if}\;\frac{\frac{t\_3 \cdot \left(t\_3 + \alpha \cdot \beta\right)}{t\_1}}{t\_2} \leq \infty:\\ \;\;\;\;\frac{t\_4 \cdot \frac{\mathsf{fma}\left(\alpha, \beta, t\_4\right)}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\right)}^{2}}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \beta \cdot 0.125}{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)))))
   (if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
     (/
      (* t_4 (/ (fma alpha beta t_4) (pow (fma i 2.0 (+ alpha beta)) 2.0)))
      t_2)
     (/ (- (+ (* i 0.0625) (* beta 0.125)) (* beta 0.125)) 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 tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = (t_4 * (fma(alpha, beta, t_4) / pow(fma(i, 2.0, (alpha + beta)), 2.0))) / t_2;
	} else {
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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)))
	tmp = 0.0
	if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64(t_4 * Float64(fma(alpha, beta, t_4) / (fma(i, 2.0, Float64(alpha + beta)) ^ 2.0))) / t_2);
	else
		tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(beta * 0.125)) / 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]}, 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[(t$95$4 * N[(N[(alpha * beta + t$95$4), $MachinePrecision] / N[Power[N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] - N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] / i), $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 46.4%

      \[\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. associate-/l* 99.7%

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

      2. +-commutative 99.7%

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

      3. associate-+r+ 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. +-commutative 99.7%

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

      7. fma-undefine 99.7%

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

      8. pow2 99.7%

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

      9. *-commutative 99.7%

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

      10. pow2 99.7%

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

      11. associate-+r+ 99.7%

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

      12. +-commutative 99.7%

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

      13. pow2 99.7%

          \[\leadsto \frac{\left(i \cdot \left(\beta + \left(i + \alpha\right)\right)\right) \cdot \frac{\mathsf{fma}\left(\alpha, \beta, i \cdot \left(\beta + \left(i + \alpha\right)\right)\right)}{\color{blue}{{\left(\left(\alpha + \beta\right) + i \cdot 2\right)}^{2}}}}{\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.7%

      \[\leadsto \frac{\color{blue}{\left(i \cdot \left(\beta + \left(i + \alpha\right)\right)\right) \cdot \frac{\mathsf{fma}\left(\alpha, \beta, i \cdot \left(\beta + \left(i + \alpha\right)\right)\right)}{{\left(\mathsf{fma}\left(i, 2, \alpha + \beta\right)\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 4.1%

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

   5. Taylor expanded in i around inf 77.9%

      \[\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 i around 0 77.9%

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

   7. Taylor expanded in alpha around 0 71.5%

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

      1. *-commutative 71.5%

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

   9. Simplified 71.5%

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

   10. Taylor expanded in alpha around 0 72.1%

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

4. Final simplification 81.7%

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

Alternative 2: 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 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_3 := {\left(\beta + i \cdot 2\right)}^{2}\\ \mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\ \;\;\;\;i \cdot \left(\frac{i}{t\_3} \cdot \frac{{\left(i + \beta\right)}^{2}}{t\_3 + -1}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \beta \cdot 0.125}{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 (pow (+ beta (* i 2.0)) 2.0)))
   (if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
     (* i (* (/ i t_3) (/ (pow (+ i beta) 2.0) (+ t_3 -1.0))))
     (/ (- (+ (* i 0.0625) (* beta 0.125)) (* beta 0.125)) 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 = pow((beta + (i * 2.0)), 2.0);
	double tmp;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
		tmp = i * ((i / t_3) * (pow((i + beta), 2.0) / (t_3 + -1.0)));
	} else {
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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 = i * (i + (alpha + beta));
	double t_3 = Math.pow((beta + (i * 2.0)), 2.0);
	double tmp;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Double.POSITIVE_INFINITY) {
		tmp = i * ((i / t_3) * (Math.pow((i + beta), 2.0) / (t_3 + -1.0)));
	} else {
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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 = i * (i + (alpha + beta))
	t_3 = math.pow((beta + (i * 2.0)), 2.0)
	tmp = 0
	if (((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= math.inf:
		tmp = i * ((i / t_3) * (math.pow((i + beta), 2.0) / (t_3 + -1.0)))
	else:
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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 * 2.0)) ^ 2.0
	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(i * Float64(Float64(i / t_3) * Float64((Float64(i + beta) ^ 2.0) / Float64(t_3 + -1.0))));
	else
		tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(beta * 0.125)) / 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 = i * (i + (alpha + beta));
	t_3 = (beta + (i * 2.0)) ^ 2.0;
	tmp = 0.0;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Inf)
		tmp = i * ((i / t_3) * (((i + beta) ^ 2.0) / (t_3 + -1.0)));
	else
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $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[(i * N[(N[(i / t$95$3), $MachinePrecision] * N[(N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision] / N[(t$95$3 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] - N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] / i), $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 46.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in alpha around 0 40.5%

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

      1. times-frac 89.6%

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

      2. sub-neg 89.6%

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

      3. metadata-eval 89.6%

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

   7. Simplified 89.6%

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

   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 4.1%

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

   5. Taylor expanded in i around inf 77.9%

      \[\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 i around 0 77.9%

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

   7. Taylor expanded in alpha around 0 71.5%

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

      1. *-commutative 71.5%

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

   9. Simplified 71.5%

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

   10. Taylor expanded in alpha around 0 72.1%

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

4. Final simplification 78.2%

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

Alternative 3: 83.2% accurate, 0.2× 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 := {\left(\beta + i \cdot 2\right)}^{2}\\ \mathbf{if}\;\frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1} \leq \infty:\\ \;\;\;\;i \cdot \left(\frac{i \cdot \left(i + \beta\right)}{t\_3 + -1} \cdot \frac{i + \beta}{t\_3}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \beta \cdot 0.125}{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 (pow (+ beta (* i 2.0)) 2.0)))
   (if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
     (* i (* (/ (* i (+ i beta)) (+ t_3 -1.0)) (/ (+ i beta) t_3)))
     (/ (- (+ (* i 0.0625) (* beta 0.125)) (* beta 0.125)) 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 = pow((beta + (i * 2.0)), 2.0);
	double tmp;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
		tmp = i * (((i * (i + beta)) / (t_3 + -1.0)) * ((i + beta) / t_3));
	} else {
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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 = i * (i + (alpha + beta));
	double t_3 = Math.pow((beta + (i * 2.0)), 2.0);
	double tmp;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Double.POSITIVE_INFINITY) {
		tmp = i * (((i * (i + beta)) / (t_3 + -1.0)) * ((i + beta) / t_3));
	} else {
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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 = i * (i + (alpha + beta))
	t_3 = math.pow((beta + (i * 2.0)), 2.0)
	tmp = 0
	if (((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= math.inf:
		tmp = i * (((i * (i + beta)) / (t_3 + -1.0)) * ((i + beta) / t_3))
	else:
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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 * 2.0)) ^ 2.0
	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(i * Float64(Float64(Float64(i * Float64(i + beta)) / Float64(t_3 + -1.0)) * Float64(Float64(i + beta) / t_3)));
	else
		tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(beta * 0.125)) / 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 = i * (i + (alpha + beta));
	t_3 = (beta + (i * 2.0)) ^ 2.0;
	tmp = 0.0;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Inf)
		tmp = i * (((i * (i + beta)) / (t_3 + -1.0)) * ((i + beta) / t_3));
	else
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $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[(i * N[(N[(N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision] / N[(t$95$3 + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] - N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] / i), $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 46.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in alpha around 0 89.7%

      \[\leadsto i \cdot \left(\color{blue}{\frac{i \cdot \left(\beta + i\right)}{{\left(\beta + 2 \cdot i\right)}^{2} - 1}} \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 alpha around 0 89.5%

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

   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 4.1%

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

   5. Taylor expanded in i around inf 77.9%

      \[\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 i around 0 77.9%

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

   7. Taylor expanded in alpha around 0 71.5%

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

      1. *-commutative 71.5%

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

   9. Simplified 71.5%

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

   10. Taylor expanded in alpha around 0 72.1%

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

4. Final simplification 78.1%

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

Alternative 4: 80.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t\_0 \cdot t\_0\\ t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_3 := \frac{\frac{t\_2 \cdot \left(t\_2 + \alpha \cdot \beta\right)}{t\_1}}{t\_1 + -1}\\ \mathbf{if}\;t\_3 \leq 0.1:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \beta \cdot 0.125}{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 (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0))))
   (if (<= t_3 0.1)
     t_3
     (/ (- (+ (* i 0.0625) (* beta 0.125)) (* beta 0.125)) 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 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / i;
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = i * (i + (alpha + beta));
	double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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 = i * (i + (alpha + beta))
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)
	tmp = 0
	if t_3 <= 0.1:
		tmp = t_3
	else:
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0))
	tmp = 0.0
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(beta * 0.125)) / 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 = i * (i + (alpha + beta));
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	tmp = 0.0;
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / 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[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(N[(N[(i * 0.0625), $MachinePrecision] + N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] - N[(beta * 0.125), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.6%

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

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

   1. Initial program 0.7%

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

   3. Simplified 25.8%

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

   5. Taylor expanded in i around inf 79.3%

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

   6. Taylor expanded in i around 0 79.3%

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

   7. Taylor expanded in alpha around 0 74.0%

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

      1. *-commutative 74.0%

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

   9. Simplified 74.0%

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

   10. Taylor expanded in alpha around 0 74.8%

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

4. Final simplification 78.7%

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

Alternative 5: 82.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3e+191) {
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / i;
	} else {
		tmp = pow((i / beta), 2.0);
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3e+191) {
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / i;
	} else {
		tmp = Math.pow((i / beta), 2.0);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 3e+191:
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / i
	else:
		tmp = math.pow((i / beta), 2.0)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 3e+191)
		tmp = Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(beta * 0.125)) / i);
	else
		tmp = Float64(i / beta) ^ 2.0;
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 3e+191)
		tmp = (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / i;
	else
		tmp = (i / beta) ^ 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.9999999999999997e191

   1. Initial program 18.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 41.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 82.7%

      \[\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 i around 0 82.7%

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

   7. Taylor expanded in alpha around 0 77.6%

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

      1. *-commutative 77.6%

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

   9. Simplified 77.6%

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

   10. Taylor expanded in alpha around 0 78.5%

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

   if 2.9999999999999997e191 < 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 2.0%

      \[\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 alpha around 0 5.6%

      \[\leadsto i \cdot \left(\color{blue}{\frac{i \cdot \left(\beta + i\right)}{{\left(\beta + 2 \cdot i\right)}^{2} - 1}} \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 26.0%

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

   7. Taylor expanded in i around 0 23.9%

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

      1. unpow2 23.9%

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

      2. unpow2 23.9%

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

      3. times-frac 64.2%

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

      4. unpow1 64.2%

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

      5. pow-plus 64.2%

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

      6. metadata-eval 64.2%

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

   9. Simplified 64.2%

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

4. Final simplification 76.9%

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

Alternative 6: 76.9% accurate, 4.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \beta \cdot 0.125}{i} \end{array} \]

FPCore

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / i;
}

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 = (((i * 0.0625d0) + (beta * 0.125d0)) - (beta * 0.125d0)) / i
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / i;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return (((i * 0.0625) + (beta * 0.125)) - (beta * 0.125)) / i

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return Float64(Float64(Float64(Float64(i * 0.0625) + Float64(beta * 0.125)) - Float64(beta * 0.125)) / i)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 16.1%

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

3. Simplified 37.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 79.3%

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

6. Taylor expanded in i around 0 79.3%

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

7. Taylor expanded in alpha around 0 74.7%

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

   1. *-commutative 74.7%

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

9. Simplified 74.7%

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

10. Taylor expanded in alpha around 0 75.5%

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

11. Final simplification 75.5%

    \[\leadsto \frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \beta \cdot 0.125}{i} \]
12. Add Preprocessing

Alternative 7: 73.5% accurate, 4.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.4999999999999999e252

   1. Initial program 16.9%

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

   3. Simplified 38.9%

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

   5. Taylor expanded in i around inf 75.9%

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

   if 3.4999999999999999e252 < 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 0.0%

      \[\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 alpha around 0 0.0%

      \[\leadsto i \cdot \left(\color{blue}{\frac{i \cdot \left(\beta + i\right)}{{\left(\beta + 2 \cdot i\right)}^{2} - 1}} \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 48.2%

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

      1. unpow2 48.2%

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

   8. Applied egg-rr 48.2%

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

Alternative 8: 70.3% accurate, 5.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.05e261

   1. Initial program 16.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.8%

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

   5. Taylor expanded in i around inf 75.6%

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

   if 1.05e261 < 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 0.0%

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

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

   6. Taylor expanded in i around 0 62.1%

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

   7. Taylor expanded in alpha around 0 62.1%

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

      1. *-commutative 62.1%

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

   9. Simplified 62.1%

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

   10. Taylor expanded in alpha around inf 41.8%

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

       1. *-commutative 41.8%

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

   12. Simplified 41.8%

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

Alternative 9: 70.4% accurate, 53.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 16.1%

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

3. Simplified 37.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.1%

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

Reproduce

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