Octave 3.8, jcobi/4

Percentage Accurate: 16.6% → 84.9%

Time: 18.2s

Alternatives: 7

Speedup: 8.8×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 16.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 84.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.8000000000000001e200

   1. Initial program 16.3%

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

   3. Simplified 37.0%

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

   5. Taylor expanded in i around inf 86.4%

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

      1. distribute-lft-out 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in alpha around 0 82.2%

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

      1. *-commutative 82.2%

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

   10. Simplified 82.2%

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

   11. Taylor expanded in alpha around 0 83.4%

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

   if 4.8000000000000001e200 < 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. Step-by-step derivation

      1. associate-/l/ 0.0%

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

      2. times-frac 14.7%

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

   3. Simplified 14.7%

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

   5. Taylor expanded in beta around inf 16.8%

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

   6. Taylor expanded in beta around inf 81.7%

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

4. Final simplification 83.3%

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

Alternative 2: 80.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.6%

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

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

   1. Initial program 0.6%

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

   3. Simplified 24.1%

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

   5. Taylor expanded in i around inf 82.9%

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

      1. distribute-lft-out 82.9%

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

   7. Simplified 82.9%

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

   8. Taylor expanded in alpha around 0 79.2%

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

      1. *-commutative 79.2%

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

   10. Simplified 79.2%

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

   11. Taylor expanded in alpha around 0 80.1%

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

4. Final simplification 82.9%

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

Alternative 3: 83.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.4000000000000001e200

   1. Initial program 16.3%

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

   3. Simplified 37.0%

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

   5. Taylor expanded in i around inf 86.4%

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

      1. distribute-lft-out 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in alpha around 0 82.2%

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

      1. *-commutative 82.2%

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

   10. Simplified 82.2%

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

   11. Taylor expanded in alpha around 0 83.4%

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

   if 2.4000000000000001e200 < 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. Step-by-step derivation

      1. associate-/l/ 0.0%

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

      2. +-commutative 0.0%

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

      3. *-commutative 0.0%

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

      4. distribute-rgt-in 0.0%

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

      5. +-commutative 0.0%

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

      6. distribute-rgt-in 0.0%

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

      7. fma-define 0.0%

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

      8. +-commutative 0.0%

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

      9. +-commutative 0.0%

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

   3. Simplified 0.0%

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

   5. Taylor expanded in beta around inf 0.0%

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

   6. Taylor expanded in beta around inf 32.9%

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

      1. associate-/l* 34.9%

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

      2. +-commutative 34.9%

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

   8. Simplified 34.9%

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

   9. Taylor expanded in i around inf 33.2%

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

       1. unpow2 33.2%

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

       2. unpow2 33.2%

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

       3. times-frac 71.9%

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

       4. unpow2 71.9%

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

   11. Simplified 71.9%

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

4. Final simplification 82.2%

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

Alternative 4: 78.0% accurate, 3.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.85000000000000003e200

   1. Initial program 16.3%

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

   3. Simplified 37.0%

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

   5. Taylor expanded in i around inf 83.4%

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

   if 2.85000000000000003e200 < 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. Step-by-step derivation

      1. associate-/l/ 0.0%

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

      2. +-commutative 0.0%

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

      3. *-commutative 0.0%

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

      4. distribute-rgt-in 0.0%

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

      5. +-commutative 0.0%

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

      6. distribute-rgt-in 0.0%

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

      7. fma-define 0.0%

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

      8. +-commutative 0.0%

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

      9. +-commutative 0.0%

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

   3. Simplified 0.0%

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

   5. Taylor expanded in beta around inf 0.0%

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

   6. Taylor expanded in beta around inf 32.9%

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

      1. associate-/l* 34.9%

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

      2. +-commutative 34.9%

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

   8. Simplified 34.9%

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

      1. *-un-lft-identity 34.9%

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

      2. unpow2 34.9%

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

      3. times-frac 57.7%

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

   10. Applied egg-rr 57.7%

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

Alternative 5: 77.3% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 14.6%

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

3. Simplified 34.7%

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

5. Taylor expanded in i around inf 82.0%

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

   1. distribute-lft-out 82.0%

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

7. Simplified 82.0%

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

8. Taylor expanded in alpha around 0 78.5%

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

   1. *-commutative 78.5%

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

10. Simplified 78.5%

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

11. Taylor expanded in alpha around 0 79.6%

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

12. Final simplification 79.6%

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

Alternative 6: 74.0% accurate, 8.8× speedup

Math

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

FPCore

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.1e+238) {
		tmp = 0.0625;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.1e+238)
		tmp = 0.0625;
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

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

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.1e+238], 0.0625, 0.0]

Derivation

1. Split input into 2 regimes

2. if beta < 1.1e238

   1. Initial program 15.7%

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

   3. Simplified 36.4%

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

   5. Taylor expanded in i around inf 80.9%

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

   if 1.1e238 < beta

   1. Initial program 0.0%

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

   3. Simplified 11.1%

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

   5. Taylor expanded in i around inf 49.0%

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

      1. distribute-lft-out 49.0%

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

   7. Simplified 49.0%

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

      1. add-log-exp 48.3%

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

      2. cancel-sign-sub-inv 48.3%

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

      3. +-commutative 48.3%

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

      4. fma-define 48.3%

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

      5. associate-/l* 51.4%

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

      6. metadata-eval 51.4%

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

   9. Applied egg-rr 51.4%

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

   10. Taylor expanded in i around 0 39.5%

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

       1. distribute-rgt-out 39.5%

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

       2. +-commutative 39.5%

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

       3. metadata-eval 39.5%

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

       4. mul0-rgt 39.5%

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

       5. div0 39.5%

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

   12. Simplified 39.5%

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

Alternative 7: 10.0% accurate, 53.0× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ 0 \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.0)

C

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

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.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 14.6%

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

3. Simplified 34.7%

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

5. Taylor expanded in i around inf 82.0%

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

   1. distribute-lft-out 82.0%

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

7. Simplified 82.0%

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

   1. add-log-exp 77.4%

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

   2. cancel-sign-sub-inv 77.4%

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

   3. +-commutative 77.4%

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

   4. fma-define 77.4%

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

   5. associate-/l* 77.7%

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

   6. metadata-eval 77.7%

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

9. Applied egg-rr 77.7%

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

10. Taylor expanded in i around 0 9.3%

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

    1. distribute-rgt-out 9.3%

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

    2. +-commutative 9.3%

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

    3. metadata-eval 9.3%

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

    4. mul0-rgt 9.3%

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

    5. div0 9.3%

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

12. Simplified 9.3%

    \[\leadsto \color{blue}{0} \]
13. Add Preprocessing

Reproduce

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