Octave 3.8, jcobi/4

Percentage Accurate: 15.4% → 81.8%

Time: 11.4s

Alternatives: 15

Speedup: 115.0×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 15.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 81.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\ t_1 := \left(\beta + \alpha\right) + i\\ t_2 := \mathsf{fma}\left(2, i, \beta + \alpha\right)\\ t_3 := t\_2 - 1\\ t_4 := \left(i + \beta\right) + \alpha\\ \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+32}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 6.2 \cdot 10^{+139}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(t\_4, i, \alpha \cdot \beta\right)}{t\_0}}{\frac{\mathsf{fma}\left(2, i, \left(\alpha + \beta\right) - 1\right)}{\frac{i}{t\_0} \cdot t\_4} \cdot \mathsf{fma}\left(2, i, \left(\alpha + \beta\right) + 1\right)}\\ \mathbf{elif}\;\beta \leq 1.05 \cdot 10^{+183}:\\ \;\;\;\;0.25 \cdot \frac{t\_1 \cdot \frac{i}{\mathsf{fma}\left(2, i, \beta\right)}}{t\_3}\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{t\_2 + 1} \cdot \frac{t\_1 \cdot \frac{i}{t\_2}}{t\_3}\\ \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 (fma 2.0 i (+ alpha beta)))
        (t_1 (+ (+ beta alpha) i))
        (t_2 (fma 2.0 i (+ beta alpha)))
        (t_3 (- t_2 1.0))
        (t_4 (+ (+ i beta) alpha)))
   (if (<= beta 2.8e+32)
     0.0625
     (if (<= beta 6.2e+139)
       (/
        (/ (fma t_4 i (* alpha beta)) t_0)
        (*
         (/ (fma 2.0 i (- (+ alpha beta) 1.0)) (* (/ i t_0) t_4))
         (fma 2.0 i (+ (+ alpha beta) 1.0))))
       (if (<= beta 1.05e+183)
         (* 0.25 (/ (* t_1 (/ i (fma 2.0 i beta))) t_3))
         (* (/ (+ alpha i) (+ t_2 1.0)) (/ (* t_1 (/ i t_2)) t_3)))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = fma(2.0, i, (alpha + beta));
	double t_1 = (beta + alpha) + i;
	double t_2 = fma(2.0, i, (beta + alpha));
	double t_3 = t_2 - 1.0;
	double t_4 = (i + beta) + alpha;
	double tmp;
	if (beta <= 2.8e+32) {
		tmp = 0.0625;
	} else if (beta <= 6.2e+139) {
		tmp = (fma(t_4, i, (alpha * beta)) / t_0) / ((fma(2.0, i, ((alpha + beta) - 1.0)) / ((i / t_0) * t_4)) * fma(2.0, i, ((alpha + beta) + 1.0)));
	} else if (beta <= 1.05e+183) {
		tmp = 0.25 * ((t_1 * (i / fma(2.0, i, beta))) / t_3);
	} else {
		tmp = ((alpha + i) / (t_2 + 1.0)) * ((t_1 * (i / t_2)) / t_3);
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = fma(2.0, i, Float64(alpha + beta))
	t_1 = Float64(Float64(beta + alpha) + i)
	t_2 = fma(2.0, i, Float64(beta + alpha))
	t_3 = Float64(t_2 - 1.0)
	t_4 = Float64(Float64(i + beta) + alpha)
	tmp = 0.0
	if (beta <= 2.8e+32)
		tmp = 0.0625;
	elseif (beta <= 6.2e+139)
		tmp = Float64(Float64(fma(t_4, i, Float64(alpha * beta)) / t_0) / Float64(Float64(fma(2.0, i, Float64(Float64(alpha + beta) - 1.0)) / Float64(Float64(i / t_0) * t_4)) * fma(2.0, i, Float64(Float64(alpha + beta) + 1.0))));
	elseif (beta <= 1.05e+183)
		tmp = Float64(0.25 * Float64(Float64(t_1 * Float64(i / fma(2.0, i, beta))) / t_3));
	else
		tmp = Float64(Float64(Float64(alpha + i) / Float64(t_2 + 1.0)) * Float64(Float64(t_1 * Float64(i / t_2)) / t_3));
	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[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - 1.0), $MachinePrecision]}, Block[{t$95$4 = N[(N[(i + beta), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 2.8e+32], 0.0625, If[LessEqual[beta, 6.2e+139], N[(N[(N[(t$95$4 * i + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(N[(2.0 * i + N[(N[(alpha + beta), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision] / N[(N[(i / t$95$0), $MachinePrecision] * t$95$4), $MachinePrecision]), $MachinePrecision] * N[(2.0 * i + N[(N[(alpha + beta), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.05e+183], N[(0.25 * N[(N[(t$95$1 * N[(i / N[(2.0 * i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / N[(t$95$2 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$1 * N[(i / t$95$2), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if beta < 2.8e32

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 87.4%

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

   if 2.8e32 < beta < 6.2e139

   1. Initial program 30.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. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 74.7%

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

   6. Applied rewrites 79.0%

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

   8. Applied rewrites 75.3%

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

   if 6.2e139 < beta < 1.05e183

   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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 24.4%

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

   6. Applied rewrites 26.9%

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

   7. Taylor expanded in i around inf

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

   9. Applied rewrites 77.6%

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

   10. Taylor expanded in alpha around 0

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

       1. lower-/.f64 N/A

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

       2. +-commutative N/A

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

       3. lower-fma.f64 77.6

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

   12. Applied rewrites 77.6%

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

   if 1.05e183 < 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. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 17.2%

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

   6. Applied rewrites 24.0%

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

   7. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-lft-out N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 77.2

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

   9. Applied rewrites 77.2%

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

4. Final simplification 84.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+32}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 6.2 \cdot 10^{+139}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(i + \beta\right) + \alpha, i, \alpha \cdot \beta\right)}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{\frac{\mathsf{fma}\left(2, i, \left(\alpha + \beta\right) - 1\right)}{\frac{i}{\mathsf{fma}\left(2, i, \alpha + \beta\right)} \cdot \left(\left(i + \beta\right) + \alpha\right)} \cdot \mathsf{fma}\left(2, i, \left(\alpha + \beta\right) + 1\right)}\\ \mathbf{elif}\;\beta \leq 1.05 \cdot 10^{+183}:\\ \;\;\;\;0.25 \cdot \frac{\left(\left(\beta + \alpha\right) + i\right) \cdot \frac{i}{\mathsf{fma}\left(2, i, \beta\right)}}{\mathsf{fma}\left(2, i, \beta + \alpha\right) - 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{\mathsf{fma}\left(2, i, \beta + \alpha\right) + 1} \cdot \frac{\left(\left(\beta + \alpha\right) + i\right) \cdot \frac{i}{\mathsf{fma}\left(2, i, \beta + \alpha\right)}}{\mathsf{fma}\left(2, i, \beta + \alpha\right) - 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 81.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(2, i, \beta + \alpha\right)\\ t_1 := t\_0 - 1\\ t_2 := \left(\alpha + \beta\right) + i\\ t_3 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\ t_4 := \left(\beta + \alpha\right) + i\\ \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+32}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 6.2 \cdot 10^{+139}:\\ \;\;\;\;\frac{t\_2 \cdot \frac{i}{t\_3}}{1 + t\_3} \cdot \frac{\frac{\mathsf{fma}\left(t\_2, i, \alpha \cdot \beta\right)}{t\_3}}{t\_3 - 1}\\ \mathbf{elif}\;\beta \leq 1.05 \cdot 10^{+183}:\\ \;\;\;\;0.25 \cdot \frac{t\_4 \cdot \frac{i}{\mathsf{fma}\left(2, i, \beta\right)}}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{t\_0 + 1} \cdot \frac{t\_4 \cdot \frac{i}{t\_0}}{t\_1}\\ \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 (fma 2.0 i (+ beta alpha)))
        (t_1 (- t_0 1.0))
        (t_2 (+ (+ alpha beta) i))
        (t_3 (fma 2.0 i (+ alpha beta)))
        (t_4 (+ (+ beta alpha) i)))
   (if (<= beta 2.8e+32)
     0.0625
     (if (<= beta 6.2e+139)
       (*
        (/ (* t_2 (/ i t_3)) (+ 1.0 t_3))
        (/ (/ (fma t_2 i (* alpha beta)) t_3) (- t_3 1.0)))
       (if (<= beta 1.05e+183)
         (* 0.25 (/ (* t_4 (/ i (fma 2.0 i beta))) t_1))
         (* (/ (+ alpha i) (+ t_0 1.0)) (/ (* t_4 (/ i t_0)) t_1)))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = fma(2.0, i, (beta + alpha));
	double t_1 = t_0 - 1.0;
	double t_2 = (alpha + beta) + i;
	double t_3 = fma(2.0, i, (alpha + beta));
	double t_4 = (beta + alpha) + i;
	double tmp;
	if (beta <= 2.8e+32) {
		tmp = 0.0625;
	} else if (beta <= 6.2e+139) {
		tmp = ((t_2 * (i / t_3)) / (1.0 + t_3)) * ((fma(t_2, i, (alpha * beta)) / t_3) / (t_3 - 1.0));
	} else if (beta <= 1.05e+183) {
		tmp = 0.25 * ((t_4 * (i / fma(2.0, i, beta))) / t_1);
	} else {
		tmp = ((alpha + i) / (t_0 + 1.0)) * ((t_4 * (i / t_0)) / t_1);
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = fma(2.0, i, Float64(beta + alpha))
	t_1 = Float64(t_0 - 1.0)
	t_2 = Float64(Float64(alpha + beta) + i)
	t_3 = fma(2.0, i, Float64(alpha + beta))
	t_4 = Float64(Float64(beta + alpha) + i)
	tmp = 0.0
	if (beta <= 2.8e+32)
		tmp = 0.0625;
	elseif (beta <= 6.2e+139)
		tmp = Float64(Float64(Float64(t_2 * Float64(i / t_3)) / Float64(1.0 + t_3)) * Float64(Float64(fma(t_2, i, Float64(alpha * beta)) / t_3) / Float64(t_3 - 1.0)));
	elseif (beta <= 1.05e+183)
		tmp = Float64(0.25 * Float64(Float64(t_4 * Float64(i / fma(2.0, i, beta))) / t_1));
	else
		tmp = Float64(Float64(Float64(alpha + i) / Float64(t_0 + 1.0)) * Float64(Float64(t_4 * Float64(i / t_0)) / t_1));
	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[(2.0 * i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision]}, If[LessEqual[beta, 2.8e+32], 0.0625, If[LessEqual[beta, 6.2e+139], N[(N[(N[(t$95$2 * N[(i / t$95$3), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$3), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(t$95$2 * i + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision] / N[(t$95$3 - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.05e+183], N[(0.25 * N[(N[(t$95$4 * N[(i / N[(2.0 * i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$4 * N[(i / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if beta < 2.8e32

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 87.4%

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

   if 2.8e32 < beta < 6.2e139

   1. Initial program 30.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. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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} \]

      4. lift-*.f64 N/A

         \[\leadsto \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)}{\color{blue}{\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. times-frac N/A

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

      6. lift--.f64 N/A

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

      7. lift-*.f64 N/A

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

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

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

   4. Applied rewrites 79.0%

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

   if 6.2e139 < beta < 1.05e183

   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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 24.4%

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

   6. Applied rewrites 26.9%

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

   7. Taylor expanded in i around inf

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

   9. Applied rewrites 77.6%

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

   10. Taylor expanded in alpha around 0

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

       1. lower-/.f64 N/A

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

       2. +-commutative N/A

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

       3. lower-fma.f64 77.6

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

   12. Applied rewrites 77.6%

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

   if 1.05e183 < 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. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 17.2%

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

   6. Applied rewrites 24.0%

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

   7. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-lft-out N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 77.2

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

   9. Applied rewrites 77.2%

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

4. Final simplification 84.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+32}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 6.2 \cdot 10^{+139}:\\ \;\;\;\;\frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \frac{i}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{1 + \mathsf{fma}\left(2, i, \alpha + \beta\right)} \cdot \frac{\frac{\mathsf{fma}\left(\left(\alpha + \beta\right) + i, i, \alpha \cdot \beta\right)}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{\mathsf{fma}\left(2, i, \alpha + \beta\right) - 1}\\ \mathbf{elif}\;\beta \leq 1.05 \cdot 10^{+183}:\\ \;\;\;\;0.25 \cdot \frac{\left(\left(\beta + \alpha\right) + i\right) \cdot \frac{i}{\mathsf{fma}\left(2, i, \beta\right)}}{\mathsf{fma}\left(2, i, \beta + \alpha\right) - 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{\mathsf{fma}\left(2, i, \beta + \alpha\right) + 1} \cdot \frac{\left(\left(\beta + \alpha\right) + i\right) \cdot \frac{i}{\mathsf{fma}\left(2, i, \beta + \alpha\right)}}{\mathsf{fma}\left(2, i, \beta + \alpha\right) - 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 81.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(2, i, \beta + \alpha\right)\\ t_1 := t\_0 - 1\\ t_2 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_3 := \left(\alpha + \beta\right) + i\\ t_4 := \mathsf{fma}\left(2, i, \alpha + \beta\right)\\ t_5 := \left(\beta + \alpha\right) + i\\ \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+32}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 6.2 \cdot 10^{+139}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(t\_3, i, \alpha \cdot \beta\right)}{t\_4} \cdot \left(t\_3 \cdot \frac{i}{t\_4}\right)}{t\_2 \cdot t\_2 - 1}\\ \mathbf{elif}\;\beta \leq 1.05 \cdot 10^{+183}:\\ \;\;\;\;0.25 \cdot \frac{t\_5 \cdot \frac{i}{\mathsf{fma}\left(2, i, \beta\right)}}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{t\_0 + 1} \cdot \frac{t\_5 \cdot \frac{i}{t\_0}}{t\_1}\\ \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 (fma 2.0 i (+ beta alpha)))
        (t_1 (- t_0 1.0))
        (t_2 (+ (+ alpha beta) (* 2.0 i)))
        (t_3 (+ (+ alpha beta) i))
        (t_4 (fma 2.0 i (+ alpha beta)))
        (t_5 (+ (+ beta alpha) i)))
   (if (<= beta 2.8e+32)
     0.0625
     (if (<= beta 6.2e+139)
       (/
        (* (/ (fma t_3 i (* alpha beta)) t_4) (* t_3 (/ i t_4)))
        (- (* t_2 t_2) 1.0))
       (if (<= beta 1.05e+183)
         (* 0.25 (/ (* t_5 (/ i (fma 2.0 i beta))) t_1))
         (* (/ (+ alpha i) (+ t_0 1.0)) (/ (* t_5 (/ i t_0)) t_1)))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = fma(2.0, i, (beta + alpha));
	double t_1 = t_0 - 1.0;
	double t_2 = (alpha + beta) + (2.0 * i);
	double t_3 = (alpha + beta) + i;
	double t_4 = fma(2.0, i, (alpha + beta));
	double t_5 = (beta + alpha) + i;
	double tmp;
	if (beta <= 2.8e+32) {
		tmp = 0.0625;
	} else if (beta <= 6.2e+139) {
		tmp = ((fma(t_3, i, (alpha * beta)) / t_4) * (t_3 * (i / t_4))) / ((t_2 * t_2) - 1.0);
	} else if (beta <= 1.05e+183) {
		tmp = 0.25 * ((t_5 * (i / fma(2.0, i, beta))) / t_1);
	} else {
		tmp = ((alpha + i) / (t_0 + 1.0)) * ((t_5 * (i / t_0)) / t_1);
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = fma(2.0, i, Float64(beta + alpha))
	t_1 = Float64(t_0 - 1.0)
	t_2 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_3 = Float64(Float64(alpha + beta) + i)
	t_4 = fma(2.0, i, Float64(alpha + beta))
	t_5 = Float64(Float64(beta + alpha) + i)
	tmp = 0.0
	if (beta <= 2.8e+32)
		tmp = 0.0625;
	elseif (beta <= 6.2e+139)
		tmp = Float64(Float64(Float64(fma(t_3, i, Float64(alpha * beta)) / t_4) * Float64(t_3 * Float64(i / t_4))) / Float64(Float64(t_2 * t_2) - 1.0));
	elseif (beta <= 1.05e+183)
		tmp = Float64(0.25 * Float64(Float64(t_5 * Float64(i / fma(2.0, i, beta))) / t_1));
	else
		tmp = Float64(Float64(Float64(alpha + i) / Float64(t_0 + 1.0)) * Float64(Float64(t_5 * Float64(i / t_0)) / t_1));
	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[(2.0 * i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]}, Block[{t$95$4 = N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision]}, If[LessEqual[beta, 2.8e+32], 0.0625, If[LessEqual[beta, 6.2e+139], N[(N[(N[(N[(t$95$3 * i + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision] * N[(t$95$3 * N[(i / t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$2 * t$95$2), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.05e+183], N[(0.25 * N[(N[(t$95$5 * N[(i / N[(2.0 * i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$5 * N[(i / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if beta < 2.8e32

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 87.4%

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

   if 2.8e32 < beta < 6.2e139

   1. Initial program 30.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. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. lower-*.f64 N/A

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

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

   if 6.2e139 < beta < 1.05e183

   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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 24.4%

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

   6. Applied rewrites 26.9%

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

   7. Taylor expanded in i around inf

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

   9. Applied rewrites 77.6%

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

   10. Taylor expanded in alpha around 0

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

       1. lower-/.f64 N/A

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

       2. +-commutative N/A

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

       3. lower-fma.f64 77.6

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

   12. Applied rewrites 77.6%

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

   if 1.05e183 < 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. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 17.2%

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

   6. Applied rewrites 24.0%

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

   7. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-lft-out N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 77.2

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

   9. Applied rewrites 77.2%

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

4. Final simplification 84.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+32}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 6.2 \cdot 10^{+139}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(\alpha + \beta\right) + i, i, \alpha \cdot \beta\right)}{\mathsf{fma}\left(2, i, \alpha + \beta\right)} \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \frac{i}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1}\\ \mathbf{elif}\;\beta \leq 1.05 \cdot 10^{+183}:\\ \;\;\;\;0.25 \cdot \frac{\left(\left(\beta + \alpha\right) + i\right) \cdot \frac{i}{\mathsf{fma}\left(2, i, \beta\right)}}{\mathsf{fma}\left(2, i, \beta + \alpha\right) - 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{\mathsf{fma}\left(2, i, \beta + \alpha\right) + 1} \cdot \frac{\left(\left(\beta + \alpha\right) + i\right) \cdot \frac{i}{\mathsf{fma}\left(2, i, \beta + \alpha\right)}}{\mathsf{fma}\left(2, i, \beta + \alpha\right) - 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 82.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(2, i, \beta + \alpha\right)\\ t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\ \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+32}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 1.8 \cdot 10^{+125}:\\ \;\;\;\;\frac{\frac{\frac{\left(\beta + i\right) \cdot i}{\mathsf{fma}\left(2, i, \beta\right)}}{\frac{\mathsf{fma}\left(2, i, \alpha + \beta\right)}{\left(\left(\alpha + \beta\right) + i\right) \cdot i}}}{t\_1 \cdot t\_1 - 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{t\_0 + 1} \cdot \frac{\left(\left(\beta + \alpha\right) + i\right) \cdot \frac{i}{t\_0}}{t\_0 - 1}\\ \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 (fma 2.0 i (+ beta alpha))) (t_1 (+ (+ alpha beta) (* 2.0 i))))
   (if (<= beta 2.8e+32)
     0.0625
     (if (<= beta 1.8e+125)
       (/
        (/
         (/ (* (+ beta i) i) (fma 2.0 i beta))
         (/ (fma 2.0 i (+ alpha beta)) (* (+ (+ alpha beta) i) i)))
        (- (* t_1 t_1) 1.0))
       (*
        (/ (+ alpha i) (+ t_0 1.0))
        (/ (* (+ (+ beta alpha) i) (/ i t_0)) (- t_0 1.0)))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = fma(2.0, i, (beta + alpha));
	double t_1 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (beta <= 2.8e+32) {
		tmp = 0.0625;
	} else if (beta <= 1.8e+125) {
		tmp = ((((beta + i) * i) / fma(2.0, i, beta)) / (fma(2.0, i, (alpha + beta)) / (((alpha + beta) + i) * i))) / ((t_1 * t_1) - 1.0);
	} else {
		tmp = ((alpha + i) / (t_0 + 1.0)) * ((((beta + alpha) + i) * (i / t_0)) / (t_0 - 1.0));
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = fma(2.0, i, Float64(beta + alpha))
	t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	tmp = 0.0
	if (beta <= 2.8e+32)
		tmp = 0.0625;
	elseif (beta <= 1.8e+125)
		tmp = Float64(Float64(Float64(Float64(Float64(beta + i) * i) / fma(2.0, i, beta)) / Float64(fma(2.0, i, Float64(alpha + beta)) / Float64(Float64(Float64(alpha + beta) + i) * i))) / Float64(Float64(t_1 * t_1) - 1.0));
	else
		tmp = Float64(Float64(Float64(alpha + i) / Float64(t_0 + 1.0)) * Float64(Float64(Float64(Float64(beta + alpha) + i) * Float64(i / t_0)) / Float64(t_0 - 1.0)));
	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[(2.0 * i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.8e+32], 0.0625, If[LessEqual[beta, 1.8e+125], N[(N[(N[(N[(N[(beta + i), $MachinePrecision] * i), $MachinePrecision] / N[(2.0 * i + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$1 * t$95$1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision] * N[(i / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if beta < 2.8e32

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 87.4%

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

   if 2.8e32 < beta < 1.8000000000000002e125

   1. Initial program 33.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. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 71.1%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 67.8

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

   7. Applied rewrites 67.8%

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

   if 1.8000000000000002e125 < beta

   1. Initial program 0.2%

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

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 22.5%

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

   6. Applied rewrites 28.5%

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

   7. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-lft-out N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 75.2

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

   9. Applied rewrites 75.2%

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

4. Final simplification 83.3%

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

Alternative 5: 82.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(2, i, \beta + \alpha\right)\\ t_1 := \frac{\left(\left(\beta + \alpha\right) + i\right) \cdot \frac{i}{t\_0}}{t\_0 - 1}\\ \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+32}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 5.4 \cdot 10^{+115}:\\ \;\;\;\;\frac{\left(i + \beta\right) \cdot i}{\left(\mathsf{fma}\left(2, i, \beta\right) + 1\right) \cdot \mathsf{fma}\left(2, i, \beta\right)} \cdot t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{t\_0 + 1} \cdot t\_1\\ \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 (fma 2.0 i (+ beta alpha)))
        (t_1 (/ (* (+ (+ beta alpha) i) (/ i t_0)) (- t_0 1.0))))
   (if (<= beta 2.8e+32)
     0.0625
     (if (<= beta 5.4e+115)
       (*
        (/ (* (+ i beta) i) (* (+ (fma 2.0 i beta) 1.0) (fma 2.0 i beta)))
        t_1)
       (* (/ (+ alpha i) (+ t_0 1.0)) t_1)))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = fma(2.0, i, (beta + alpha));
	double t_1 = (((beta + alpha) + i) * (i / t_0)) / (t_0 - 1.0);
	double tmp;
	if (beta <= 2.8e+32) {
		tmp = 0.0625;
	} else if (beta <= 5.4e+115) {
		tmp = (((i + beta) * i) / ((fma(2.0, i, beta) + 1.0) * fma(2.0, i, beta))) * t_1;
	} else {
		tmp = ((alpha + i) / (t_0 + 1.0)) * t_1;
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = fma(2.0, i, Float64(beta + alpha))
	t_1 = Float64(Float64(Float64(Float64(beta + alpha) + i) * Float64(i / t_0)) / Float64(t_0 - 1.0))
	tmp = 0.0
	if (beta <= 2.8e+32)
		tmp = 0.0625;
	elseif (beta <= 5.4e+115)
		tmp = Float64(Float64(Float64(Float64(i + beta) * i) / Float64(Float64(fma(2.0, i, beta) + 1.0) * fma(2.0, i, beta))) * t_1);
	else
		tmp = Float64(Float64(Float64(alpha + i) / Float64(t_0 + 1.0)) * t_1);
	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[(2.0 * i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision] * N[(i / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 - 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.8e+32], 0.0625, If[LessEqual[beta, 5.4e+115], N[(N[(N[(N[(i + beta), $MachinePrecision] * i), $MachinePrecision] / N[(N[(N[(2.0 * i + beta), $MachinePrecision] + 1.0), $MachinePrecision] * N[(2.0 * i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if beta < 2.8e32

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 87.4%

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

   if 2.8e32 < beta < 5.40000000000000008e115

   1. Initial program 32.2%

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

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 68.1%

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

   6. Applied rewrites 73.8%

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

   7. Taylor expanded in i around inf

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

   9. Applied rewrites 38.4%

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

   10. Taylor expanded in alpha around 0

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

       1. lower-/.f64 N/A

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

       2. *-commutative N/A

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

       3. lower-*.f64 N/A

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

       4. +-commutative N/A

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

       5. lower-+.f64 N/A

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

       6. lower-*.f64 N/A

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

       7. +-commutative N/A

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

       8. lower-+.f64 N/A

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

       9. +-commutative N/A

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

       10. lower-fma.f64 N/A

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

       11. +-commutative N/A

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

       12. lower-fma.f64 65.7

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

   12. Applied rewrites 65.7%

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

   if 5.40000000000000008e115 < beta

   1. Initial program 2.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 25.3%

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

   6. Applied rewrites 31.1%

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

   7. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-lft-out N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 76.0

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

   9. Applied rewrites 76.0%

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

4. Final simplification 83.4%

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

Alternative 6: 85.2% accurate, 1.2× speedup

Math

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = fma(2.0, i, (beta + alpha));
	double tmp;
	if (beta <= 1.5e+99) {
		tmp = 0.0625;
	} else {
		tmp = ((alpha + i) / (t_0 + 1.0)) * ((((beta + alpha) + i) * (i / t_0)) / (t_0 - 1.0));
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = fma(2.0, i, Float64(beta + alpha))
	tmp = 0.0
	if (beta <= 1.5e+99)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(Float64(alpha + i) / Float64(t_0 + 1.0)) * Float64(Float64(Float64(Float64(beta + alpha) + i) * Float64(i / t_0)) / Float64(t_0 - 1.0)));
	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[(2.0 * i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.5e+99], 0.0625, N[(N[(N[(alpha + i), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision] * N[(i / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.50000000000000007e99

   1. Initial program 18.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} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 84.4%

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

   if 1.50000000000000007e99 < beta

   1. Initial program 3.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 29.2%

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

   6. Applied rewrites 34.7%

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

   7. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-lft-out N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 77.3

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

   9. Applied rewrites 77.3%

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

4. Final simplification 82.8%

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

Alternative 7: 85.2% accurate, 1.2× speedup

Math

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = fma(2.0, i, (alpha + beta));
	double tmp;
	if (beta <= 1.5e+99) {
		tmp = 0.0625;
	} else {
		tmp = ((((i + alpha) / (t_0 + 1.0)) * (i / t_0)) * ((alpha + beta) + i)) / (t_0 - 1.0);
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = fma(2.0, i, Float64(alpha + beta))
	tmp = 0.0
	if (beta <= 1.5e+99)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(Float64(Float64(Float64(i + alpha) / Float64(t_0 + 1.0)) * Float64(i / t_0)) * Float64(Float64(alpha + beta) + i)) / Float64(t_0 - 1.0));
	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[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.5e+99], 0.0625, N[(N[(N[(N[(N[(i + alpha), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(i / t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 - 1.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.50000000000000007e99

   1. Initial program 18.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} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 84.4%

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

   if 1.50000000000000007e99 < beta

   1. Initial program 3.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 29.2%

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

   6. Applied rewrites 34.7%

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

   7. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-lft-out N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 77.3

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

   9. Applied rewrites 77.3%

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

       1. lift-*.f64 N/A

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

       2. lift-/.f64 N/A

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

       3. associate-*r/ N/A

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

       4. lower-/.f64 N/A

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

   11. Applied rewrites 77.3%

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

Alternative 8: 83.6% accurate, 1.4× speedup

Math

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = fma(2.0, i, (beta + alpha));
	double tmp;
	if (beta <= 1.5e+99) {
		tmp = 0.0625;
	} else {
		tmp = ((alpha + i) / beta) * ((((beta + alpha) + i) * (i / t_0)) / (t_0 - 1.0));
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = fma(2.0, i, Float64(beta + alpha))
	tmp = 0.0
	if (beta <= 1.5e+99)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(Float64(alpha + i) / beta) * Float64(Float64(Float64(Float64(beta + alpha) + i) * Float64(i / t_0)) / Float64(t_0 - 1.0)));
	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[(2.0 * i + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.5e+99], 0.0625, N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] * N[(N[(N[(N[(beta + alpha), $MachinePrecision] + i), $MachinePrecision] * N[(i / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.50000000000000007e99

   1. Initial program 18.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} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 84.4%

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

   if 1.50000000000000007e99 < beta

   1. Initial program 3.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 29.2%

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

   6. Applied rewrites 34.7%

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

   7. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 75.0

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

   9. Applied rewrites 75.0%

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

Alternative 9: 83.6% accurate, 2.1× speedup

Math

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.5e+99) {
		tmp = 0.0625;
	} else {
		tmp = ((alpha + i) / (fma(2.0, i, (beta + alpha)) + 1.0)) * (i / ((alpha + beta) - 1.0));
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.50000000000000007e99

   1. Initial program 18.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} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 84.4%

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

   if 1.50000000000000007e99 < beta

   1. Initial program 3.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\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(\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. lift-*.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\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. *-commutative N/A

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

      4. lift-*.f64 N/A

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

         \[\leadsto \frac{\color{blue}{\frac{\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)}{\left(\alpha + \beta\right) + 2 \cdot i} \cdot \frac{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. clear-num N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

   4. Applied rewrites 29.2%

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

   6. Applied rewrites 34.7%

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

   7. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-lft-out N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 77.3

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

   9. Applied rewrites 77.3%

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

   10. Taylor expanded in i around 0

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

       1. lower-/.f64 N/A

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

       2. lower--.f64 N/A

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

       3. lower-+.f64 75.1

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

   12. Applied rewrites 75.1%

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

4. Final simplification 82.3%

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

Alternative 10: 84.8% accurate, 2.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.06e183

   1. Initial program 18.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} \]
   2. Add Preprocessing

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 81.3%

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

   if 1.06e183 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 74.8

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

   5. Applied rewrites 74.8%

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

   7. Applied rewrites 75.0%

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

Alternative 11: 84.3% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.4e193

   1. Initial program 18.2%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 80.4%

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

   if 2.4e193 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 78.8

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

   5. Applied rewrites 78.8%

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

   7. Applied rewrites 79.0%

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

Alternative 12: 84.5% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 5.99999999999999964e190

   1. Initial program 18.5%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 81.0%

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

   if 5.99999999999999964e190 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 75.8

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

   5. Applied rewrites 75.8%

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

Alternative 13: 82.7% accurate, 3.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.7e193

   1. Initial program 18.2%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 80.4%

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

   if 2.7e193 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 78.8

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

   5. Applied rewrites 78.8%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 34.9%

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

   9. Taylor expanded in alpha around 0

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

   11. Applied rewrites 33.4%

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

   13. Applied rewrites 74.4%

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

Alternative 14: 73.8% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 9e245

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 75.6%

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

   if 9e245 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 89.9

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

   5. Applied rewrites 89.9%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 40.1%

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

Alternative 15: 70.8% accurate, 115.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 15.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. Taylor expanded in i around inf

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

5. Applied rewrites 71.0%

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

Reproduce

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