Octave 3.8, jcobi/4

Percentage Accurate: 16.2% → 84.2%

Time: 12.2s

Alternatives: 9

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: 16.2% 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.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(i, 2, \alpha + \beta\right)\\ \mathbf{if}\;\beta \leq 5 \cdot 10^{+222}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\beta}{i}, 0.125, 0.0625\right) - \frac{\beta}{i} \cdot 0.125\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha + i}{1 - t\_0} \cdot \frac{\frac{i}{t\_0} \cdot \left(\left(\alpha + \beta\right) + i\right)}{-1 - 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 (fma i 2.0 (+ alpha beta))))
   (if (<= beta 5e+222)
     (- (fma (/ beta i) 0.125 0.0625) (* (/ beta i) 0.125))
     (*
      (/ (+ alpha i) (- 1.0 t_0))
      (/ (* (/ i t_0) (+ (+ alpha beta) i)) (- -1.0 t_0))))))

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 5.00000000000000023e222

   1. Initial program 15.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 76.2%

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

   6. Taylor expanded in i around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. distribute-lft-out N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 82.2

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

   8. Applied rewrites 82.2%

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

   9. Taylor expanded in alpha around 0

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

   11. Applied rewrites 76.4%

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

   12. Taylor expanded in beta around inf

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

   14. Applied rewrites 77.4%

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

   if 5.00000000000000023e222 < 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 alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 0.0

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

   5. Applied rewrites 0.0%

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

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

   8. Taylor expanded in beta around inf

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

      1. lower-+.f64 93.9

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

   10. Applied rewrites 93.9%

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

4. Final simplification 78.9%

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

Alternative 2: 83.9% accurate, 2.7× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 7.10000000000000001e223

   1. Initial program 15.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 76.2%

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

   6. Taylor expanded in i around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. distribute-lft-out N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 82.2

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

   8. Applied rewrites 82.2%

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

   9. Taylor expanded in alpha around 0

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

   11. Applied rewrites 76.4%

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

   12. Taylor expanded in beta around inf

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

   14. Applied rewrites 77.4%

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

   if 7.10000000000000001e223 < 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 93.2

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

   5. Applied rewrites 93.2%

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

   7. Applied rewrites 93.5%

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

4. Final simplification 78.8%

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

Alternative 3: 82.8% accurate, 3.1× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.49999999999999989e222

   1. Initial program 15.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 76.2%

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

   if 4.49999999999999989e222 < 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 93.2

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

   5. Applied rewrites 93.2%

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

   7. Applied rewrites 93.5%

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

4. Final simplification 77.7%

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

Alternative 4: 82.8% accurate, 3.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 4.5 \cdot 10^{+222}:\\ \;\;\;\;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 4.5e+222) 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 <= 4.5e+222) {
		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 <= 4.5d+222) 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 <= 4.5e+222) {
		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 <= 4.5e+222:
		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 <= 4.5e+222)
		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 <= 4.5e+222)
		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, 4.5e+222], 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 < 4.49999999999999989e222

   1. Initial program 15.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 76.2%

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

   if 4.49999999999999989e222 < 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 93.2

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

   5. Applied rewrites 93.2%

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

   7. Applied rewrites 93.4%

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

Alternative 5: 82.8% accurate, 3.1× speedup

Math

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.49999999999999989e222

   1. Initial program 15.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 76.2%

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

   if 4.49999999999999989e222 < 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 93.2

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

   5. Applied rewrites 93.2%

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

4. Final simplification 77.7%

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

Alternative 6: 81.5% accurate, 3.4× speedup

Math

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 4.5e+222) {
		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 <= 4.5d+222) 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 <= 4.5e+222) {
		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 <= 4.5e+222:
		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 <= 4.5e+222)
		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 <= 4.5e+222)
		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, 4.5e+222], 0.0625, N[(N[(N[(i / beta), $MachinePrecision] * i), $MachinePrecision] / beta), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 4.49999999999999989e222

   1. Initial program 15.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 76.2%

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

   if 4.49999999999999989e222 < 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 93.2

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

   5. Applied rewrites 93.2%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 22.7%

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

   10. Applied rewrites 84.4%

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

Alternative 7: 75.2% accurate, 3.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 2.2e+226)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(Float64(i / beta) * 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.2e+226)
		tmp = 0.0625;
	else
		tmp = ((i / beta) * alpha) / beta;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.19999999999999994e226

   1. Initial program 15.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 76.2%

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

   if 2.19999999999999994e226 < 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 93.2

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

   5. Applied rewrites 93.2%

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

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

   10. Applied rewrites 34.9%

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

Alternative 8: 74.1% accurate, 4.1× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.6999999999999999e228

   1. Initial program 15.0%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 76.2%

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

   if 1.6999999999999999e228 < 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 93.2

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

   5. Applied rewrites 93.2%

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

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

4. Final simplification 71.9%

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

Alternative 9: 70.7% 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 13.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 70.3%

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

Reproduce

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