Octave 3.8, jcobi/4

Percentage Accurate: 15.8% → 84.7%

Time: 16.0s

Alternatives: 7

Speedup: 115.0×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 15.8% 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.7% accurate, 2.0× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.10000000000000001e121

   1. Initial program 23.5%

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

   3. Taylor expanded in i around inf

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

   5. Simplified 83.6%

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

   if 1.10000000000000001e121 < beta

   1. Initial program 0.1%

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

   3. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

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

   5. Simplified 30.9%

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

   6. Taylor expanded in alpha around 0

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

      1. distribute-rgt-out-- N/A

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

      2. metadata-eval N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. unpow2 N/A

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

      6. *-lowering-*.f64 33.5

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

   8. Simplified 33.5%

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

   9. Taylor expanded in i around 0

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

       1. *-lowering-*.f64 N/A

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

       2. +-commutative N/A

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

       3. accelerator-lowering-fma.f64 N/A

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

       4. +-commutative N/A

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

       5. *-commutative N/A

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

       6. accelerator-lowering-fma.f64 N/A

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

       7. /-lowering-/.f64 33.5

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

   11. Simplified 33.5%

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

       1. times-frac N/A

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

       2. associate-*r/ N/A

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

       3. /-lowering-/.f64 N/A

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

       4. *-lowering-*.f64 N/A

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

       5. /-lowering-/.f64 N/A

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

       6. accelerator-lowering-fma.f64 N/A

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

       7. associate-*l/ N/A

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

       8. associate-/l* N/A

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

       9. accelerator-lowering-fma.f64 N/A

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

       10. /-lowering-/.f64 76.4

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

   13. Applied egg-rr 76.4%

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

Alternative 2: 85.0% accurate, 3.1× speedup

Math

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

C

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

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 2.2e+123:
		tmp = 0.0625
	else:
		tmp = (i / 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.2e+123)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(i / 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.2e+123)
		tmp = 0.0625;
	else
		tmp = (i / 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.2e+123], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.19999999999999992e123

   1. Initial program 23.5%

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

   3. Taylor expanded in i around inf

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

   5. Simplified 83.6%

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

   if 2.19999999999999992e123 < beta

   1. Initial program 0.1%

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

   3. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 N/A

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

      3. +-lowering-+.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 33.6

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

   5. Simplified 33.6%

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

      1. *-commutative N/A

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

      2. times-frac N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. +-commutative N/A

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

      6. +-lowering-+.f64 N/A

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

      7. /-lowering-/.f64 76.2

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

   7. Applied egg-rr 76.2%

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

4. Final simplification 82.3%

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

Alternative 3: 82.6% accurate, 3.4× speedup

Math

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

C

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.10000000000000001e121

   1. Initial program 23.5%

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

   3. Taylor expanded in i around inf

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

   5. Simplified 83.6%

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

   if 1.10000000000000001e121 < beta

   1. Initial program 0.1%

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

   3. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 N/A

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

      3. +-lowering-+.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 33.6

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

   5. Simplified 33.6%

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

   6. Taylor expanded in i around inf

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

      1. /-lowering-/.f64 N/A

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

      2. unpow2 N/A

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

      3. *-lowering-*.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 33.9

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

   8. Simplified 33.9%

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

      1. times-frac N/A

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

      2. *-lowering-*.f64 N/A

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

      3. /-lowering-/.f64 N/A

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

      4. /-lowering-/.f64 68.9

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

   10. Applied egg-rr 68.9%

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

Alternative 4: 76.1% accurate, 3.4× speedup

Math

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 7.2e+202) {
		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 <= 7.2d+202) 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 <= 7.2e+202) {
		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 <= 7.2e+202:
		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 <= 7.2e+202)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(i / beta) * Float64(alpha / beta));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 7.2e+202)
		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, 7.2e+202], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 7.20000000000000016e202

   1. Initial program 22.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. Simplified 79.7%

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

   if 7.20000000000000016e202 < 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. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 N/A

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

      3. +-lowering-+.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 36.7

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

   5. Simplified 36.7%

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

   6. Taylor expanded in i around 0

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

      1. associate-/l* N/A

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

      2. *-lowering-*.f64 N/A

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

      3. /-lowering-/.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 38.6

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

   8. Simplified 38.6%

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

      1. associate-*r/ N/A

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

      2. times-frac N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. /-lowering-/.f64 49.1

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

   10. Applied egg-rr 49.1%

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

4. Final simplification 76.4%

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

Alternative 5: 69.9% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.19999999999999992e123

   1. Initial program 23.5%

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

   3. Taylor expanded in i around inf

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

   5. Simplified 83.6%

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

   if 2.19999999999999992e123 < beta

   1. Initial program 0.1%

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

   3. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 N/A

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

      3. +-lowering-+.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 33.6

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

   5. Simplified 33.6%

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

   6. Taylor expanded in i around inf

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

      1. /-lowering-/.f64 N/A

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

      2. unpow2 N/A

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

      3. *-lowering-*.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 33.9

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

   8. Simplified 33.9%

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

Alternative 6: 74.5% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 7.20000000000000016e202

   1. Initial program 22.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. Simplified 79.7%

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

   if 7.20000000000000016e202 < 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. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 N/A

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

      3. +-lowering-+.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 36.7

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

   5. Simplified 36.7%

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

   6. Taylor expanded in i around 0

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

      1. associate-/l* N/A

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

      2. *-lowering-*.f64 N/A

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

      3. /-lowering-/.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 38.6

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

   8. Simplified 38.6%

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

Alternative 7: 71.4% 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 19.6%

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

3. Taylor expanded in i around inf

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

5. Simplified 72.3%

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

Reproduce

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