Octave 3.8, jcobi/3

Percentage Accurate: 94.7% → 99.7%

Time: 12.0s

Alternatives: 14

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.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.8999999999999998e116

   1. Initial program 99.7%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-commutative N/A

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

   4. Applied rewrites 99.8%

      \[\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 4.8999999999999998e116 < beta

   1. Initial program 84.5%

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

   3. Taylor expanded in beta around inf

      \[\leadsto \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 99.9%

      \[\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} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.8%

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.8999999999999998e116

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. metadata-eval N/A

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

      12. *-commutative N/A

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

   4. Applied rewrites 99.8%

      \[\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 4.8999999999999998e116 < beta

   1. Initial program 86.1%

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

   3. Taylor expanded in beta around inf

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

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

   5. Applied rewrites 99.1%

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

      1. lift-/.f64 N/A

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

      2. div-inv N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. metadata-eval N/A

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

      6. clear-num N/A

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

      7. frac-times N/A

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

      8. metadata-eval N/A

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

   7. Applied rewrites 97.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. clear-num N/A

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

      6. un-div-inv N/A

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

      7. clear-num N/A

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

      8. lower-/.f64 N/A

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

   9. Applied rewrites 99.1%

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

4. Final simplification 99.5%

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

Reproduce

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