Octave 3.8, jcobi/3

Percentage Accurate: 94.1% → 99.6%

Time: 10.4s

Alternatives: 21

Speedup: 2.6×

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.1% 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.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 2\\ t_1 := \left(\beta + \alpha\right) + 3\\ \mathbf{if}\;\alpha \leq 10^{-13}:\\ \;\;\;\;{t\_0}^{-2} \cdot {\left(\frac{t\_1}{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) - -1}\right)}^{-1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\frac{\alpha}{\beta} + \left(\left(\frac{1}{\beta} + \alpha\right) + 1\right)\right) - \frac{2 + \alpha}{\beta} \cdot \left(\alpha - -1\right)}{t\_1}}{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 (+ (+ beta alpha) 2.0)) (t_1 (+ (+ beta alpha) 3.0)))
   (if (<= alpha 1e-13)
     (*
      (pow t_0 -2.0)
      (pow (/ t_1 (- (fma beta alpha (+ beta alpha)) -1.0)) -1.0))
     (/
      (/
       (-
        (+ (/ alpha beta) (+ (+ (/ 1.0 beta) alpha) 1.0))
        (* (/ (+ 2.0 alpha) beta) (- alpha -1.0)))
       t_1)
      t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 2.0;
	double t_1 = (beta + alpha) + 3.0;
	double tmp;
	if (alpha <= 1e-13) {
		tmp = pow(t_0, -2.0) * pow((t_1 / (fma(beta, alpha, (beta + alpha)) - -1.0)), -1.0);
	} else {
		tmp = ((((alpha / beta) + (((1.0 / beta) + alpha) + 1.0)) - (((2.0 + alpha) / beta) * (alpha - -1.0))) / t_1) / t_0;
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(beta + alpha) + 2.0)
	t_1 = Float64(Float64(beta + alpha) + 3.0)
	tmp = 0.0
	if (alpha <= 1e-13)
		tmp = Float64((t_0 ^ -2.0) * (Float64(t_1 / Float64(fma(beta, alpha, Float64(beta + alpha)) - -1.0)) ^ -1.0));
	else
		tmp = Float64(Float64(Float64(Float64(Float64(alpha / beta) + Float64(Float64(Float64(1.0 / beta) + alpha) + 1.0)) - Float64(Float64(Float64(2.0 + alpha) / beta) * Float64(alpha - -1.0))) / t_1) / t_0);
	end
	return 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, If[LessEqual[alpha, 1e-13], N[(N[Power[t$95$0, -2.0], $MachinePrecision] * N[Power[N[(t$95$1 / N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(alpha / beta), $MachinePrecision] + N[(N[(N[(1.0 / beta), $MachinePrecision] + alpha), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(2.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(alpha - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1e-13

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. clear-num N/A

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

      3. inv-pow N/A

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

      4. lift-/.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. associate-/l/ N/A

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

      7. associate-/r/ N/A

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

   4. Applied rewrites 99.9%

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

   if 1e-13 < alpha

   1. Initial program 78.7%

      \[\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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 78.7%

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

   5. Taylor expanded in beta around inf

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

      1. lower--.f64 N/A

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

      2. associate-+r+ N/A

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

      3. associate-+r+ N/A

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

      4. lower-+.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. associate-/l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 22.6

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

   7. Applied rewrites 22.6%

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

4. Final simplification 68.8%

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

Alternative 2: 97.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 2\\ \mathbf{if}\;\alpha \leq 1.1 \cdot 10^{-136}:\\ \;\;\;\;\frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) - -1}{t\_0}}{t\_0}}{\left(\left(\beta + \alpha\right) - -1\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\frac{\alpha}{\beta} + \left(\left(\frac{1}{\beta} + \alpha\right) + 1\right)\right) - \frac{2 + \alpha}{\beta} \cdot \left(\alpha - -1\right)}{\left(\beta + \alpha\right) + 3}}{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 (+ (+ beta alpha) 2.0)))
   (if (<= alpha 1.1e-136)
     (/
      (/ (/ (- (+ (* beta alpha) (+ beta alpha)) -1.0) t_0) t_0)
      (+ (- (+ beta alpha) -1.0) 2.0))
     (/
      (/
       (-
        (+ (/ alpha beta) (+ (+ (/ 1.0 beta) alpha) 1.0))
        (* (/ (+ 2.0 alpha) beta) (- alpha -1.0)))
       (+ (+ beta alpha) 3.0))
      t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 2.0;
	double tmp;
	if (alpha <= 1.1e-136) {
		tmp = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (((beta + alpha) - -1.0) + 2.0);
	} else {
		tmp = ((((alpha / beta) + (((1.0 / beta) + alpha) + 1.0)) - (((2.0 + alpha) / beta) * (alpha - -1.0))) / ((beta + alpha) + 3.0)) / 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 = (beta + alpha) + 2.0d0
    if (alpha <= 1.1d-136) then
        tmp = (((((beta * alpha) + (beta + alpha)) - (-1.0d0)) / t_0) / t_0) / (((beta + alpha) - (-1.0d0)) + 2.0d0)
    else
        tmp = ((((alpha / beta) + (((1.0d0 / beta) + alpha) + 1.0d0)) - (((2.0d0 + alpha) / beta) * (alpha - (-1.0d0)))) / ((beta + alpha) + 3.0d0)) / t_0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	t_0 = (beta + alpha) + 2.0;
	tmp = 0.0;
	if (alpha <= 1.1e-136)
		tmp = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (((beta + alpha) - -1.0) + 2.0);
	else
		tmp = ((((alpha / beta) + (((1.0 / beta) + alpha) + 1.0)) - (((2.0 + alpha) / beta) * (alpha - -1.0))) / ((beta + alpha) + 3.0)) / 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[alpha, 1.1e-136], N[(N[(N[(N[(N[(N[(beta * alpha), $MachinePrecision] + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(N[(beta + alpha), $MachinePrecision] - -1.0), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(alpha / beta), $MachinePrecision] + N[(N[(N[(1.0 / beta), $MachinePrecision] + alpha), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(2.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(alpha - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.1000000000000001e-136

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-+.f64 N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 99.9

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 99.9

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

      10. lift-*.f64 N/A

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

      11. metadata-eval 99.9

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

   4. Applied rewrites 99.9%

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

   if 1.1000000000000001e-136 < alpha

   1. Initial program 83.0%

      \[\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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 83.0%

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

   5. Taylor expanded in beta around inf

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

      1. lower--.f64 N/A

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

      2. associate-+r+ N/A

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

      3. associate-+r+ N/A

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

      4. lower-+.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. associate-/l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 23.3

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

   7. Applied rewrites 23.3%

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

4. Final simplification 61.3%

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

Alternative 3: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 2\\ \mathbf{if}\;\beta \leq 2 \cdot 10^{+156}:\\ \;\;\;\;\frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) - -1}{t\_0}}{t\_0}}{\left(\left(\beta + \alpha\right) - -1\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\frac{1}{\beta} - -1\right) \cdot \alpha - \frac{\mathsf{fma}\left(2, \alpha, 4\right)}{\beta} \cdot \left(\alpha - -1\right)}{\beta}}{t\_0 + 1}\\ \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 (+ (+ beta alpha) 2.0)))
   (if (<= beta 2e+156)
     (/
      (/ (/ (- (+ (* beta alpha) (+ beta alpha)) -1.0) t_0) t_0)
      (+ (- (+ beta alpha) -1.0) 2.0))
     (/
      (/
       (-
        (* (- (/ 1.0 beta) -1.0) alpha)
        (* (/ (fma 2.0 alpha 4.0) beta) (- alpha -1.0)))
       beta)
      (+ t_0 1.0)))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 2.0;
	double tmp;
	if (beta <= 2e+156) {
		tmp = (((((beta * alpha) + (beta + alpha)) - -1.0) / t_0) / t_0) / (((beta + alpha) - -1.0) + 2.0);
	} else {
		tmp = (((((1.0 / beta) - -1.0) * alpha) - ((fma(2.0, alpha, 4.0) / beta) * (alpha - -1.0))) / beta) / (t_0 + 1.0);
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(beta + alpha) + 2.0)
	tmp = 0.0
	if (beta <= 2e+156)
		tmp = Float64(Float64(Float64(Float64(Float64(Float64(beta * alpha) + Float64(beta + alpha)) - -1.0) / t_0) / t_0) / Float64(Float64(Float64(beta + alpha) - -1.0) + 2.0));
	else
		tmp = Float64(Float64(Float64(Float64(Float64(Float64(1.0 / beta) - -1.0) * alpha) - Float64(Float64(fma(2.0, alpha, 4.0) / beta) * Float64(alpha - -1.0))) / beta) / Float64(t_0 + 1.0));
	end
	return 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 2e+156], N[(N[(N[(N[(N[(N[(beta * alpha), $MachinePrecision] + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(N[(beta + alpha), $MachinePrecision] - -1.0), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(N[(1.0 / beta), $MachinePrecision] - -1.0), $MachinePrecision] * alpha), $MachinePrecision] - N[(N[(N[(2.0 * alpha + 4.0), $MachinePrecision] / beta), $MachinePrecision] * N[(alpha - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 2e156

   1. Initial program 96.7%

      \[\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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-+.f64 N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 96.7

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 96.7

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

      10. lift-*.f64 N/A

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

      11. metadata-eval 96.7

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

   4. Applied rewrites 96.7%

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

   if 2e156 < beta

   1. Initial program 59.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 N/A

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

      3. associate-+r+ N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-/l* N/A

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

      11. lower-*.f64 N/A

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

      12. lower-+.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-fma.f64 91.9

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

   5. Applied rewrites 91.9%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 91.9%

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

4. Final simplification 96.0%

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

Alternative 4: 99.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 3\\ t_1 := \left(\beta + \alpha\right) + 2\\ \mathbf{if}\;\beta \leq 3 \cdot 10^{+115}:\\ \;\;\;\;\frac{\frac{\frac{\left(-1 - \beta\right) \cdot \left(-1 - \alpha\right)}{t\_1}}{t\_0}}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \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 (+ (+ beta alpha) 3.0)) (t_1 (+ (+ beta alpha) 2.0)))
   (if (<= beta 3e+115)
     (/ (/ (/ (* (- -1.0 beta) (- -1.0 alpha)) t_1) t_0) t_1)
     (/ (/ (- alpha -1.0) (+ (+ 2.0 beta) alpha)) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 3.0;
	double t_1 = (beta + alpha) + 2.0;
	double tmp;
	if (beta <= 3e+115) {
		tmp = ((((-1.0 - beta) * (-1.0 - alpha)) / t_1) / t_0) / t_1;
	} else {
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / 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) :: t_1
    real(8) :: tmp
    t_0 = (beta + alpha) + 3.0d0
    t_1 = (beta + alpha) + 2.0d0
    if (beta <= 3d+115) then
        tmp = (((((-1.0d0) - beta) * ((-1.0d0) - alpha)) / t_1) / t_0) / t_1
    else
        tmp = ((alpha - (-1.0d0)) / ((2.0d0 + beta) + alpha)) / t_0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	t_0 = (beta + alpha) + 3.0;
	t_1 = (beta + alpha) + 2.0;
	tmp = 0.0;
	if (beta <= 3e+115)
		tmp = ((((-1.0 - beta) * (-1.0 - alpha)) / t_1) / t_0) / t_1;
	else
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / 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[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 3e+115], N[(N[(N[(N[(N[(-1.0 - beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if beta < 3e115

   1. Initial program 97.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 97.9%

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

   5. Taylor expanded in alpha around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 97.9

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

   7. Applied rewrites 97.9%

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

   if 3e115 < beta

   1. Initial program 66.4%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. metadata-eval N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 88.8

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

   5. Applied rewrites 88.8%

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

   7. Applied rewrites 88.8%

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

4. Final simplification 96.0%

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

Alternative 5: 99.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(2 + \beta\right) + \alpha\\ \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+115}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(\alpha - -1, \beta, \alpha - -1\right)}{t\_0 \cdot t\_0}}{\left(\left(\beta + \alpha\right) - -1\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{t\_0}}{\left(\beta + \alpha\right) + 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
 (let* ((t_0 (+ (+ 2.0 beta) alpha)))
   (if (<= beta 2.8e+115)
     (/
      (/ (fma (- alpha -1.0) beta (- alpha -1.0)) (* t_0 t_0))
      (+ (- (+ beta alpha) -1.0) 2.0))
     (/ (/ (- alpha -1.0) t_0) (+ (+ beta alpha) 3.0)))))

C

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(2.0 + beta) + alpha)
	tmp = 0.0
	if (beta <= 2.8e+115)
		tmp = Float64(Float64(fma(Float64(alpha - -1.0), beta, Float64(alpha - -1.0)) / Float64(t_0 * t_0)) / Float64(Float64(Float64(beta + alpha) - -1.0) + 2.0));
	else
		tmp = Float64(Float64(Float64(alpha - -1.0) / t_0) / Float64(Float64(beta + alpha) + 3.0));
	end
	return 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[(N[(2.0 + beta), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 2.8e+115], N[(N[(N[(N[(alpha - -1.0), $MachinePrecision] * beta + N[(alpha - -1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + alpha), $MachinePrecision] - -1.0), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.8e115

   1. Initial program 97.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-+.f64 N/A

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

      4. associate-+r+ N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 97.9

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 97.9

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

      10. lift-*.f64 N/A

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

      11. metadata-eval 97.9

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

   4. Applied rewrites 97.9%

      \[\leadsto \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}}{\color{blue}{\left(1 + \left(\beta + \alpha\right)\right) + 2}} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. frac-2neg N/A

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

      4. associate-/l/ N/A

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

      5. lower-/.f64 N/A

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

   6. Applied rewrites 97.3%

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

   if 2.8e115 < beta

   1. Initial program 66.4%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. metadata-eval N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 88.8

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

   5. Applied rewrites 88.8%

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

   7. Applied rewrites 88.8%

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

4. Final simplification 95.5%

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

Alternative 6: 99.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 3\\ t_1 := \left(2 + \alpha\right) + \beta\\ \mathbf{if}\;\beta \leq 10^{+116}:\\ \;\;\;\;\frac{\frac{\left(-1 - \beta\right) \cdot \left(-1 - \alpha\right)}{t\_1}}{t\_1 \cdot t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \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 (+ (+ beta alpha) 3.0)) (t_1 (+ (+ 2.0 alpha) beta)))
   (if (<= beta 1e+116)
     (/ (/ (* (- -1.0 beta) (- -1.0 alpha)) t_1) (* t_1 t_0))
     (/ (/ (- alpha -1.0) (+ (+ 2.0 beta) alpha)) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 3.0;
	double t_1 = (2.0 + alpha) + beta;
	double tmp;
	if (beta <= 1e+116) {
		tmp = (((-1.0 - beta) * (-1.0 - alpha)) / t_1) / (t_1 * t_0);
	} else {
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / 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) :: t_1
    real(8) :: tmp
    t_0 = (beta + alpha) + 3.0d0
    t_1 = (2.0d0 + alpha) + beta
    if (beta <= 1d+116) then
        tmp = ((((-1.0d0) - beta) * ((-1.0d0) - alpha)) / t_1) / (t_1 * t_0)
    else
        tmp = ((alpha - (-1.0d0)) / ((2.0d0 + beta) + alpha)) / t_0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	t_0 = (beta + alpha) + 3.0;
	t_1 = (2.0 + alpha) + beta;
	tmp = 0.0;
	if (beta <= 1e+116)
		tmp = (((-1.0 - beta) * (-1.0 - alpha)) / t_1) / (t_1 * t_0);
	else
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / 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[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 + alpha), $MachinePrecision] + beta), $MachinePrecision]}, If[LessEqual[beta, 1e+116], N[(N[(N[(N[(-1.0 - beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.00000000000000002e116

   1. Initial program 97.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 97.9%

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

   5. Taylor expanded in alpha around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 97.9

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

   7. Applied rewrites 97.9%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   9. Applied rewrites 97.9%

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

       1. lift-/.f64 N/A

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

       2. lift-/.f64 N/A

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

       3. associate-/l/ N/A

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

       4. lift-+.f64 N/A

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

       5. +-commutative N/A

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

       6. lift-+.f64 N/A

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

       7. lift-+.f64 N/A

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

       8. +-commutative N/A

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

       9. lift-+.f64 N/A

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

       10. +-commutative N/A

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

       11. lift-+.f64 N/A

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

       12. lift-+.f64 N/A

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

       13. lift-*.f64 N/A

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

       14. lower-/.f64 97.2

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

   11. Applied rewrites 97.2%

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

   if 1.00000000000000002e116 < beta

   1. Initial program 66.4%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. metadata-eval N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 88.8

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

   5. Applied rewrites 88.8%

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

   7. Applied rewrites 88.8%

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

4. Final simplification 95.5%

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

Alternative 7: 99.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 3\\ t_1 := \left(\beta + \alpha\right) + 2\\ \mathbf{if}\;\beta \leq 6.1 \cdot 10^{+32}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) - -1}{\left(t\_1 \cdot t\_0\right) \cdot t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \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 (+ (+ beta alpha) 3.0)) (t_1 (+ (+ beta alpha) 2.0)))
   (if (<= beta 6.1e+32)
     (/ (- (fma beta alpha (+ beta alpha)) -1.0) (* (* t_1 t_0) t_1))
     (/ (/ (- alpha -1.0) (+ (+ 2.0 beta) alpha)) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 3.0;
	double t_1 = (beta + alpha) + 2.0;
	double tmp;
	if (beta <= 6.1e+32) {
		tmp = (fma(beta, alpha, (beta + alpha)) - -1.0) / ((t_1 * t_0) * t_1);
	} else {
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / t_0;
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(beta + alpha) + 3.0)
	t_1 = Float64(Float64(beta + alpha) + 2.0)
	tmp = 0.0
	if (beta <= 6.1e+32)
		tmp = Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) - -1.0) / Float64(Float64(t_1 * t_0) * t_1));
	else
		tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(2.0 + beta) + alpha)) / t_0);
	end
	return 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[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 6.1e+32], N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] - -1.0), $MachinePrecision] / N[(N[(t$95$1 * t$95$0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if beta < 6.10000000000000027e32

   1. Initial program 99.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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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)} \]

      5. associate-/l/ N/A

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

      6. lower-/.f64 N/A

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

   4. Applied rewrites 92.5%

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

   if 6.10000000000000027e32 < beta

   1. Initial program 71.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. metadata-eval N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 84.7

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

   5. Applied rewrites 84.7%

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

   7. Applied rewrites 84.7%

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

4. Final simplification 90.3%

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

Alternative 8: 99.4% accurate, 1.5× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 3\\ t_1 := \left(2 + \alpha\right) + \beta\\ \mathbf{if}\;\beta \leq 6.1 \cdot 10^{+32}:\\ \;\;\;\;\frac{\left(-1 - \beta\right) \cdot \left(-1 - \alpha\right)}{\left(t\_1 \cdot t\_0\right) \cdot t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \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 (+ (+ beta alpha) 3.0)) (t_1 (+ (+ 2.0 alpha) beta)))
   (if (<= beta 6.1e+32)
     (/ (* (- -1.0 beta) (- -1.0 alpha)) (* (* t_1 t_0) t_1))
     (/ (/ (- alpha -1.0) (+ (+ 2.0 beta) alpha)) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 3.0;
	double t_1 = (2.0 + alpha) + beta;
	double tmp;
	if (beta <= 6.1e+32) {
		tmp = ((-1.0 - beta) * (-1.0 - alpha)) / ((t_1 * t_0) * t_1);
	} else {
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / 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) :: t_1
    real(8) :: tmp
    t_0 = (beta + alpha) + 3.0d0
    t_1 = (2.0d0 + alpha) + beta
    if (beta <= 6.1d+32) then
        tmp = (((-1.0d0) - beta) * ((-1.0d0) - alpha)) / ((t_1 * t_0) * t_1)
    else
        tmp = ((alpha - (-1.0d0)) / ((2.0d0 + beta) + alpha)) / t_0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	t_0 = (beta + alpha) + 3.0;
	t_1 = (2.0 + alpha) + beta;
	tmp = 0.0;
	if (beta <= 6.1e+32)
		tmp = ((-1.0 - beta) * (-1.0 - alpha)) / ((t_1 * t_0) * t_1);
	else
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / 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[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 + alpha), $MachinePrecision] + beta), $MachinePrecision]}, If[LessEqual[beta, 6.1e+32], N[(N[(N[(-1.0 - beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$1 * t$95$0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if beta < 6.10000000000000027e32

   1. Initial program 99.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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.3%

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

   5. Taylor expanded in alpha around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 99.3

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

   7. Applied rewrites 99.3%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   9. Applied rewrites 99.3%

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

   11. Applied rewrites 92.5%

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

   if 6.10000000000000027e32 < beta

   1. Initial program 71.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. metadata-eval N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 84.7

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

   5. Applied rewrites 84.7%

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

   7. Applied rewrites 84.7%

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

4. Final simplification 90.3%

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

Alternative 9: 99.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 2\\ \mathbf{if}\;\beta \leq 1.25 \cdot 10^{-12}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(3 + \alpha\right) \cdot \left(2 + \alpha\right)}}{t\_0}\\ \mathbf{elif}\;\beta \leq 7 \cdot 10^{+14}:\\ \;\;\;\;\frac{\frac{\beta - -1}{\mathsf{fma}\left(5 + \beta, \beta, 6\right)}}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \alpha}}{\left(\beta + \alpha\right) + 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
 (let* ((t_0 (+ (+ beta alpha) 2.0)))
   (if (<= beta 1.25e-12)
     (/ (/ (- alpha -1.0) (* (+ 3.0 alpha) (+ 2.0 alpha))) t_0)
     (if (<= beta 7e+14)
       (/ (/ (- beta -1.0) (fma (+ 5.0 beta) beta 6.0)) t_0)
       (/ (/ (- alpha -1.0) (+ (+ 2.0 beta) alpha)) (+ (+ beta alpha) 3.0))))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 2.0;
	double tmp;
	if (beta <= 1.25e-12) {
		tmp = ((alpha - -1.0) / ((3.0 + alpha) * (2.0 + alpha))) / t_0;
	} else if (beta <= 7e+14) {
		tmp = ((beta - -1.0) / fma((5.0 + beta), beta, 6.0)) / t_0;
	} else {
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / ((beta + alpha) + 3.0);
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(beta + alpha) + 2.0)
	tmp = 0.0
	if (beta <= 1.25e-12)
		tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(3.0 + alpha) * Float64(2.0 + alpha))) / t_0);
	elseif (beta <= 7e+14)
		tmp = Float64(Float64(Float64(beta - -1.0) / fma(Float64(5.0 + beta), beta, 6.0)) / t_0);
	else
		tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(2.0 + beta) + alpha)) / Float64(Float64(beta + alpha) + 3.0));
	end
	return 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 1.25e-12], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(3.0 + alpha), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[beta, 7e+14], N[(N[(N[(beta - -1.0), $MachinePrecision] / N[(N[(5.0 + beta), $MachinePrecision] * beta + 6.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if beta < 1.24999999999999992e-12

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in beta around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 97.6

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

   7. Applied rewrites 97.6%

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

   if 1.24999999999999992e-12 < beta < 7e14

   1. Initial program 99.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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 52.4

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

   7. Applied rewrites 52.4%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 52.6%

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

   if 7e14 < beta

   1. Initial program 71.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. Add Preprocessing

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. metadata-eval N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 81.9

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

   5. Applied rewrites 81.9%

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

   7. Applied rewrites 81.9%

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

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.25 \cdot 10^{-12}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(3 + \alpha\right) \cdot \left(2 + \alpha\right)}}{\left(\beta + \alpha\right) + 2}\\ \mathbf{elif}\;\beta \leq 7 \cdot 10^{+14}:\\ \;\;\;\;\frac{\frac{\beta - -1}{\mathsf{fma}\left(5 + \beta, \beta, 6\right)}}{\left(\beta + \alpha\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \alpha}}{\left(\beta + \alpha\right) + 3}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 98.5% accurate, 1.8× speedup

Math

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 7e+14) {
		tmp = ((beta - -1.0) / fma((5.0 + beta), beta, 6.0)) / ((beta + alpha) + 2.0);
	} else {
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / ((beta + alpha) + 3.0);
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 7e+14)
		tmp = Float64(Float64(Float64(beta - -1.0) / fma(Float64(5.0 + beta), beta, 6.0)) / Float64(Float64(beta + alpha) + 2.0));
	else
		tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(2.0 + beta) + alpha)) / Float64(Float64(beta + alpha) + 3.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 7e14

   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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.4

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

   7. Applied rewrites 64.4%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 64.4%

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

   if 7e14 < beta

   1. Initial program 71.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. Add Preprocessing

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. metadata-eval N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 81.9

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

   5. Applied rewrites 81.9%

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

   7. Applied rewrites 81.9%

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

4. Final simplification 69.6%

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

Alternative 11: 97.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.52:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \alpha}}{\left(\beta + \alpha\right) + 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 1.52)
   (/
    (fma
     (fma
      (fma 0.03780864197530864 beta -0.05092592592592592)
      beta
      0.027777777777777776)
     beta
     0.16666666666666666)
    (+ (+ beta alpha) 2.0))
   (/ (/ (- alpha -1.0) (+ (+ 2.0 beta) alpha)) (+ (+ beta alpha) 3.0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 1.52) {
		tmp = fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / ((beta + alpha) + 2.0);
	} else {
		tmp = ((alpha - -1.0) / ((2.0 + beta) + alpha)) / ((beta + alpha) + 3.0);
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 1.52)
		tmp = Float64(fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 2.0));
	else
		tmp = Float64(Float64(Float64(alpha - -1.0) / Float64(Float64(2.0 + beta) + alpha)) / Float64(Float64(beta + alpha) + 3.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.52

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.6

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

   7. Applied rewrites 64.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 64.5%

       \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \color{blue}{\beta}, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2} \]

   if 1.52 < beta

   1. Initial program 72.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sub-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. metadata-eval N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 79.2

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

   5. Applied rewrites 79.2%

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

   7. Applied rewrites 79.2%

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

4. Final simplification 69.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.52:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\left(2 + \beta\right) + \alpha}}{\left(\beta + \alpha\right) + 3}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 97.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 2\\ \mathbf{if}\;\beta \leq 2.45:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -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 (+ (+ beta alpha) 2.0)))
   (if (<= beta 2.45)
     (/
      (fma
       (fma
        (fma 0.03780864197530864 beta -0.05092592592592592)
        beta
        0.027777777777777776)
       beta
       0.16666666666666666)
      t_0)
     (/ (/ (- alpha -1.0) beta) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 2.0;
	double tmp;
	if (beta <= 2.45) {
		tmp = fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0;
	} else {
		tmp = ((alpha - -1.0) / beta) / t_0;
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(beta + alpha) + 2.0)
	tmp = 0.0
	if (beta <= 2.45)
		tmp = Float64(fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0);
	else
		tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / t_0);
	end
	return 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 2.45], N[(N[(N[(N[(0.03780864197530864 * beta + -0.05092592592592592), $MachinePrecision] * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.4500000000000002

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.6

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

   7. Applied rewrites 64.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 64.5%

       \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \color{blue}{\beta}, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2} \]

   if 2.4500000000000002 < beta

   1. Initial program 72.7%

      \[\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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 72.8%

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

   5. Taylor expanded in alpha around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 72.8

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

   7. Applied rewrites 72.8%

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

   8. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 78.5

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

   10. Applied rewrites 78.5%

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

4. Final simplification 68.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 2.45:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\left(\beta + \alpha\right) + 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 97.2% accurate, 2.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 2\\ \mathbf{if}\;\beta \leq 1.9:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.05092592592592592, \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -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 (+ (+ beta alpha) 2.0)))
   (if (<= beta 1.9)
     (/
      (fma
       (fma -0.05092592592592592 beta 0.027777777777777776)
       beta
       0.16666666666666666)
      t_0)
     (/ (/ (- alpha -1.0) beta) t_0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 2.0;
	double tmp;
	if (beta <= 1.9) {
		tmp = fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0;
	} else {
		tmp = ((alpha - -1.0) / beta) / t_0;
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(beta + alpha) + 2.0)
	tmp = 0.0
	if (beta <= 1.9)
		tmp = Float64(fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0);
	else
		tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / t_0);
	end
	return 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[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 1.9], N[(N[(N[(-0.05092592592592592 * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.8999999999999999

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.6

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

   7. Applied rewrites 64.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 64.3%

       \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.05092592592592592, \beta, 0.027777777777777776\right), \color{blue}{\beta}, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2} \]

   if 1.8999999999999999 < beta

   1. Initial program 72.7%

      \[\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. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 72.8%

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

   5. Taylor expanded in alpha around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 72.8

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

   7. Applied rewrites 72.8%

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

   8. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 78.5

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

   10. Applied rewrites 78.5%

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

4. Final simplification 68.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.9:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.05092592592592592, \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\left(\beta + \alpha\right) + 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 97.2% accurate, 2.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2:\\ \;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.05092592592592592, \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\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 2.0)
   (/
    (fma
     (fma -0.05092592592592592 beta 0.027777777777777776)
     beta
     0.16666666666666666)
    (+ (+ beta alpha) 2.0))
   (/ (/ (- alpha -1.0) beta) beta)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.6

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

   7. Applied rewrites 64.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 64.3%

       \[\leadsto \frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.05092592592592592, \beta, 0.027777777777777776\right), \color{blue}{\beta}, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2} \]

   if 2 < beta

   1. Initial program 72.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 76.1

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

   5. Applied rewrites 76.1%

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

   7. Applied rewrites 78.3%

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

4. Final simplification 68.7%

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

Alternative 15: 96.5% accurate, 2.4× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 4.7:\\ \;\;\;\;\frac{\mathsf{fma}\left(0.027777777777777776, \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\ \mathbf{elif}\;\beta \leq 2.55 \cdot 10^{+155}:\\ \;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha}{\beta}}{\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 4.7)
   (/
    (fma 0.027777777777777776 beta 0.16666666666666666)
    (+ (+ beta alpha) 2.0))
   (if (<= beta 2.55e+155)
     (/ (- alpha -1.0) (* beta beta))
     (/ (/ alpha beta) beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 4.7) {
		tmp = fma(0.027777777777777776, beta, 0.16666666666666666) / ((beta + alpha) + 2.0);
	} else if (beta <= 2.55e+155) {
		tmp = (alpha - -1.0) / (beta * beta);
	} else {
		tmp = (alpha / beta) / beta;
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 4.7)
		tmp = Float64(fma(0.027777777777777776, beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 2.0));
	elseif (beta <= 2.55e+155)
		tmp = Float64(Float64(alpha - -1.0) / Float64(beta * beta));
	else
		tmp = Float64(Float64(alpha / beta) / beta);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if beta < 4.70000000000000018

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.6

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

   7. Applied rewrites 64.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 64.0%

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

   if 4.70000000000000018 < beta < 2.5500000000000001e155

   1. Initial program 83.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} \]
   2. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 67.7

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

   5. Applied rewrites 67.7%

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

   if 2.5500000000000001e155 < beta

   1. Initial program 59.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 86.3

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

   5. Applied rewrites 86.3%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 86.3%

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

   10. Applied rewrites 91.0%

       \[\leadsto \frac{\frac{\alpha}{\beta}}{\beta} \]
3. Recombined 3 regimes into one program.

4. Final simplification 68.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 4.7:\\ \;\;\;\;\frac{\mathsf{fma}\left(0.027777777777777776, \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\ \mathbf{elif}\;\beta \leq 2.55 \cdot 10^{+155}:\\ \;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 96.1% accurate, 2.4× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 8:\\ \;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\ \mathbf{elif}\;\beta \leq 2.55 \cdot 10^{+155}:\\ \;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha}{\beta}}{\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 8.0)
   (/ 0.16666666666666666 (+ (+ beta alpha) 2.0))
   (if (<= beta 2.55e+155)
     (/ (- alpha -1.0) (* beta beta))
     (/ (/ alpha beta) beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 8.0) {
		tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
	} else if (beta <= 2.55e+155) {
		tmp = (alpha - -1.0) / (beta * beta);
	} else {
		tmp = (alpha / beta) / 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 <= 8.0d0) then
        tmp = 0.16666666666666666d0 / ((beta + alpha) + 2.0d0)
    else if (beta <= 2.55d+155) then
        tmp = (alpha - (-1.0d0)) / (beta * beta)
    else
        tmp = (alpha / beta) / beta
    end if
    code = tmp
end function

Java

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 8.0:
		tmp = 0.16666666666666666 / ((beta + alpha) + 2.0)
	elif beta <= 2.55e+155:
		tmp = (alpha - -1.0) / (beta * beta)
	else:
		tmp = (alpha / beta) / beta
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 8.0)
		tmp = Float64(0.16666666666666666 / Float64(Float64(beta + alpha) + 2.0));
	elseif (beta <= 2.55e+155)
		tmp = Float64(Float64(alpha - -1.0) / Float64(beta * beta));
	else
		tmp = Float64(Float64(alpha / beta) / beta);
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 8.0)
		tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
	elseif (beta <= 2.55e+155)
		tmp = (alpha - -1.0) / (beta * beta);
	else
		tmp = (alpha / beta) / 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, 8.0], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2.55e+155], N[(N[(alpha - -1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if beta < 8

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.6

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

   7. Applied rewrites 64.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 63.3%

       \[\leadsto \frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2} \]

   if 8 < beta < 2.5500000000000001e155

   1. Initial program 83.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} \]
   2. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 67.7

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

   5. Applied rewrites 67.7%

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

   if 2.5500000000000001e155 < beta

   1. Initial program 59.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 86.3

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

   5. Applied rewrites 86.3%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 86.3%

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

   10. Applied rewrites 91.0%

       \[\leadsto \frac{\frac{\alpha}{\beta}}{\beta} \]
3. Recombined 3 regimes into one program.

4. Final simplification 68.0%

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

Alternative 17: 97.0% accurate, 2.6× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 4.7:\\ \;\;\;\;\frac{\mathsf{fma}\left(0.027777777777777776, \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\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 4.7)
   (/
    (fma 0.027777777777777776 beta 0.16666666666666666)
    (+ (+ beta alpha) 2.0))
   (/ (/ (- alpha -1.0) beta) beta)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.70000000000000018

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.6

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

   7. Applied rewrites 64.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 64.0%

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

   if 4.70000000000000018 < beta

   1. Initial program 72.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 76.1

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

   5. Applied rewrites 76.1%

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

   7. Applied rewrites 78.3%

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

4. Final simplification 68.5%

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

Alternative 18: 93.9% accurate, 3.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 8:\\ \;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha - -1}{\beta \cdot \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 8.0)
   (/ 0.16666666666666666 (+ (+ beta alpha) 2.0))
   (/ (- alpha -1.0) (* beta beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 8.0) {
		tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
	} else {
		tmp = (alpha - -1.0) / (beta * 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 <= 8.0d0) then
        tmp = 0.16666666666666666d0 / ((beta + alpha) + 2.0d0)
    else
        tmp = (alpha - (-1.0d0)) / (beta * beta)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 8.0)
		tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
	else
		tmp = (alpha - -1.0) / (beta * 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, 8.0], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha - -1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 8

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.6

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

   7. Applied rewrites 64.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 63.3%

       \[\leadsto \frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2} \]

   if 8 < beta

   1. Initial program 72.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 76.1

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

   5. Applied rewrites 76.1%

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

4. Final simplification 67.3%

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

Alternative 19: 91.4% accurate, 3.5× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 7.9:\\ \;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta \cdot \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.9)
   (/ 0.16666666666666666 (+ (+ beta alpha) 2.0))
   (/ 1.0 (* beta beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 7.9) {
		tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
	} else {
		tmp = 1.0 / (beta * 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.9d0) then
        tmp = 0.16666666666666666d0 / ((beta + alpha) + 2.0d0)
    else
        tmp = 1.0d0 / (beta * beta)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 7.9)
		tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
	else
		tmp = 1.0 / (beta * 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.9], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 7.9000000000000004

   1. Initial program 99.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} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\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. associate-/l/ N/A

         \[\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)}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 64.6

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

   7. Applied rewrites 64.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 63.3%

       \[\leadsto \frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2} \]

   if 7.9000000000000004 < beta

   1. Initial program 72.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 76.1

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

   5. Applied rewrites 76.1%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 66.8%

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

Alternative 20: 51.8% accurate, 3.6× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 1:\\ \;\;\;\;\frac{1}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;\frac{\alpha}{\beta \cdot \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 (<= alpha 1.0) (/ 1.0 (* beta beta)) (/ alpha (* beta beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (alpha <= 1.0) {
		tmp = 1.0 / (beta * beta);
	} else {
		tmp = alpha / (beta * 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 (alpha <= 1.0d0) then
        tmp = 1.0d0 / (beta * beta)
    else
        tmp = alpha / (beta * beta)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1

   1. Initial program 99.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} \]
   2. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 29.3

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

   5. Applied rewrites 29.3%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 28.7%

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

   if 1 < alpha

   1. Initial program 78.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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 21.2

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

   5. Applied rewrites 21.2%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 20.2%

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

Alternative 21: 31.7% accurate, 4.9× speedup

Math

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

FPCore

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

C

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

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 = alpha / (beta * beta)
end function

Java

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

Python

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	return Float64(alpha / Float64(beta * beta))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 91.4%

   \[\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. Add Preprocessing

3. Taylor expanded in beta around inf

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 26.1

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

5. Applied rewrites 26.1%

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

6. Taylor expanded in alpha around inf

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

8. Applied rewrites 17.1%

   \[\leadsto \frac{\alpha}{\color{blue}{\beta \cdot \beta}} \]
9. Add Preprocessing

Reproduce

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