Octave 3.8, jcobi/3

Percentage Accurate: 94.5% → 99.5%

Time: 17.5s

Alternatives: 14

Speedup: 3.2×

Specification

\[\alpha > -1 \land \beta > -1\]

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\ \frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0))))
   (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 94.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\ \frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0))))
   (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \alpha + \left(\beta + 2\right)\\ \mathbf{if}\;\beta \leq 5 \cdot 10^{+134}:\\ \;\;\;\;\frac{1 + \alpha}{t_0} \cdot \frac{1 + \beta}{t_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{t_0}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ alpha (+ beta 2.0))))
   (if (<= beta 5e+134)
     (* (/ (+ 1.0 alpha) t_0) (/ (+ 1.0 beta) (* t_0 (+ alpha (+ beta 3.0)))))
     (/ (* (+ 1.0 alpha) (/ 1.0 beta)) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	double tmp;
	if (beta <= 5e+134) {
		tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
	} else {
		tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	double tmp;
	if (beta <= 5e+134) {
		tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
	} else {
		tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = alpha + (beta + 2.0)
	tmp = 0
	if beta <= 5e+134:
		tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))))
	else:
		tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(alpha + Float64(beta + 2.0))
	tmp = 0.0
	if (beta <= 5e+134)
		tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0)))));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / beta)) / t_0);
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	t_0 = alpha + (beta + 2.0);
	tmp = 0.0;
	if (beta <= 5e+134)
		tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
	else
		tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+134], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 4.99999999999999981e134

   1. Initial program 98.9%

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

   3. Simplified 98.2%

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

   if 4.99999999999999981e134 < beta

   1. Initial program 75.3%

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

   3. Simplified 97.8%

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

   5. Taylor expanded in beta around inf 89.4%

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

      1. associate-*l/ 89.5%

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

      2. +-commutative 89.5%

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

   7. Applied egg-rr 89.5%

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

4. Final simplification 97.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 5 \cdot 10^{+134}:\\ \;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{\alpha + \left(\beta + 2\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \alpha + \left(\beta + 2\right)\\ \left(\frac{1 + \beta}{t_0} \cdot \frac{1}{\alpha + \left(\beta + 3\right)}\right) \cdot \frac{1 + \alpha}{t_0} \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ alpha (+ beta 2.0))))
   (*
    (* (/ (+ 1.0 beta) t_0) (/ 1.0 (+ alpha (+ beta 3.0))))
    (/ (+ 1.0 alpha) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	return (((1.0 + beta) / t_0) * (1.0 / (alpha + (beta + 3.0)))) * ((1.0 + alpha) / t_0);
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	return (((1.0 + beta) / t_0) * (1.0 / (alpha + (beta + 3.0)))) * ((1.0 + alpha) / t_0);
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = alpha + (beta + 2.0)
	return (((1.0 + beta) / t_0) * (1.0 / (alpha + (beta + 3.0)))) * ((1.0 + alpha) / t_0)

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(alpha + Float64(beta + 2.0))
	return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(1.0 / Float64(alpha + Float64(beta + 3.0)))) * Float64(Float64(1.0 + alpha) / t_0))
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
	t_0 = alpha + (beta + 2.0);
	tmp = (((1.0 + beta) / t_0) * (1.0 / (alpha + (beta + 3.0)))) * ((1.0 + alpha) / t_0);
end

Wolfram

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

Derivation

1. Initial program 95.6%

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

3. Simplified 98.1%

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

   1. clear-num 98.1%

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

   2. associate-+r+ 98.1%

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

   3. *-commutative 98.1%

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

   4. frac-times 94.2%

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

   5. *-un-lft-identity 94.2%

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

   6. +-commutative 94.2%

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

   7. *-commutative 94.2%

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

   8. associate-+r+ 94.2%

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

6. Applied egg-rr 94.2%

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

   1. associate-/r* 98.2%

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

   2. associate-/l* 94.5%

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

   3. associate-*l/ 98.1%

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

   4. *-commutative 98.1%

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

   5. times-frac 99.8%

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

   6. associate-/r* 98.1%

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

   7. *-commutative 98.1%

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

   8. associate-/r* 99.8%

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

   9. +-commutative 99.8%

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

   10. +-commutative 99.8%

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

   11. +-commutative 99.8%

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

   12. +-commutative 99.8%

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

8. Simplified 99.8%

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

   1. div-inv 99.7%

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

   2. +-commutative 99.7%

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

   3. +-commutative 99.7%

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

10. Applied egg-rr 99.7%

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

11. Final simplification 99.7%

    \[\leadsto \left(\frac{1 + \beta}{\alpha + \left(\beta + 2\right)} \cdot \frac{1}{\alpha + \left(\beta + 3\right)}\right) \cdot \frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \]
12. Add Preprocessing

Alternative 3: 99.7% accurate, 1.4× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \alpha + \left(\beta + 2\right)\\ \frac{\frac{1 + \beta}{t_0}}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{t_0} \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ alpha (+ beta 2.0))))
   (* (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0))) (/ (+ 1.0 alpha) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = alpha + (beta + 2.0)
	return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0)

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(alpha + Float64(beta + 2.0))
	return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + alpha) / t_0))
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
	t_0 = alpha + (beta + 2.0);
	tmp = (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
end

Wolfram

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

Derivation

1. Initial program 95.6%

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

3. Simplified 98.1%

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

   1. clear-num 98.1%

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

   2. associate-+r+ 98.1%

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

   3. *-commutative 98.1%

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

   4. frac-times 94.2%

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

   5. *-un-lft-identity 94.2%

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

   6. +-commutative 94.2%

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

   7. *-commutative 94.2%

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

   8. associate-+r+ 94.2%

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

6. Applied egg-rr 94.2%

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

   1. associate-/r* 98.2%

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

   2. associate-/l* 94.5%

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

   3. associate-*l/ 98.1%

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

   4. *-commutative 98.1%

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

   5. times-frac 99.8%

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

   6. associate-/r* 98.1%

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

   7. *-commutative 98.1%

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

   8. associate-/r* 99.8%

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

   9. +-commutative 99.8%

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

   10. +-commutative 99.8%

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

   11. +-commutative 99.8%

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

   12. +-commutative 99.8%

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

8. Simplified 99.8%

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

9. Final simplification 99.8%

   \[\leadsto \frac{\frac{1 + \beta}{\alpha + \left(\beta + 2\right)}}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \]
10. Add Preprocessing

Alternative 4: 97.3% accurate, 2.1× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \alpha + \left(\beta + 2\right)\\ \mathbf{if}\;\beta \leq 6:\\ \;\;\;\;\frac{1 + \alpha}{t_0} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{t_0}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ alpha (+ beta 2.0))))
   (if (<= beta 6.0)
     (*
      (/ (+ 1.0 alpha) t_0)
      (+ 0.16666666666666666 (* alpha -0.1388888888888889)))
     (/ (* (+ 1.0 alpha) (/ 1.0 beta)) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	double tmp;
	if (beta <= 6.0) {
		tmp = ((1.0 + alpha) / t_0) * (0.16666666666666666 + (alpha * -0.1388888888888889));
	} else {
		tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: t_0
    real(8) :: tmp
    t_0 = alpha + (beta + 2.0d0)
    if (beta <= 6.0d0) then
        tmp = ((1.0d0 + alpha) / t_0) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
    else
        tmp = ((1.0d0 + alpha) * (1.0d0 / beta)) / t_0
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	double tmp;
	if (beta <= 6.0) {
		tmp = ((1.0 + alpha) / t_0) * (0.16666666666666666 + (alpha * -0.1388888888888889));
	} else {
		tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = alpha + (beta + 2.0)
	tmp = 0
	if beta <= 6.0:
		tmp = ((1.0 + alpha) / t_0) * (0.16666666666666666 + (alpha * -0.1388888888888889))
	else:
		tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(alpha + Float64(beta + 2.0))
	tmp = 0.0
	if (beta <= 6.0)
		tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889)));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / beta)) / t_0);
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	t_0 = alpha + (beta + 2.0);
	tmp = 0.0;
	if (beta <= 6.0)
		tmp = ((1.0 + alpha) / t_0) * (0.16666666666666666 + (alpha * -0.1388888888888889));
	else
		tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 6.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 6

   1. Initial program 99.8%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in beta around 0 98.8%

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

      1. +-commutative 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in alpha around 0 68.0%

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

      1. *-commutative 68.0%

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

   10. Simplified 68.0%

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

   if 6 < beta

   1. Initial program 84.3%

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

   3. Simplified 94.7%

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

   5. Taylor expanded in beta around inf 80.6%

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

      1. associate-*l/ 80.7%

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

      2. +-commutative 80.7%

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

   7. Applied egg-rr 80.7%

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

4. Final simplification 71.5%

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

Alternative 5: 98.4% accurate, 2.1× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 5 \cdot 10^{+17}:\\ \;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{\alpha + \left(\beta + 2\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 5e+17)
   (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))
   (/ (* (+ 1.0 alpha) (/ 1.0 beta)) (+ alpha (+ beta 2.0)))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 5e+17) {
		tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
	} else {
		tmp = ((1.0 + alpha) * (1.0 / beta)) / (alpha + (beta + 2.0));
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 5e+17) {
		tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
	} else {
		tmp = ((1.0 + alpha) * (1.0 / beta)) / (alpha + (beta + 2.0));
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 5e+17:
		tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0))
	else:
		tmp = ((1.0 + alpha) * (1.0 / beta)) / (alpha + (beta + 2.0))
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 5e+17)
		tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / beta)) / Float64(alpha + Float64(beta + 2.0)));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 5e+17)
		tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
	else
		tmp = ((1.0 + alpha) * (1.0 / beta)) / (alpha + (beta + 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 5e+17], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 5e17

   1. Initial program 99.8%

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

      1. associate-/l/ 99.4%

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

      2. +-commutative 99.4%

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

      3. +-commutative 99.4%

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

      4. associate-+r+ 99.4%

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

      5. *-commutative 99.4%

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

      6. metadata-eval 99.4%

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

      7. associate-+l+ 99.4%

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

      8. metadata-eval 99.4%

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

      9. associate-+l+ 99.4%

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

      10. metadata-eval 99.4%

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

      11. metadata-eval 99.4%

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

      12. associate-+l+ 99.4%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in alpha around 0 84.4%

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

   6. Taylor expanded in alpha around 0 69.3%

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

   if 5e17 < beta

   1. Initial program 83.8%

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

   3. Simplified 94.6%

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

   5. Taylor expanded in beta around inf 81.1%

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

      1. associate-*l/ 81.2%

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

      2. +-commutative 81.2%

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

   7. Applied egg-rr 81.2%

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

4. Final simplification 72.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 5 \cdot 10^{+17}:\\ \;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{\alpha + \left(\beta + 2\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 96.8% accurate, 2.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 6:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 6.0)
   (/ 1.0 (/ (+ beta 2.0) 0.16666666666666666))
   (* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (/ 1.0 beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 6.0:
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666)
	else:
		tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta)
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 6.0)
		tmp = Float64(1.0 / Float64(Float64(beta + 2.0) / 0.16666666666666666));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(1.0 / beta));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 6.0)
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	else
		tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] / 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 6

   1. Initial program 99.8%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in beta around 0 98.8%

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

      1. +-commutative 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in alpha around 0 68.3%

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

      1. clear-num 68.3%

         \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

      2. inv-pow 68.3%

         \[\leadsto \color{blue}{{\left(\frac{2 + \beta}{0.16666666666666666}\right)}^{-1}} \]

      3. +-commutative 68.3%

         \[\leadsto {\left(\frac{\color{blue}{\beta + 2}}{0.16666666666666666}\right)}^{-1} \]

   10. Applied egg-rr 68.3%

       \[\leadsto \color{blue}{{\left(\frac{\beta + 2}{0.16666666666666666}\right)}^{-1}} \]
   11. Step-by-step derivation

       1. unpow-1 68.3%

          \[\leadsto \color{blue}{\frac{1}{\frac{\beta + 2}{0.16666666666666666}}} \]

       2. +-commutative 68.3%

          \[\leadsto \frac{1}{\frac{\color{blue}{2 + \beta}}{0.16666666666666666}} \]

   12. Simplified 68.3%

       \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

   if 6 < beta

   1. Initial program 84.3%

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

   3. Simplified 94.7%

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

   5. Taylor expanded in beta around inf 80.6%

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

4. Final simplification 71.7%

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

Alternative 7: 96.9% accurate, 2.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 6:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{\alpha + \left(\beta + 2\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 6.0)
   (/ 1.0 (/ (+ beta 2.0) 0.16666666666666666))
   (/ (* (+ 1.0 alpha) (/ 1.0 beta)) (+ alpha (+ beta 2.0)))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = ((1.0 + alpha) * (1.0 / beta)) / (alpha + (beta + 2.0));
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = ((1.0 + alpha) * (1.0 / beta)) / (alpha + (beta + 2.0));
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 6.0:
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666)
	else:
		tmp = ((1.0 + alpha) * (1.0 / beta)) / (alpha + (beta + 2.0))
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 6.0)
		tmp = Float64(1.0 / Float64(Float64(beta + 2.0) / 0.16666666666666666));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / beta)) / Float64(alpha + Float64(beta + 2.0)));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 6.0)
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	else
		tmp = ((1.0 + alpha) * (1.0 / beta)) / (alpha + (beta + 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] / 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 6

   1. Initial program 99.8%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in beta around 0 98.8%

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

      1. +-commutative 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in alpha around 0 68.3%

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

      1. clear-num 68.3%

         \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

      2. inv-pow 68.3%

         \[\leadsto \color{blue}{{\left(\frac{2 + \beta}{0.16666666666666666}\right)}^{-1}} \]

      3. +-commutative 68.3%

         \[\leadsto {\left(\frac{\color{blue}{\beta + 2}}{0.16666666666666666}\right)}^{-1} \]

   10. Applied egg-rr 68.3%

       \[\leadsto \color{blue}{{\left(\frac{\beta + 2}{0.16666666666666666}\right)}^{-1}} \]
   11. Step-by-step derivation

       1. unpow-1 68.3%

          \[\leadsto \color{blue}{\frac{1}{\frac{\beta + 2}{0.16666666666666666}}} \]

       2. +-commutative 68.3%

          \[\leadsto \frac{1}{\frac{\color{blue}{2 + \beta}}{0.16666666666666666}} \]

   12. Simplified 68.3%

       \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

   if 6 < beta

   1. Initial program 84.3%

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

   3. Simplified 94.7%

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

   5. Taylor expanded in beta around inf 80.6%

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

      1. associate-*l/ 80.7%

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

      2. +-commutative 80.7%

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

   7. Applied egg-rr 80.7%

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

4. Final simplification 71.7%

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

Alternative 8: 96.8% accurate, 3.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 7.6:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta} \cdot \frac{1 + \alpha}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 7.6)
   (/ 1.0 (/ (+ beta 2.0) 0.16666666666666666))
   (* (/ 1.0 beta) (/ (+ 1.0 alpha) beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 7.6) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = (1.0 / beta) * ((1.0 + alpha) / beta);
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 7.6) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = (1.0 / beta) * ((1.0 + alpha) / beta);
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 7.6:
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666)
	else:
		tmp = (1.0 / beta) * ((1.0 + alpha) / beta)
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 7.6)
		tmp = Float64(1.0 / Float64(Float64(beta + 2.0) / 0.16666666666666666));
	else
		tmp = Float64(Float64(1.0 / beta) * Float64(Float64(1.0 + alpha) / beta));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 7.6)
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	else
		tmp = (1.0 / beta) * ((1.0 + alpha) / beta);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 7.6], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] / 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 7.5999999999999996

   1. Initial program 99.8%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in beta around 0 98.8%

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

      1. +-commutative 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in alpha around 0 68.3%

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

      1. clear-num 68.3%

         \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

      2. inv-pow 68.3%

         \[\leadsto \color{blue}{{\left(\frac{2 + \beta}{0.16666666666666666}\right)}^{-1}} \]

      3. +-commutative 68.3%

         \[\leadsto {\left(\frac{\color{blue}{\beta + 2}}{0.16666666666666666}\right)}^{-1} \]

   10. Applied egg-rr 68.3%

       \[\leadsto \color{blue}{{\left(\frac{\beta + 2}{0.16666666666666666}\right)}^{-1}} \]
   11. Step-by-step derivation

       1. unpow-1 68.3%

          \[\leadsto \color{blue}{\frac{1}{\frac{\beta + 2}{0.16666666666666666}}} \]

       2. +-commutative 68.3%

          \[\leadsto \frac{1}{\frac{\color{blue}{2 + \beta}}{0.16666666666666666}} \]

   12. Simplified 68.3%

       \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

   if 7.5999999999999996 < beta

   1. Initial program 84.3%

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

   3. Simplified 94.7%

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

   5. Taylor expanded in beta around inf 80.6%

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

   6. Taylor expanded in beta around inf 80.4%

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

4. Final simplification 71.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 7.6:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta} \cdot \frac{1 + \alpha}{\beta}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 90.9% accurate, 3.9× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 6:\\ \;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 6.0)
   (/ 0.16666666666666666 (+ beta 2.0))
   (/ 1.0 (* beta (+ beta 2.0)))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 0.16666666666666666 / (beta + 2.0);
	} else {
		tmp = 1.0 / (beta * (beta + 2.0));
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 0.16666666666666666 / (beta + 2.0);
	} else {
		tmp = 1.0 / (beta * (beta + 2.0));
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 6.0:
		tmp = 0.16666666666666666 / (beta + 2.0)
	else:
		tmp = 1.0 / (beta * (beta + 2.0))
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 6.0)
		tmp = Float64(0.16666666666666666 / Float64(beta + 2.0));
	else
		tmp = Float64(1.0 / Float64(beta * Float64(beta + 2.0)));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 6.0)
		tmp = 0.16666666666666666 / (beta + 2.0);
	else
		tmp = 1.0 / (beta * (beta + 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 6

   1. Initial program 99.8%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in beta around 0 98.8%

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

      1. +-commutative 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in alpha around 0 68.3%

      \[\leadsto \color{blue}{\frac{0.16666666666666666}{2 + \beta}} \]

   if 6 < beta

   1. Initial program 84.3%

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

   3. Simplified 94.7%

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

   5. Taylor expanded in beta around inf 80.6%

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

   6. Taylor expanded in alpha around 0 83.1%

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

4. Final simplification 72.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 6:\\ \;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 90.9% accurate, 3.9× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 6:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 6.0)
   (/ 1.0 (/ (+ beta 2.0) 0.16666666666666666))
   (/ 1.0 (* beta (+ beta 2.0)))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = 1.0 / (beta * (beta + 2.0));
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = 1.0 / (beta * (beta + 2.0));
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 6.0:
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666)
	else:
		tmp = 1.0 / (beta * (beta + 2.0))
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 6.0)
		tmp = Float64(1.0 / Float64(Float64(beta + 2.0) / 0.16666666666666666));
	else
		tmp = Float64(1.0 / Float64(beta * Float64(beta + 2.0)));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 6.0)
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	else
		tmp = 1.0 / (beta * (beta + 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] / 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 6

   1. Initial program 99.8%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in beta around 0 98.8%

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

      1. +-commutative 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in alpha around 0 68.3%

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

      1. clear-num 68.3%

         \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

      2. inv-pow 68.3%

         \[\leadsto \color{blue}{{\left(\frac{2 + \beta}{0.16666666666666666}\right)}^{-1}} \]

      3. +-commutative 68.3%

         \[\leadsto {\left(\frac{\color{blue}{\beta + 2}}{0.16666666666666666}\right)}^{-1} \]

   10. Applied egg-rr 68.3%

       \[\leadsto \color{blue}{{\left(\frac{\beta + 2}{0.16666666666666666}\right)}^{-1}} \]
   11. Step-by-step derivation

       1. unpow-1 68.3%

          \[\leadsto \color{blue}{\frac{1}{\frac{\beta + 2}{0.16666666666666666}}} \]

       2. +-commutative 68.3%

          \[\leadsto \frac{1}{\frac{\color{blue}{2 + \beta}}{0.16666666666666666}} \]

   12. Simplified 68.3%

       \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

   if 6 < beta

   1. Initial program 84.3%

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

   3. Simplified 94.7%

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

   5. Taylor expanded in beta around inf 80.6%

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

   6. Taylor expanded in alpha around 0 83.1%

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

4. Final simplification 72.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 6:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 91.3% accurate, 3.9× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 6:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{\beta}}{\beta + 2}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 6.0)
   (/ 1.0 (/ (+ beta 2.0) 0.16666666666666666))
   (/ (/ 1.0 beta) (+ beta 2.0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = (1.0 / beta) / (beta + 2.0);
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 6.0d0) then
        tmp = 1.0d0 / ((beta + 2.0d0) / 0.16666666666666666d0)
    else
        tmp = (1.0d0 / beta) / (beta + 2.0d0)
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.0) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = (1.0 / beta) / (beta + 2.0);
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 6.0:
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666)
	else:
		tmp = (1.0 / beta) / (beta + 2.0)
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 6.0)
		tmp = Float64(1.0 / Float64(Float64(beta + 2.0) / 0.16666666666666666));
	else
		tmp = Float64(Float64(1.0 / beta) / Float64(beta + 2.0));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 6.0)
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	else
		tmp = (1.0 / beta) / (beta + 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] / 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 6

   1. Initial program 99.8%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in beta around 0 98.8%

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

      1. +-commutative 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in alpha around 0 68.3%

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

      1. clear-num 68.3%

         \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

      2. inv-pow 68.3%

         \[\leadsto \color{blue}{{\left(\frac{2 + \beta}{0.16666666666666666}\right)}^{-1}} \]

      3. +-commutative 68.3%

         \[\leadsto {\left(\frac{\color{blue}{\beta + 2}}{0.16666666666666666}\right)}^{-1} \]

   10. Applied egg-rr 68.3%

       \[\leadsto \color{blue}{{\left(\frac{\beta + 2}{0.16666666666666666}\right)}^{-1}} \]
   11. Step-by-step derivation

       1. unpow-1 68.3%

          \[\leadsto \color{blue}{\frac{1}{\frac{\beta + 2}{0.16666666666666666}}} \]

       2. +-commutative 68.3%

          \[\leadsto \frac{1}{\frac{\color{blue}{2 + \beta}}{0.16666666666666666}} \]

   12. Simplified 68.3%

       \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

   if 6 < beta

   1. Initial program 84.3%

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

   3. Simplified 94.7%

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

   5. Taylor expanded in beta around inf 80.6%

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

      1. expm1-log1p-u 80.6%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)} \cdot \frac{1}{\beta}\right)\right)} \]

      2. expm1-udef 51.8%

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

      3. un-div-inv 51.8%

         \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}}{\beta}}\right)} - 1 \]

      4. +-commutative 51.8%

         \[\leadsto e^{\mathsf{log1p}\left(\frac{\frac{\color{blue}{1 + \alpha}}{\alpha + \left(\beta + 2\right)}}{\beta}\right)} - 1 \]

   7. Applied egg-rr 51.8%

      \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)}}{\beta}\right)} - 1} \]
   8. Step-by-step derivation

      1. expm1-def 80.7%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)}}{\beta}\right)\right)} \]

      2. expm1-log1p 80.7%

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

      3. associate-/l/ 86.6%

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

      4. +-commutative 86.6%

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

   9. Simplified 86.6%

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

   10. Taylor expanded in alpha around 0 83.1%

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

       1. associate-/r* 82.4%

          \[\leadsto \color{blue}{\frac{\frac{1}{\beta}}{2 + \beta}} \]

   12. Simplified 82.4%

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

4. Final simplification 72.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 6:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{\beta}}{\beta + 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 91.3% accurate, 3.9× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 5.2:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 5.2)
   (/ 1.0 (/ (+ beta 2.0) 0.16666666666666666))
   (/ (/ 1.0 beta) (+ beta 3.0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 5.2) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = (1.0 / beta) / (beta + 3.0);
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 5.2d0) then
        tmp = 1.0d0 / ((beta + 2.0d0) / 0.16666666666666666d0)
    else
        tmp = (1.0d0 / beta) / (beta + 3.0d0)
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 5.2) {
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	} else {
		tmp = (1.0 / beta) / (beta + 3.0);
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 5.2:
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666)
	else:
		tmp = (1.0 / beta) / (beta + 3.0)
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 5.2)
		tmp = Float64(1.0 / Float64(Float64(beta + 2.0) / 0.16666666666666666));
	else
		tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 5.2)
		tmp = 1.0 / ((beta + 2.0) / 0.16666666666666666);
	else
		tmp = (1.0 / beta) / (beta + 3.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 5.2], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] / 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 5.20000000000000018

   1. Initial program 99.8%

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

   3. Simplified 99.4%

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

   5. Taylor expanded in beta around 0 98.8%

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

      1. +-commutative 98.8%

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

   7. Simplified 98.8%

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

   8. Taylor expanded in alpha around 0 68.3%

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

      1. clear-num 68.3%

         \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

      2. inv-pow 68.3%

         \[\leadsto \color{blue}{{\left(\frac{2 + \beta}{0.16666666666666666}\right)}^{-1}} \]

      3. +-commutative 68.3%

         \[\leadsto {\left(\frac{\color{blue}{\beta + 2}}{0.16666666666666666}\right)}^{-1} \]

   10. Applied egg-rr 68.3%

       \[\leadsto \color{blue}{{\left(\frac{\beta + 2}{0.16666666666666666}\right)}^{-1}} \]
   11. Step-by-step derivation

       1. unpow-1 68.3%

          \[\leadsto \color{blue}{\frac{1}{\frac{\beta + 2}{0.16666666666666666}}} \]

       2. +-commutative 68.3%

          \[\leadsto \frac{1}{\frac{\color{blue}{2 + \beta}}{0.16666666666666666}} \]

   12. Simplified 68.3%

       \[\leadsto \color{blue}{\frac{1}{\frac{2 + \beta}{0.16666666666666666}}} \]

   if 5.20000000000000018 < beta

   1. Initial program 84.3%

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

      1. associate-/l/ 81.5%

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

      2. +-commutative 81.5%

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

      3. +-commutative 81.5%

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

      4. associate-+r+ 81.5%

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

      5. *-commutative 81.5%

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

      6. metadata-eval 81.5%

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

      7. associate-+l+ 81.5%

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

      8. metadata-eval 81.5%

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

      9. associate-+l+ 81.5%

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

      10. metadata-eval 81.5%

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

      11. metadata-eval 81.5%

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

      12. associate-+l+ 81.5%

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

   3. Simplified 81.5%

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

   5. Taylor expanded in beta around -inf 91.0%

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

   6. Taylor expanded in alpha around 0 83.2%

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

      1. associate-/r* 82.5%

         \[\leadsto \color{blue}{\frac{\frac{1}{2 + \beta}}{3 + \beta}} \]

   8. Simplified 82.5%

      \[\leadsto \color{blue}{\frac{\frac{1}{2 + \beta}}{3 + \beta}} \]

   9. Taylor expanded in beta around inf 82.5%

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

4. Final simplification 72.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 5.2:\\ \;\;\;\;\frac{1}{\frac{\beta + 2}{0.16666666666666666}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 47.4% accurate, 7.0× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \frac{0.16666666666666666}{\beta + 2} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	return 0.16666666666666666 / (beta + 2.0);
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	return 0.16666666666666666 / (beta + 2.0);
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	return 0.16666666666666666 / (beta + 2.0)

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	return Float64(0.16666666666666666 / Float64(beta + 2.0))
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
	tmp = 0.16666666666666666 / (beta + 2.0);
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 95.6%

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

3. Simplified 98.1%

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

5. Taylor expanded in beta around 0 78.1%

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

   1. +-commutative 78.1%

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

7. Simplified 78.1%

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

8. Taylor expanded in alpha around 0 51.5%

   \[\leadsto \color{blue}{\frac{0.16666666666666666}{2 + \beta}} \]

9. Final simplification 51.5%

   \[\leadsto \frac{0.16666666666666666}{\beta + 2} \]
10. Add Preprocessing

Alternative 14: 45.7% accurate, 35.0× speedup

Math

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

FPCore

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	return 0.08333333333333333;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	return 0.08333333333333333;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.6%

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

3. Simplified 98.1%

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

5. Taylor expanded in beta around 0 78.1%

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

   1. +-commutative 78.1%

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

7. Simplified 78.1%

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

8. Taylor expanded in alpha around 0 51.5%

   \[\leadsto \color{blue}{\frac{0.16666666666666666}{2 + \beta}} \]

9. Taylor expanded in beta around 0 50.7%

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

10. Final simplification 50.7%

    \[\leadsto 0.08333333333333333 \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2024013 
(FPCore (alpha beta)
  :name "Octave 3.8, jcobi/3"
  :precision binary64
  :pre (and (> alpha -1.0) (> beta -1.0))
  (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ (+ alpha beta) (* 2.0 1.0)) 1.0)))