Octave 3.8, jcobi/3

Percentage Accurate: 93.7% → 99.7%

Time: 12.4s

Alternatives: 17

Speedup: 3.2×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1e143

   1. Initial program 98.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 \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)}} \]

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(\alpha, \beta, \alpha + \beta\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)} \]

      10. lift-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-commutative N/A

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

   4. Applied rewrites 98.0%

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

   if 1e143 < beta

   1. Initial program 87.4%

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

   3. Taylor expanded in beta around inf

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. associate-+l+ N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-+l+ N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-+.f64 N/A

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

      12. associate-/l* N/A

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

      13. distribute-lft-neg-in N/A

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

      14. mul-1-neg N/A

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

      15. lower-*.f64 N/A

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

      16. distribute-lft-in N/A

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

      17. metadata-eval N/A

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

      18. mul-1-neg N/A

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

      19. unsub-neg N/A

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

      20. lower--.f64 N/A

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

      21. lower-/.f64 N/A

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

   5. Applied rewrites 89.7%

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

4. Final simplification 96.5%

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

Alternative 2: 99.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1e143

   1. Initial program 98.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 \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)}} \]

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(\alpha, \beta, \alpha + \beta\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)} \]

      10. lift-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-commutative N/A

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

   4. Applied rewrites 98.0%

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

   if 1e143 < beta

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

   4. Applied rewrites 84.9%

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

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

   7. Applied rewrites 89.7%

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

4. Final simplification 96.5%

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

Alternative 3: 99.6% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1e143

   1. Initial program 98.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 \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)}} \]

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

         \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(\alpha, \beta, \alpha + \beta\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)} \]

      10. lift-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-commutative N/A

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

   4. Applied rewrites 98.0%

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

   if 1e143 < beta

   1. Initial program 87.4%

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

   3. Taylor expanded in beta around inf

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

      1. lower-+.f64 90.3

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

   5. Applied rewrites 90.3%

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

4. Final simplification 96.6%

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

Alternative 4: 99.6% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1e143

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

   4. Applied rewrites 98.0%

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

   if 1e143 < beta

   1. Initial program 87.4%

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

   3. Taylor expanded in beta around inf

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

      1. lower-+.f64 90.3

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

   5. Applied rewrites 90.3%

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

4. Final simplification 96.6%

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

Alternative 5: 99.4% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.5e18

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-/l/ N/A

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

      5. associate-/l/ N/A

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

      6. lower-/.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 90.2%

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

   if 4.5e18 < beta

   1. Initial program 88.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 + \alpha}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]
   4. Step-by-step derivation

      1. lower-+.f64 84.1

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

   5. Applied rewrites 84.1%

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

4. Final simplification 88.3%

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

Alternative 6: 99.4% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.5e18

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-/l/ N/A

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

      5. associate-/l/ N/A

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

      6. lower-/.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 90.2%

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

   5. Taylor expanded in alpha around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 90.2

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

   7. Applied rewrites 90.2%

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

   if 4.5e18 < beta

   1. Initial program 88.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 + \alpha}}{\left(\alpha + \beta\right) + 2 \cdot 1}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]
   4. Step-by-step derivation

      1. lower-+.f64 84.1

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

   5. Applied rewrites 84.1%

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

4. Final simplification 88.3%

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

Alternative 7: 99.4% accurate, 1.5× speedup

Math

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.5e18

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-/l/ N/A

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

      5. associate-/l/ N/A

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

      6. lower-/.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

   4. Applied rewrites 90.2%

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

   5. Taylor expanded in alpha around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. +-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 90.2

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

   7. Applied rewrites 90.2%

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

   if 4.5e18 < beta

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

   4. Applied rewrites 87.1%

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

   5. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 83.7

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

   7. Applied rewrites 83.7%

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

4. Final simplification 88.2%

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

Alternative 8: 99.0% accurate, 1.8× speedup

Math

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

FPCore

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 3.0);
	double tmp;
	if (beta <= 31000000000000.0) {
		tmp = ((beta + 1.0) / fma(beta, (beta + 4.0), 4.0)) / t_0;
	} else {
		tmp = ((alpha + 1.0) / beta) / t_0;
	}
	return tmp;
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(alpha + Float64(beta + 3.0))
	tmp = 0.0
	if (beta <= 31000000000000.0)
		tmp = Float64(Float64(Float64(beta + 1.0) / fma(beta, Float64(beta + 4.0), 4.0)) / t_0);
	else
		tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / t_0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.1e13

   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

   4. Applied rewrites 99.4%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 67.7

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

   7. Applied rewrites 67.7%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 67.7%

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

   if 3.1e13 < beta

   1. Initial program 89.0%

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

   4. Applied rewrites 87.5%

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

   5. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 83.9

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

   7. Applied rewrites 83.9%

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

4. Final simplification 72.9%

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

Alternative 9: 98.6% accurate, 2.1× speedup

Math

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.1e13

   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. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 65.4

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

   5. Applied rewrites 65.4%

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

   if 3.1e13 < beta

   1. Initial program 89.0%

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

   4. Applied rewrites 87.5%

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

   5. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 83.9

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

   7. Applied rewrites 83.9%

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

4. Final simplification 71.3%

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

Alternative 10: 97.8% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(alpha + Float64(beta + 3.0))
	tmp = 0.0
	if (beta <= 1.78)
		tmp = Float64(fma(Float64(beta * beta), -0.0625, 0.25) / t_0);
	else
		tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / t_0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.78000000000000003

   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

   4. Applied rewrites 99.4%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 67.5

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

   7. Applied rewrites 67.5%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 66.9%

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

   if 1.78000000000000003 < beta

   1. Initial program 89.5%

      \[\frac{\frac{\frac{\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 88.1%

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

   5. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 81.8

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

   7. Applied rewrites 81.8%

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

4. Final simplification 71.9%

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

Alternative 11: 97.8% accurate, 2.4× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.9:\\ \;\;\;\;\frac{\mathsf{fma}\left(\beta \cdot \beta, -0.0625, 0.25\right)}{\alpha + \left(\beta + 3\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 1.9)
   (/ (fma (* beta beta) -0.0625 0.25) (+ alpha (+ beta 3.0)))
   (/ (/ (+ alpha 1.0) beta) beta)))

C

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 1.9)
		tmp = Float64(fma(Float64(beta * beta), -0.0625, 0.25) / Float64(alpha + Float64(beta + 3.0)));
	else
		tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.8999999999999999

   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

   4. Applied rewrites 99.4%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 67.5

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

   7. Applied rewrites 67.5%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 66.9%

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

   if 1.8999999999999999 < beta

   1. Initial program 89.5%

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

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

   5. Applied rewrites 82.5%

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

   7. Applied rewrites 81.5%

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

4. Final simplification 71.8%

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

Alternative 12: 97.7% accurate, 2.6× speedup

Math

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

C

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

Fortran

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

Java

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

Python

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 6.3)
		tmp = Float64(0.25 / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0)));
	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 <= 6.3)
		tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
	else
		tmp = ((alpha + 1.0) / beta) / beta;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 6.29999999999999982

   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. Taylor expanded in beta around 0

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 97.3

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

   5. Applied rewrites 97.3%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 66.5%

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

   if 6.29999999999999982 < beta

   1. Initial program 89.5%

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

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

   5. Applied rewrites 82.5%

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

   7. Applied rewrites 81.5%

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

4. Final simplification 71.6%

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

Alternative 13: 97.7% accurate, 2.6× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 6.3:\\ \;\;\;\;\frac{0.25}{\alpha + \left(\beta + 3\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 6.3)
   (/ 0.25 (+ alpha (+ beta 3.0)))
   (/ (/ (+ alpha 1.0) beta) beta)))

C

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

Fortran

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

Java

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

Python

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 6.3)
		tmp = Float64(0.25 / Float64(alpha + Float64(beta + 3.0)));
	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 <= 6.3)
		tmp = 0.25 / (alpha + (beta + 3.0));
	else
		tmp = ((alpha + 1.0) / beta) / beta;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 6.29999999999999982

   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

   4. Applied rewrites 99.4%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 67.5

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

   7. Applied rewrites 67.5%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 66.5%

       \[\leadsto \frac{0.25}{\alpha + \left(\beta + 3\right)} \]

   if 6.29999999999999982 < beta

   1. Initial program 89.5%

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

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

   5. Applied rewrites 82.5%

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

   7. Applied rewrites 81.5%

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

4. Final simplification 71.6%

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

Alternative 14: 94.6% accurate, 3.2× speedup

Math

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

FPCore

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.3) {
		tmp = 0.25 / (alpha + (beta + 3.0));
	} else {
		tmp = (alpha + 1.0) / (beta * beta);
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 6.29999999999999982

   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

   4. Applied rewrites 99.4%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 67.5

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

   7. Applied rewrites 67.5%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 66.5%

       \[\leadsto \frac{0.25}{\alpha + \left(\beta + 3\right)} \]

   if 6.29999999999999982 < beta

   1. Initial program 89.5%

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

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

   5. Applied rewrites 82.5%

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

4. Final simplification 71.9%

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

Alternative 15: 91.9% accurate, 3.5× speedup

Math

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

FPCore

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.2) {
		tmp = 0.25 / (alpha + (beta + 3.0));
	} else {
		tmp = 1.0 / (beta * beta);
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 6.20000000000000018

   1. Initial program 99.8%

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

   4. Applied rewrites 99.4%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 67.5

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

   7. Applied rewrites 67.5%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 66.5%

       \[\leadsto \frac{0.25}{\alpha + \left(\beta + 3\right)} \]

   if 6.20000000000000018 < beta

   1. Initial program 89.5%

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

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

   5. Applied rewrites 82.5%

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

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

Alternative 16: 51.9% 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.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 37.7

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

   5. Applied rewrites 37.7%

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

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

   if 1 < alpha

   1. Initial program 88.5%

      \[\frac{\frac{\frac{\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 12.8

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

   5. Applied rewrites 12.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 12.1%

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

Alternative 17: 31.7% accurate, 4.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.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 30.1

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

5. Applied rewrites 30.1%

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

6. Taylor expanded in alpha around inf

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

8. Applied rewrites 19.2%

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

Reproduce

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