Octave 3.8, jcobi/3

Percentage Accurate: 94.7% → 99.6%

Time: 12.7s

Alternatives: 21

Speedup: 2.6×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 94.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.6% accurate, 1.0× 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 1.7 \cdot 10^{+32}:\\ \;\;\;\;\frac{\left(\mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right) + 1\right) \cdot \frac{1}{t\_1}}{t\_0 \cdot t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(\frac{\mathsf{fma}\left(2, \alpha, 4\right)}{\beta}, -1 - \alpha, \left(\alpha + 1\right) + \frac{\alpha + 1}{\beta}\right)}{t\_1}}{\beta}\\ \end{array} \end{array} \]

FPCore

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

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 <= 1.7e+32) {
		tmp = ((fma(alpha, beta, (beta + alpha)) + 1.0) * (1.0 / t_1)) / (t_0 * t_0);
	} else {
		tmp = (fma((fma(2.0, alpha, 4.0) / beta), (-1.0 - alpha), ((alpha + 1.0) + ((alpha + 1.0) / beta))) / t_1) / beta;
	}
	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 <= 1.7e+32)
		tmp = Float64(Float64(Float64(fma(alpha, beta, Float64(beta + alpha)) + 1.0) * Float64(1.0 / t_1)) / Float64(t_0 * t_0));
	else
		tmp = Float64(Float64(fma(Float64(fma(2.0, alpha, 4.0) / beta), Float64(-1.0 - alpha), Float64(Float64(alpha + 1.0) + Float64(Float64(alpha + 1.0) / beta))) / t_1) / beta);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.69999999999999989e32

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

         \[\leadsto \frac{\frac{\frac{\left(\color{blue}{\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{\frac{\frac{\left(\left(\alpha + \beta\right) + \color{blue}{\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{\frac{\color{blue}{\left(\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. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-+.f64 N/A

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

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

      9. lift-+.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. div-inv N/A

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

      13. lift-+.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lift-+.f64 N/A

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

   4. Applied rewrites 99.6%

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

   if 1.69999999999999989e32 < beta

   1. Initial program 84.3%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

   5. Applied rewrites 92.1%

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

   7. Applied rewrites 92.1%

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

4. Final simplification 97.4%

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

Alternative 2: 99.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 2\\ \mathbf{if}\;\beta \leq 5 \cdot 10^{+138}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right) + 1}{t\_0}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t\_0}\\ \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 5e+138)
     (/
      (/ (+ (fma alpha beta (+ beta alpha)) 1.0) t_0)
      (* (+ alpha (+ beta 3.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 <= 5e+138) {
		tmp = ((fma(alpha, beta, (beta + alpha)) + 1.0) / t_0) / ((alpha + (beta + 3.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 <= 5e+138)
		tmp = Float64(Float64(Float64(fma(alpha, beta, Float64(beta + alpha)) + 1.0) / t_0) / Float64(Float64(alpha + Float64(beta + 3.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, 5e+138], N[(N[(N[(N[(alpha * beta + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $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 < 5.00000000000000016e138

   1. Initial program 97.9%

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

      1. lift-+.f64 N/A

         \[\leadsto \frac{\frac{\frac{\left(\color{blue}{\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{\frac{\frac{\left(\left(\alpha + \beta\right) + \color{blue}{\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{\frac{\color{blue}{\left(\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. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-+.f64 N/A

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

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

      9. lift-+.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lift-+.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. lift-+.f64 N/A

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

      15. lift-+.f64 N/A

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

   4. Applied rewrites 97.6%

      \[\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 5.00000000000000016e138 < beta

   1. Initial program 84.3%

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

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 5 \cdot 10^{+138}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right) + 1}{\left(\beta + \alpha\right) + 2}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(\left(\beta + \alpha\right) + 2\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 3: 99.5% 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 2.2 \cdot 10^{+98}:\\ \;\;\;\;\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 2.2e+98)
     (/
      (+ (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 <= 2.2e+98) {
		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 <= 2.2e+98)
		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, 2.2e+98], 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 < 2.20000000000000009e98

   1. Initial program 99.3%

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

      1. lift-+.f64 N/A

         \[\leadsto \frac{\frac{\frac{\left(\color{blue}{\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{\frac{\frac{\left(\left(\alpha + \beta\right) + \color{blue}{\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{\frac{\color{blue}{\left(\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. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-+.f64 N/A

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

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

      9. lift-+.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. div-inv N/A

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

      13. lift-+.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lift-+.f64 N/A

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

   4. Applied rewrites 92.7%

      \[\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 2.20000000000000009e98 < beta

   1. Initial program 81.3%

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

   3. Taylor expanded in beta around inf

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

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 2.2 \cdot 10^{+98}:\\ \;\;\;\;\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 4: 98.9% 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 57000000000000:\\ \;\;\;\;\frac{1 - \beta \cdot \beta}{\left(\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 2\right)\right)\right) \cdot \left(1 - \beta\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 57000000000000.0)
     (/
      (- 1.0 (* beta beta))
      (*
       (* (+ alpha (+ beta 3.0)) (* (+ beta 2.0) (+ beta 2.0)))
       (- 1.0 beta)))
     (/ (/ (+ 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 <= 57000000000000.0) {
		tmp = (1.0 - (beta * beta)) / (((alpha + (beta + 3.0)) * ((beta + 2.0) * (beta + 2.0))) * (1.0 - beta));
	} 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 <= 57000000000000.0d0) then
        tmp = (1.0d0 - (beta * beta)) / (((alpha + (beta + 3.0d0)) * ((beta + 2.0d0) * (beta + 2.0d0))) * (1.0d0 - beta))
    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 <= 57000000000000.0) {
		tmp = (1.0 - (beta * beta)) / (((alpha + (beta + 3.0)) * ((beta + 2.0) * (beta + 2.0))) * (1.0 - beta));
	} 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 <= 57000000000000.0:
		tmp = (1.0 - (beta * beta)) / (((alpha + (beta + 3.0)) * ((beta + 2.0) * (beta + 2.0))) * (1.0 - beta))
	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 <= 57000000000000.0)
		tmp = Float64(Float64(1.0 - Float64(beta * beta)) / Float64(Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(Float64(beta + 2.0) * Float64(beta + 2.0))) * Float64(1.0 - beta)));
	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 <= 57000000000000.0)
		tmp = (1.0 - (beta * beta)) / (((alpha + (beta + 3.0)) * ((beta + 2.0) * (beta + 2.0))) * (1.0 - beta));
	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, 57000000000000.0], N[(N[(1.0 - N[(beta * beta), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - beta), $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 < 5.7e13

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.6

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

   5. Applied rewrites 68.6%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. lift-+.f64 N/A

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

      9. associate-/l/ N/A

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

      10. lift-+.f64 N/A

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

      11. flip-+ N/A

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

      12. associate-/l/ N/A

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

      13. lower-/.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. lower--.f64 N/A

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

   7. Applied rewrites 68.6%

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

   if 5.7e13 < beta

   1. Initial program 84.9%

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

   3. Taylor expanded in beta around inf

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

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 57000000000000:\\ \;\;\;\;\frac{1 - \beta \cdot \beta}{\left(\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 2\right)\right)\right) \cdot \left(1 - \beta\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: 98.9% accurate, 1.5× 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 57000000000000:\\ \;\;\;\;\frac{1 - \beta \cdot \beta}{\left(t\_0 \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 2\right)\right)\right) \cdot \left(1 - \beta\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{\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
 (let* ((t_0 (+ alpha (+ beta 3.0))))
   (if (<= beta 57000000000000.0)
     (/
      (- 1.0 (* beta beta))
      (* (* t_0 (* (+ beta 2.0) (+ beta 2.0))) (- 1.0 beta)))
     (/ (/ (+ alpha 1.0) t_0) beta))))

C

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

Fortran

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

Java

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = alpha + (beta + 3.0)
	tmp = 0
	if beta <= 57000000000000.0:
		tmp = (1.0 - (beta * beta)) / ((t_0 * ((beta + 2.0) * (beta + 2.0))) * (1.0 - beta))
	else:
		tmp = ((alpha + 1.0) / t_0) / beta
	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 <= 57000000000000.0)
		tmp = Float64(Float64(1.0 - Float64(beta * beta)) / Float64(Float64(t_0 * Float64(Float64(beta + 2.0) * Float64(beta + 2.0))) * Float64(1.0 - beta)));
	else
		tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / beta);
	end
	return tmp
end

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 5.7e13

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.6

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

   5. Applied rewrites 68.6%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. lift-+.f64 N/A

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

      9. associate-/l/ N/A

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

      10. lift-+.f64 N/A

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

      11. flip-+ N/A

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

      12. associate-/l/ N/A

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

      13. lower-/.f64 N/A

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

      14. metadata-eval N/A

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

      15. lift-*.f64 N/A

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

      16. lower--.f64 N/A

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

   7. Applied rewrites 68.6%

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

   if 5.7e13 < beta

   1. Initial program 84.9%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 91.2

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

   5. Applied rewrites 91.2%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-/l/ N/A

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

      7. associate-/r* N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 91.2

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lift-*.f64 N/A

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

      13. metadata-eval N/A

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

      14. associate-+l+ N/A

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

      15. lift-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. associate-+r+ N/A

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

      18. lift-+.f64 N/A

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

      19. lift-+.f64 91.2

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

   7. Applied rewrites 91.2%

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

4. Final simplification 75.6%

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

Alternative 6: 98.9% accurate, 1.7× speedup

Math

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 5.7e13

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.6

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

   5. Applied rewrites 68.6%

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

      1. lift-+.f64 N/A

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

      2. metadata-eval N/A

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

      3. associate-+l+ N/A

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

      4. metadata-eval N/A

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

      5. lower-+.f64 68.6

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.6

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

   7. Applied rewrites 68.6%

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

   if 5.7e13 < beta

   1. Initial program 84.9%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 91.2

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

   5. Applied rewrites 91.2%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-/l/ N/A

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

      7. associate-/r* N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 91.2

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lift-*.f64 N/A

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

      13. metadata-eval N/A

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

      14. associate-+l+ N/A

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

      15. lift-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. associate-+r+ N/A

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

      18. lift-+.f64 N/A

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

      19. lift-+.f64 91.2

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

   7. Applied rewrites 91.2%

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

4. Final simplification 75.6%

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

Alternative 7: 97.6% accurate, 2.2× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.71999999999999997

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in beta around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 68.0

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

   8. Applied rewrites 68.0%

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

   if 1.71999999999999997 < beta

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 89.6

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

   5. Applied rewrites 89.6%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-/l/ N/A

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

      7. associate-/r* N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 89.6

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lift-*.f64 N/A

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

      13. metadata-eval N/A

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

      14. associate-+l+ N/A

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

      15. lift-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. associate-+r+ N/A

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

      18. lift-+.f64 N/A

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

      19. lift-+.f64 89.6

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

   7. Applied rewrites 89.6%

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

4. Final simplification 74.9%

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

Alternative 8: 98.5% accurate, 2.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 57000000000000:\\ \;\;\;\;\frac{\beta + 1}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \beta + 7, 16\right), 12\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\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 57000000000000.0)
   (/ (+ beta 1.0) (fma beta (fma beta (+ beta 7.0) 16.0) 12.0))
   (/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) beta)))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 57000000000000.0) {
		tmp = (beta + 1.0) / fma(beta, fma(beta, (beta + 7.0), 16.0), 12.0);
	} else {
		tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / beta;
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 5.7e13

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.6

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

   5. Applied rewrites 68.6%

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

   6. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1 + \beta}{{\left(2 + \beta\right)}^{2} \cdot \left(3 + \beta\right)}} \]
   7. 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. +-commutative N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 66.9

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

   8. Applied rewrites 66.9%

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

   9. Taylor expanded in beta around 0

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

       1. +-commutative N/A

          \[\leadsto \frac{\beta + 1}{\color{blue}{\beta \cdot \left(16 + \beta \cdot \left(7 + \beta\right)\right) + 12}} \]

       2. lower-fma.f64 N/A

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

       3. +-commutative N/A

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

       4. lower-fma.f64 N/A

          \[\leadsto \frac{\beta + 1}{\mathsf{fma}\left(\beta, \color{blue}{\mathsf{fma}\left(\beta, 7 + \beta, 16\right)}, 12\right)} \]

       5. +-commutative N/A

          \[\leadsto \frac{\beta + 1}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \color{blue}{\beta + 7}, 16\right), 12\right)} \]

       6. lower-+.f64 66.9

          \[\leadsto \frac{\beta + 1}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \color{blue}{\beta + 7}, 16\right), 12\right)} \]

   11. Applied rewrites 66.9%

       \[\leadsto \frac{\beta + 1}{\color{blue}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \beta + 7, 16\right), 12\right)}} \]

   if 5.7e13 < beta

   1. Initial program 84.9%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 91.2

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

   5. Applied rewrites 91.2%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-/l/ N/A

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

      7. associate-/r* N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 91.2

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lift-*.f64 N/A

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

      13. metadata-eval N/A

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

      14. associate-+l+ N/A

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

      15. lift-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. associate-+r+ N/A

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

      18. lift-+.f64 N/A

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

      19. lift-+.f64 91.2

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

   7. Applied rewrites 91.2%

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

4. Final simplification 74.4%

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

Alternative 9: 98.5% accurate, 2.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 57000000000000:\\ \;\;\;\;\frac{\beta + 1}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \beta + 7, 16\right), 12\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 57000000000000.0)
   (/ (+ beta 1.0) (fma beta (fma beta (+ beta 7.0) 16.0) 12.0))
   (/ (/ (+ alpha 1.0) beta) beta)))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 57000000000000.0) {
		tmp = (beta + 1.0) / fma(beta, fma(beta, (beta + 7.0), 16.0), 12.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 <= 57000000000000.0)
		tmp = Float64(Float64(beta + 1.0) / fma(beta, fma(beta, Float64(beta + 7.0), 16.0), 12.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, 57000000000000.0], N[(N[(beta + 1.0), $MachinePrecision] / N[(beta * N[(beta * N[(beta + 7.0), $MachinePrecision] + 16.0), $MachinePrecision] + 12.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 5.7e13

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.6

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

   5. Applied rewrites 68.6%

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

   6. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1 + \beta}{{\left(2 + \beta\right)}^{2} \cdot \left(3 + \beta\right)}} \]
   7. 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. +-commutative N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 66.9

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

   8. Applied rewrites 66.9%

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

   9. Taylor expanded in beta around 0

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

       1. +-commutative N/A

          \[\leadsto \frac{\beta + 1}{\color{blue}{\beta \cdot \left(16 + \beta \cdot \left(7 + \beta\right)\right) + 12}} \]

       2. lower-fma.f64 N/A

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

       3. +-commutative N/A

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

       4. lower-fma.f64 N/A

          \[\leadsto \frac{\beta + 1}{\mathsf{fma}\left(\beta, \color{blue}{\mathsf{fma}\left(\beta, 7 + \beta, 16\right)}, 12\right)} \]

       5. +-commutative N/A

          \[\leadsto \frac{\beta + 1}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \color{blue}{\beta + 7}, 16\right), 12\right)} \]

       6. lower-+.f64 66.9

          \[\leadsto \frac{\beta + 1}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \color{blue}{\beta + 7}, 16\right), 12\right)} \]

   11. Applied rewrites 66.9%

       \[\leadsto \frac{\beta + 1}{\color{blue}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \beta + 7, 16\right), 12\right)}} \]

   if 5.7e13 < beta

   1. Initial program 84.9%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 84.2

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

   5. Applied rewrites 84.2%

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

      1. lift-+.f64 N/A

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

      2. associate-/r* N/A

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

      3. div-inv N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. distribute-rgt1-in N/A

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

      8. lift-/.f64 N/A

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

      9. div-inv N/A

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

      10. lift-/.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lower-/.f64 91.1

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

      13. lift-+.f64 N/A

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

      14. lift-/.f64 N/A

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

      15. div-inv N/A

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

      16. lift-/.f64 N/A

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

      17. distribute-rgt1-in N/A

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

      18. +-commutative N/A

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

      19. lift-+.f64 N/A

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

      20. lift-/.f64 N/A

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

      21. div-inv N/A

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

      22. lift-/.f64 91.1

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

   7. Applied rewrites 91.1%

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

4. Final simplification 74.4%

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

Alternative 10: 97.4% accurate, 2.6× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 6.5:\\ \;\;\;\;\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.5)
   (/ 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.5) {
		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.5d0) 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.5) {
		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.5:
		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.5)
		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.5)
		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.5], 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.5

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 67.6%

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

   if 6.5 < beta

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

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

   5. Applied rewrites 82.9%

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

      1. lift-+.f64 N/A

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

      2. associate-/r* N/A

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

      3. div-inv N/A

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

      4. lift-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. distribute-rgt1-in N/A

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

      8. lift-/.f64 N/A

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

      9. div-inv N/A

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

      10. lift-/.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lower-/.f64 89.5

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

      13. lift-+.f64 N/A

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

      14. lift-/.f64 N/A

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

      15. div-inv N/A

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

      16. lift-/.f64 N/A

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

      17. distribute-rgt1-in N/A

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

      18. +-commutative N/A

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

      19. lift-+.f64 N/A

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

      20. lift-/.f64 N/A

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

      21. div-inv N/A

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

      22. lift-/.f64 89.5

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

   7. Applied rewrites 89.5%

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

4. Final simplification 74.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 6.5:\\ \;\;\;\;\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 11: 94.6% accurate, 2.6× speedup

Math

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 4.0) {
		tmp = 0.25 / (1.0 + ((beta + alpha) + 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 <= 4.0d0) then
        tmp = 0.25d0 / (1.0d0 + ((beta + alpha) + 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 <= 4.0) {
		tmp = 0.25 / (1.0 + ((beta + alpha) + 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 <= 4.0:
		tmp = 0.25 / (1.0 + ((beta + alpha) + 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 <= 4.0)
		tmp = Float64(0.25 / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0)));
	else
		tmp = Float64(Float64(alpha + 1.0) / Float64(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 <= 4.0)
		tmp = 0.25 / (1.0 + ((beta + alpha) + 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, 4.0], N[(0.25 / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 4

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 67.6%

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

   if 4 < beta

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 89.6

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

   5. Applied rewrites 89.6%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-/l/ N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 87.7

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lift-*.f64 N/A

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

      13. metadata-eval N/A

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

      14. associate-+l+ N/A

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

      15. lift-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. associate-+r+ N/A

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

      18. lift-+.f64 N/A

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

      19. lift-+.f64 87.7

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

   7. Applied rewrites 87.7%

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

4. Final simplification 74.1%

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

Alternative 12: 94.6% accurate, 2.9× speedup

Math

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.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. Taylor expanded in alpha around 0

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 67.6%

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

   if 4.20000000000000018 < beta

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 89.6

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

   5. Applied rewrites 89.6%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-/l/ N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 87.7

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lift-*.f64 N/A

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

      13. metadata-eval N/A

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

      14. associate-+l+ N/A

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

      15. lift-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. associate-+r+ N/A

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

      18. lift-+.f64 N/A

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

      19. lift-+.f64 87.7

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

   7. Applied rewrites 87.7%

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

   8. Taylor expanded in alpha around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 82.9

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

   10. Applied rewrites 82.9%

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

4. Final simplification 72.5%

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

Alternative 13: 94.1% accurate, 2.9× speedup

Math

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.39999999999999991

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \color{blue}{\frac{\frac{1}{4}}{3 + \alpha}} \]
   7. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 67.0

         \[\leadsto \frac{0.25}{\color{blue}{3 + \alpha}} \]

   8. Applied rewrites 67.0%

      \[\leadsto \color{blue}{\frac{0.25}{3 + \alpha}} \]

   if 2.39999999999999991 < beta

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 89.6

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

   5. Applied rewrites 89.6%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-/l/ N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 87.7

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

      10. lift-+.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. lift-*.f64 N/A

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

      13. metadata-eval N/A

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

      14. associate-+l+ N/A

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

      15. lift-+.f64 N/A

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

      16. metadata-eval N/A

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

      17. associate-+r+ N/A

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

      18. lift-+.f64 N/A

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

      19. lift-+.f64 87.7

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

   7. Applied rewrites 87.7%

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

   8. Taylor expanded in alpha around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 82.9

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

   10. Applied rewrites 82.9%

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

4. Final simplification 72.1%

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

Alternative 14: 94.0% accurate, 3.2× speedup

Math

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 4.0) {
		tmp = 0.25 / (alpha + 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 <= 4.0d0) then
        tmp = 0.25d0 / (alpha + 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 <= 4.0) {
		tmp = 0.25 / (alpha + 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 <= 4.0:
		tmp = 0.25 / (alpha + 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 <= 4.0)
		tmp = Float64(0.25 / Float64(alpha + 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 <= 4.0)
		tmp = 0.25 / (alpha + 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, 4.0], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 4

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \color{blue}{\frac{\frac{1}{4}}{3 + \alpha}} \]
   7. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 67.0

         \[\leadsto \frac{0.25}{\color{blue}{3 + \alpha}} \]

   8. Applied rewrites 67.0%

      \[\leadsto \color{blue}{\frac{0.25}{3 + \alpha}} \]

   if 4 < beta

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

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

   5. Applied rewrites 82.9%

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

4. Final simplification 72.1%

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

Alternative 15: 91.4% accurate, 3.2× speedup

Math

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.35000000000000009

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \color{blue}{\frac{\frac{1}{4}}{3 + \alpha}} \]
   7. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 67.0

         \[\leadsto \frac{0.25}{\color{blue}{3 + \alpha}} \]

   8. Applied rewrites 67.0%

      \[\leadsto \color{blue}{\frac{0.25}{3 + \alpha}} \]

   if 2.35000000000000009 < beta

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 89.6

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

   5. Applied rewrites 89.6%

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

   6. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 79.6

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

   8. Applied rewrites 79.6%

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

4. Final simplification 71.0%

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

Alternative 16: 91.4% accurate, 3.6× speedup

Math

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

C

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 3.5:
		tmp = 0.25 / (alpha + 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 <= 3.5)
		tmp = Float64(0.25 / Float64(alpha + 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 <= 3.5)
		tmp = 0.25 / (alpha + 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, 3.5], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 3.5

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in beta around 0

      \[\leadsto \color{blue}{\frac{\frac{1}{4}}{3 + \alpha}} \]
   7. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-+.f64 67.0

         \[\leadsto \frac{0.25}{\color{blue}{3 + \alpha}} \]

   8. Applied rewrites 67.0%

      \[\leadsto \color{blue}{\frac{0.25}{3 + \alpha}} \]

   if 3.5 < beta

   1. Initial program 85.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 alpha around 0

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 85.8

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

   5. Applied rewrites 85.8%

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

   6. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 79.5

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

   8. Applied rewrites 79.5%

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

4. Final simplification 71.0%

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

Alternative 17: 47.5% accurate, 4.4× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.7:\\ \;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, -0.011574074074074073, -0.027777777777777776\right), 0.08333333333333333\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 1.7)
   (fma
    beta
    (fma beta -0.011574074074074073 -0.027777777777777776)
    0.08333333333333333)
   (/ 1.0 beta)))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 1.7) {
		tmp = fma(beta, fma(beta, -0.011574074074074073, -0.027777777777777776), 0.08333333333333333);
	} else {
		tmp = 1.0 / beta;
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.69999999999999996

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1 + \beta}{{\left(2 + \beta\right)}^{2} \cdot \left(3 + \beta\right)}} \]
   7. 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. +-commutative N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 66.3

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

   8. Applied rewrites 66.3%

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

   9. Taylor expanded in beta around 0

      \[\leadsto \color{blue}{\frac{1}{12} + \beta \cdot \left(\frac{-5}{432} \cdot \beta - \frac{1}{36}\right)} \]
   10. Step-by-step derivation

       1. +-commutative N/A

          \[\leadsto \color{blue}{\beta \cdot \left(\frac{-5}{432} \cdot \beta - \frac{1}{36}\right) + \frac{1}{12}} \]

       2. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(\beta, \frac{-5}{432} \cdot \beta - \frac{1}{36}, \frac{1}{12}\right)} \]

       3. sub-neg N/A

          \[\leadsto \mathsf{fma}\left(\beta, \color{blue}{\frac{-5}{432} \cdot \beta + \left(\mathsf{neg}\left(\frac{1}{36}\right)\right)}, \frac{1}{12}\right) \]

       4. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(\beta, \color{blue}{\beta \cdot \frac{-5}{432}} + \left(\mathsf{neg}\left(\frac{1}{36}\right)\right), \frac{1}{12}\right) \]

       5. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(\beta, \beta \cdot \frac{-5}{432} + \color{blue}{\frac{-1}{36}}, \frac{1}{12}\right) \]

       6. lower-fma.f64 66.3

          \[\leadsto \mathsf{fma}\left(\beta, \color{blue}{\mathsf{fma}\left(\beta, -0.011574074074074073, -0.027777777777777776\right)}, 0.08333333333333333\right) \]

   11. Applied rewrites 66.3%

       \[\leadsto \color{blue}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, -0.011574074074074073, -0.027777777777777776\right), 0.08333333333333333\right)} \]

   if 1.69999999999999996 < beta

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 89.6

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

   5. Applied rewrites 89.6%

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

   6. Taylor expanded in alpha around inf

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

      1. lower-/.f64 7.0

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

   8. Applied rewrites 7.0%

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

Alternative 18: 47.3% accurate, 4.7× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.9:\\ \;\;\;\;\mathsf{fma}\left(\beta, -0.027777777777777776, 0.08333333333333333\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 2.9)
   (fma beta -0.027777777777777776 0.08333333333333333)
   (/ 1.0 beta)))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.9) {
		tmp = fma(beta, -0.027777777777777776, 0.08333333333333333);
	} else {
		tmp = 1.0 / beta;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.89999999999999991

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 68.0

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

   5. Applied rewrites 68.0%

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

   6. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1 + \beta}{{\left(2 + \beta\right)}^{2} \cdot \left(3 + \beta\right)}} \]
   7. 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. +-commutative N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-+.f64 N/A

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

      11. lower-+.f64 66.3

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

   8. Applied rewrites 66.3%

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

   9. Taylor expanded in beta around 0

      \[\leadsto \color{blue}{\frac{1}{12} + \frac{-1}{36} \cdot \beta} \]
   10. Step-by-step derivation

       1. +-commutative N/A

          \[\leadsto \color{blue}{\frac{-1}{36} \cdot \beta + \frac{1}{12}} \]

       2. *-commutative N/A

          \[\leadsto \color{blue}{\beta \cdot \frac{-1}{36}} + \frac{1}{12} \]

       3. lower-fma.f64 66.0

          \[\leadsto \color{blue}{\mathsf{fma}\left(\beta, -0.027777777777777776, 0.08333333333333333\right)} \]

   11. Applied rewrites 66.0%

       \[\leadsto \color{blue}{\mathsf{fma}\left(\beta, -0.027777777777777776, 0.08333333333333333\right)} \]

   if 2.89999999999999991 < beta

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 89.6

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

   5. Applied rewrites 89.6%

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

   6. Taylor expanded in alpha around inf

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

      1. lower-/.f64 7.0

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

   8. Applied rewrites 7.0%

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

Alternative 19: 45.7% accurate, 5.6× speedup

Math

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

FPCore

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	return 0.25 / (alpha + 3.0);
}

Fortran

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

Java

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	return 0.25 / (alpha + 3.0)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.2%

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

   2. lower-+.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 N/A

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

   7. +-commutative N/A

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

   8. lower-+.f64 73.7

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

5. Applied rewrites 73.7%

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

6. Taylor expanded in beta around 0

   \[\leadsto \color{blue}{\frac{\frac{1}{4}}{3 + \alpha}} \]
7. Step-by-step derivation

   1. lower-/.f64 N/A

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

   2. lower-+.f64 47.0

      \[\leadsto \frac{0.25}{\color{blue}{3 + \alpha}} \]

8. Applied rewrites 47.0%

   \[\leadsto \color{blue}{\frac{0.25}{3 + \alpha}} \]

9. Final simplification 47.0%

   \[\leadsto \frac{0.25}{\alpha + 3} \]
10. Add Preprocessing

Alternative 20: 45.1% accurate, 84.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.2%

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

   2. lower-+.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 N/A

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

   7. +-commutative N/A

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

   8. lower-+.f64 73.7

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

5. Applied rewrites 73.7%

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

6. Taylor expanded in alpha around 0

   \[\leadsto \color{blue}{\frac{1 + \beta}{{\left(2 + \beta\right)}^{2} \cdot \left(3 + \beta\right)}} \]
7. 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. +-commutative N/A

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

   3. lower-+.f64 N/A

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

   4. lower-*.f64 N/A

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

   5. unpow2 N/A

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

   6. lower-*.f64 N/A

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

   7. +-commutative N/A

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

   8. lower-+.f64 N/A

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

   9. +-commutative N/A

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

   10. lower-+.f64 N/A

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

   11. lower-+.f64 70.0

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

8. Applied rewrites 70.0%

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

9. Taylor expanded in beta around 0

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

11. Applied rewrites 45.7%

    \[\leadsto \color{blue}{0.08333333333333333} \]
12. Add Preprocessing

Alternative 21: 11.8% accurate, 84.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.2%

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

   2. lower-+.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 N/A

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

   7. +-commutative N/A

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

   8. lower-+.f64 73.7

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

5. Applied rewrites 73.7%

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

6. Taylor expanded in alpha around 0

   \[\leadsto \color{blue}{\frac{1 + \beta}{{\left(2 + \beta\right)}^{2} \cdot \left(3 + \beta\right)}} \]
7. 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. +-commutative N/A

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

   3. lower-+.f64 N/A

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

   4. lower-*.f64 N/A

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

   5. unpow2 N/A

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

   6. lower-*.f64 N/A

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

   7. +-commutative N/A

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

   8. lower-+.f64 N/A

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

   9. +-commutative N/A

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

   10. lower-+.f64 N/A

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

   11. lower-+.f64 70.0

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

8. Applied rewrites 70.0%

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

9. Taylor expanded in beta around 0

   \[\leadsto \frac{\beta + 1}{\color{blue}{12 + 16 \cdot \beta}} \]
10. Step-by-step derivation

    1. +-commutative N/A

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

    2. *-commutative N/A

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

    3. lower-fma.f64 46.1

       \[\leadsto \frac{\beta + 1}{\color{blue}{\mathsf{fma}\left(\beta, 16, 12\right)}} \]

11. Applied rewrites 46.1%

    \[\leadsto \frac{\beta + 1}{\color{blue}{\mathsf{fma}\left(\beta, 16, 12\right)}} \]

12. Taylor expanded in beta around inf

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

14. Applied rewrites 11.7%

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

Reproduce

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