Octave 3.8, jcobi/3

Percentage Accurate: 94.2% → 99.0%

Time: 11.1s

Alternatives: 21

Speedup: 2.0×

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.2% 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.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := 2 + \left(\beta + \alpha\right)\\ \mathbf{if}\;\alpha \leq 1.12 \cdot 10^{-63}:\\ \;\;\;\;\frac{{t\_0}^{-2} \cdot \left(1 + \mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right)\right)}{3 + \left(\beta + \alpha\right)}\\ \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\_0}}{\left(1 + \left(\beta + \alpha\right)\right) + 2}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(2.0 + Float64(beta + alpha))
	tmp = 0.0
	if (alpha <= 1.12e-63)
		tmp = Float64(Float64((t_0 ^ -2.0) * Float64(1.0 + fma(beta, alpha, Float64(beta + alpha)))) / Float64(3.0 + Float64(beta + alpha)));
	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_0) / Float64(Float64(1.0 + Float64(beta + alpha)) + 2.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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 1.12e-63], N[(N[(N[Power[t$95$0, -2.0], $MachinePrecision] * N[(1.0 + N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $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$0), $MachinePrecision] / N[(N[(1.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.12000000000000002e-63

   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

   4. Applied rewrites 99.9%

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

   if 1.12000000000000002e-63 < alpha

   1. Initial program 82.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. 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 82.5

         \[\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 82.5

         \[\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 82.5

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

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

      13. lower-+.f64 22.5

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

   7. Applied rewrites 22.5%

      \[\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}}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\right) + 2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 63.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 1.12 \cdot 10^{-63}:\\ \;\;\;\;\frac{{\left(2 + \left(\beta + \alpha\right)\right)}^{-2} \cdot \left(1 + \mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right)\right)}{3 + \left(\beta + \alpha\right)}\\ \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)}{2 + \left(\beta + \alpha\right)}}{\left(1 + \left(\beta + \alpha\right)\right) + 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.6% accurate, 0.5× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64))) < 0.10000000000000001

   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 \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 0.10000000000000001 < (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64)))

   1. Initial program 1.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{\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 49.2

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

      \[\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 0

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

   8. Applied rewrites 49.2%

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

4. Final simplification 95.7%

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

Alternative 3: 99.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := 2 + \left(\beta + \alpha\right)\\ t_1 := t\_0 + 1\\ t_2 := \frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) + 1}{t\_0}}{t\_0}\\ \mathbf{if}\;\frac{t\_2}{t\_1} \leq 0.1:\\ \;\;\;\;\frac{t\_2}{\left(1 + \left(\beta + \alpha\right)\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\_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 (+ 2.0 (+ beta alpha)))
        (t_1 (+ t_0 1.0))
        (t_2 (/ (/ (+ (+ (* beta alpha) (+ beta alpha)) 1.0) t_0) t_0)))
   (if (<= (/ t_2 t_1) 0.1)
     (/ t_2 (+ (+ 1.0 (+ beta alpha)) 2.0))
     (/
      (/
       (-
        (* (- (/ 1.0 beta) -1.0) alpha)
        (* (/ (fma 2.0 alpha 4.0) beta) (- alpha -1.0)))
       beta)
      t_1))))

C

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(2.0 + Float64(beta + alpha))
	t_1 = Float64(t_0 + 1.0)
	t_2 = Float64(Float64(Float64(Float64(Float64(beta * alpha) + Float64(beta + alpha)) + 1.0) / t_0) / t_0)
	tmp = 0.0
	if (Float64(t_2 / t_1) <= 0.1)
		tmp = Float64(t_2 / Float64(Float64(1.0 + Float64(beta + alpha)) + 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) / t_1);
	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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(N[(beta * alpha), $MachinePrecision] + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[N[(t$95$2 / t$95$1), $MachinePrecision], 0.1], N[(t$95$2 / N[(N[(1.0 + N[(beta + alpha), $MachinePrecision]), $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] / t$95$1), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64))) < 0.10000000000000001

   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 \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 0.10000000000000001 < (/.f64 (/.f64 (/.f64 (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 beta alpha)) #s(literal 1 binary64)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64)))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) #s(literal 1 binary64))) #s(literal 1 binary64)))

   1. Initial program 1.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{\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 49.2

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

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) + 1}{2 + \left(\beta + \alpha\right)}}{2 + \left(\beta + \alpha\right)}}{\left(2 + \left(\beta + \alpha\right)\right) + 1} \leq 0.1:\\ \;\;\;\;\frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) + 1}{2 + \left(\beta + \alpha\right)}}{2 + \left(\beta + \alpha\right)}}{\left(1 + \left(\beta + \alpha\right)\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(2 + \left(\beta + \alpha\right)\right) + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(1 + \left(\beta + \alpha\right)\right) + 2\\ t_1 := 2 + \left(\beta + \alpha\right)\\ \mathbf{if}\;\alpha \leq 2.1 \cdot 10^{+28}:\\ \;\;\;\;\frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) + 1}{t\_1}}{t\_1}}{t\_0}\\ \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 (+ (+ 1.0 (+ beta alpha)) 2.0)) (t_1 (+ 2.0 (+ beta alpha))))
   (if (<= alpha 2.1e+28)
     (/ (/ (/ (+ (+ (* beta alpha) (+ beta alpha)) 1.0) t_1) t_1) t_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 = (1.0 + (beta + alpha)) + 2.0;
	double t_1 = 2.0 + (beta + alpha);
	double tmp;
	if (alpha <= 2.1e+28) {
		tmp = (((((beta * alpha) + (beta + alpha)) + 1.0) / t_1) / t_1) / t_0;
	} else {
		tmp = ((((alpha / beta) + (((1.0 / beta) + alpha) + 1.0)) - (((2.0 + alpha) / beta) * (alpha - -1.0))) / t_1) / 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 = (1.0d0 + (beta + alpha)) + 2.0d0
    t_1 = 2.0d0 + (beta + alpha)
    if (alpha <= 2.1d+28) then
        tmp = (((((beta * alpha) + (beta + alpha)) + 1.0d0) / t_1) / t_1) / t_0
    else
        tmp = ((((alpha / beta) + (((1.0d0 / beta) + alpha) + 1.0d0)) - (((2.0d0 + alpha) / beta) * (alpha - (-1.0d0)))) / t_1) / t_0
    end if
    code = tmp
end function

Java

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = (1.0 + (beta + alpha)) + 2.0
	t_1 = 2.0 + (beta + alpha)
	tmp = 0
	if alpha <= 2.1e+28:
		tmp = (((((beta * alpha) + (beta + alpha)) + 1.0) / t_1) / t_1) / t_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(1.0 + Float64(beta + alpha)) + 2.0)
	t_1 = Float64(2.0 + Float64(beta + alpha))
	tmp = 0.0
	if (alpha <= 2.1e+28)
		tmp = Float64(Float64(Float64(Float64(Float64(Float64(beta * alpha) + Float64(beta + alpha)) + 1.0) / t_1) / t_1) / t_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

MATLAB

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

   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 2.09999999999999989e28 < alpha

   1. Initial program 76.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 76.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 76.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 76.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 76.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. 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}}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\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}}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\right) + 2} \]

      13. lower-+.f64 19.1

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

   7. Applied rewrites 19.1%

      \[\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}}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(1 + \left(\beta + \alpha\right)\right) + 2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 71.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 2.1 \cdot 10^{+28}:\\ \;\;\;\;\frac{\frac{\frac{\left(\beta \cdot \alpha + \left(\beta + \alpha\right)\right) + 1}{2 + \left(\beta + \alpha\right)}}{2 + \left(\beta + \alpha\right)}}{\left(1 + \left(\beta + \alpha\right)\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)}{2 + \left(\beta + \alpha\right)}}{\left(1 + \left(\beta + \alpha\right)\right) + 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.3% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.90000000000000018e58

   1. Initial program 98.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 \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 98.8

         \[\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 98.8

         \[\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 98.8

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

      \[\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 4.90000000000000018e58 < beta

   1. Initial program 74.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 \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 82.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 82.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 82.7%

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

4. Final simplification 94.1%

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

Alternative 6: 99.2% accurate, 1.3× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.1e18

   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. lower-/.f64 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. Applied rewrites 99.8%

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

   if 3.1e18 < beta

   1. Initial program 76.6%

      \[\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]
   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.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 81.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 81.2%

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

4. Final simplification 93.4%

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

Alternative 7: 99.2% accurate, 1.5× speedup

Math

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.1e18

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

   5. Taylor expanded in alpha around 0

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

      1. distribute-lft-out N/A

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

      2. *-rgt-identity N/A

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

      3. associate-+r+ N/A

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

      4. +-commutative N/A

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

      5. associate-+r+ N/A

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

      6. *-lft-identity N/A

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

      7. distribute-rgt-in N/A

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

      8. associate-+r+ N/A

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

      9. distribute-rgt1-in N/A

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

      10. +-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-+.f64 N/A

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

      13. lower-+.f64 96.5

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

   7. Applied rewrites 96.5%

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

   1. Initial program 76.6%

      \[\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]
   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.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 81.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 81.2%

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

4. Final simplification 91.2%

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

Alternative 8: 98.3% accurate, 1.6× speedup

Math

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.5e17

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-+.f64 83.8

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

   7. Applied rewrites 83.8%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-+.f64 N/A

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

   9. Applied rewrites 83.8%

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

   if 4.5e17 < beta

   1. Initial program 76.6%

      \[\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]
   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.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 81.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 81.2%

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

4. Final simplification 82.9%

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

Alternative 9: 98.2% accurate, 1.7× speedup

Math

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.8e17

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

   5. Taylor expanded in alpha around 0

      \[\leadsto \frac{\color{blue}{1 + \beta}}{\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)} \]
   6. Step-by-step derivation

      1. lower-+.f64 81.7

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

   7. Applied rewrites 81.7%

      \[\leadsto \frac{\color{blue}{1 + \beta}}{\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 2.8e17 < beta

   1. Initial program 76.6%

      \[\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]
   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.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 81.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 81.2%

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

4. Final simplification 81.5%

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

Alternative 10: 96.9% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 0.650000000000000022

   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. 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 96.4%

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

   5. Taylor expanded in beta around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 94.9

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

   7. Applied rewrites 94.9%

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

   8. Taylor expanded in alpha around 0

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

   10. Applied rewrites 80.7%

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

   if 0.650000000000000022 < beta

   1. Initial program 77.6%

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

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

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

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

4. Final simplification 80.5%

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

Alternative 11: 96.4% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 0.619999999999999996

   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. 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 96.4%

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

   5. Taylor expanded in beta around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 94.9

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

   7. Applied rewrites 94.9%

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

   8. Taylor expanded in alpha around 0

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

   10. Applied rewrites 62.9%

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

   if 0.619999999999999996 < beta

   1. Initial program 77.6%

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

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

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

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

4. Final simplification 69.2%

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

Alternative 12: 96.4% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 1.7)
		tmp = Float64(Float64(1.0 + fma(beta, alpha, Float64(beta + alpha))) / Float64(6.0 * Float64(2.0 + Float64(beta + alpha))));
	else
		tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(3.0 + Float64(beta + alpha)));
	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.7], N[(N[(1.0 + N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(6.0 * N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.69999999999999996

   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. 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 96.4%

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

   5. Taylor expanded in beta around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 94.9

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

   7. Applied rewrites 94.9%

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

   8. Taylor expanded in alpha around 0

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

   10. Applied rewrites 62.9%

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

   if 1.69999999999999996 < beta

   1. Initial program 77.6%

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

         \[\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 77.6

         \[\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 77.6

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

      \[\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. Taylor expanded in beta around -inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. sub-neg N/A

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

      6. 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)}{\beta}}{\left(1 + \left(\beta + \alpha\right)\right) + 2} \]

      7. distribute-neg-in N/A

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

      8. +-commutative N/A

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

      9. 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)}}{\beta}}{\left(1 + \left(\beta + \alpha\right)\right) + 2} \]

      10. metadata-eval N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 79.7

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

   7. Applied rewrites 79.7%

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

   9. Applied rewrites 79.7%

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

4. Final simplification 69.0%

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

Alternative 13: 62.8% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.75e16

   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 \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 15.5

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

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

      1. lift-/.f64 N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 31.8%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 14.3

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

   10. Applied rewrites 14.3%

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

   if 1.75e16 < beta

   1. Initial program 76.6%

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

         \[\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 76.6

         \[\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 76.6

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

      \[\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. Taylor expanded in beta around -inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. sub-neg N/A

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

      6. 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)}{\beta}}{\left(1 + \left(\beta + \alpha\right)\right) + 2} \]

      7. distribute-neg-in N/A

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

      8. +-commutative N/A

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

      9. 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)}}{\beta}}{\left(1 + \left(\beta + \alpha\right)\right) + 2} \]

      10. metadata-eval N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 80.7

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

   7. Applied rewrites 80.7%

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

   9. Applied rewrites 80.7%

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

4. Final simplification 37.4%

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

Alternative 14: 62.8% accurate, 2.4× speedup

Math

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2e14

   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 \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 15.5

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

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

      1. lift-/.f64 N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 31.8%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 14.3

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

   10. Applied rewrites 14.3%

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

   if 2e14 < beta

   1. Initial program 76.6%

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

         \[\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 76.6

         \[\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 76.6

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

      \[\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. Taylor expanded in beta around -inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. sub-neg N/A

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

      6. 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)}{\beta}}{\left(1 + \left(\beta + \alpha\right)\right) + 2} \]

      7. distribute-neg-in N/A

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

      8. +-commutative N/A

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

      9. 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)}}{\beta}}{\left(1 + \left(\beta + \alpha\right)\right) + 2} \]

      10. metadata-eval N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 80.7

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

   7. Applied rewrites 80.7%

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

   8. Taylor expanded in alpha around 0

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

      1. lower-+.f64 80.5

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

   10. Applied rewrites 80.5%

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

4. Final simplification 37.3%

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

Alternative 15: 62.8% accurate, 2.6× speedup

Math

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

C

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if beta < 5e17

   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 \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 15.5

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

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

      1. lift-/.f64 N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 31.8%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 14.3

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

   10. Applied rewrites 14.3%

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

   if 5e17 < beta

   1. Initial program 76.6%

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

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

   5. Applied rewrites 74.7%

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

   7. Applied rewrites 80.5%

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

4. Final simplification 37.3%

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

Alternative 16: 55.7% accurate, 2.9× speedup

Math

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

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

   5. Applied rewrites 35.9%

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

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

   10. Applied rewrites 36.2%

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

   if 1 < alpha

   1. Initial program 77.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 17.0

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

   5. Applied rewrites 17.0%

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

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

   10. Applied rewrites 21.1%

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

Alternative 17: 55.9% accurate, 2.9× speedup

Math

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

C

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

Derivation

1. Split input into 2 regimes

2. if beta < 9.99999999999999983e156

   1. Initial program 97.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 16.3

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

   5. Applied rewrites 16.3%

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

   if 9.99999999999999983e156 < beta

   1. Initial program 69.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 \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 79.8

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

   5. Applied rewrites 79.8%

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

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

   10. Applied rewrites 87.5%

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

4. Final simplification 30.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 10^{+157}:\\ \;\;\;\;\frac{\alpha - -1}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\ \end{array} \]
5. Add Preprocessing

Alternative 18: 56.4% accurate, 3.2× speedup

Math

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

FPCore

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	return ((alpha - -1.0) / 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 - (-1.0d0)) / beta) / beta
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 91.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. 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.0

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

5. Applied rewrites 29.0%

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

7. Applied rewrites 31.0%

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

8. Final simplification 31.0%

   \[\leadsto \frac{\frac{\alpha - -1}{\beta}}{\beta} \]
9. Add Preprocessing

Alternative 19: 53.2% 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 35.9

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

   5. Applied rewrites 35.9%

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

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

   if 1 < alpha

   1. Initial program 77.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 17.0

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

   5. Applied rewrites 17.0%

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

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

Alternative 20: 53.8% accurate, 4.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \frac{\alpha - -1}{\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 -1.0) (* beta beta)))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	return (alpha - -1.0) / (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 - (-1.0d0)) / (beta * beta)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 91.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. 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.0

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

5. Applied rewrites 29.0%

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

6. Final simplification 29.0%

   \[\leadsto \frac{\alpha - -1}{\beta \cdot \beta} \]
7. Add Preprocessing

Alternative 21: 32.8% 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.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. 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.0

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

5. Applied rewrites 29.0%

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

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

Reproduce

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