Octave 3.8, jcobi/4

Percentage Accurate: 15.4% → 86.0%

Time: 13.3s

Alternatives: 6

Speedup: 115.0×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 15.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 86.0% accurate, 2.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.55e170

   1. Initial program 19.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 i around inf

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

   5. Applied rewrites 81.1%

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

   if 1.55e170 < beta

   1. Initial program 0.0%

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

      1. lift-/.f64 N/A

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

      2. div-inv N/A

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

      5. associate-/r* N/A

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

   4. Applied rewrites 0.0%

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

   5. Taylor expanded in beta around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 78.2

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

   7. Applied rewrites 78.2%

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

   8. Taylor expanded in alpha around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 78.1

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

   10. Applied rewrites 78.1%

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

4. Final simplification 80.6%

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

Alternative 2: 85.9% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.55e170

   1. Initial program 19.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 i around inf

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

   5. Applied rewrites 81.1%

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

   if 1.55e170 < 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. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.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. lower-*.f64 23.1

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

   5. Applied rewrites 23.1%

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

   7. Applied rewrites 78.0%

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

Alternative 3: 75.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.65 \cdot 10^{+214}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{i \cdot \alpha}{\beta}}{\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.65e+214) 0.0625 (/ (/ (* i alpha) beta) beta)))

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.65000000000000006e214

   1. Initial program 18.4%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 79.2%

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

   if 1.65000000000000006e214 < 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. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.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. lower-*.f64 26.6

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

   5. Applied rewrites 26.6%

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

   6. Taylor expanded in i around 0

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

   8. Applied rewrites 28.3%

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

   10. Applied rewrites 37.2%

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

Alternative 4: 75.0% accurate, 3.7× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 6.8000000000000002e244

   1. Initial program 17.8%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 77.1%

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

   if 6.8000000000000002e244 < 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. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.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. lower-*.f64 35.0

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

   5. Applied rewrites 35.0%

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

   7. Applied rewrites 37.9%

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

4. Final simplification 73.5%

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

Alternative 5: 74.9% accurate, 4.1× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 6.8000000000000002e244

   1. Initial program 17.8%

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

   3. Taylor expanded in i around inf

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

   5. Applied rewrites 77.1%

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

   if 6.8000000000000002e244 < 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. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.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. lower-*.f64 35.0

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

   5. Applied rewrites 35.0%

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

   6. Taylor expanded in i around 0

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

   8. Applied rewrites 36.9%

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

4. Final simplification 73.4%

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

Alternative 6: 71.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 16.2%

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

3. Taylor expanded in i around inf

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

5. Applied rewrites 70.6%

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

Reproduce

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