Octave 3.8, jcobi/3

Percentage Accurate: 94.5% → 99.9%

Time: 8.8s

Alternatives: 22

Speedup: 1.7×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    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.5% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    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.9% accurate, 0.5× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 5e12

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

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

      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. +-commutative N/A

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

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

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

      7. metadata-eval N/A

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

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

      11. div-add N/A

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

      12. lift-*.f64 N/A

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

      13. *-rgt-identity N/A

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

      14. times-frac N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied rewrites 99.8%

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

   6. Applied rewrites 92.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate-+l+ N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. associate--l+ N/A

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

      8. lower-+.f64 N/A

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

      9. metadata-eval N/A

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

      10. lift-*.f64 N/A

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

      11. lower--.f64 92.9

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

      12. lift-*.f64 N/A

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

      13. metadata-eval 92.9

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

   8. Applied rewrites 92.9%

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

   if 5e12 < beta

   1. Initial program 81.6%

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

      1. lift-/.f64 N/A

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

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

      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. +-commutative N/A

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

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

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

      7. metadata-eval N/A

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

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

      11. div-add N/A

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

      12. lift-*.f64 N/A

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

      13. *-rgt-identity N/A

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

      14. times-frac N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied rewrites 99.8%

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

      1. lift-/.f64 N/A

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

      2. /-rgt-identity 99.8

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

   6. Applied rewrites 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. associate-+l+ N/A

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

      6. metadata-eval N/A

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

      7. lower-+.f64 99.8

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

   8. Applied rewrites 99.8%

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

   9. Taylor expanded in beta around inf

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

       1. lower--.f64 N/A

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

       2. lower-/.f64 99.8

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

   11. Applied rewrites 99.8%

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

4. Final simplification 94.9%

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

Alternative 2: 99.8% 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 := \left(\alpha + \beta\right) + 2\\ \frac{\frac{\mathsf{fma}\left(\frac{\beta}{t\_0}, \alpha, \frac{\left(\beta + \alpha\right) + 1}{t\_0}\right)}{t\_1}}{t\_1 + 1} \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ (+ beta alpha) 2.0)) (t_1 (+ (+ alpha beta) 2.0)))
   (/
    (/ (fma (/ beta t_0) alpha (/ (+ (+ beta alpha) 1.0) t_0)) t_1)
    (+ t_1 1.0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 2.0;
	double t_1 = (alpha + beta) + 2.0;
	return (fma((beta / t_0), alpha, (((beta + alpha) + 1.0) / t_0)) / t_1) / (t_1 + 1.0);
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(beta + alpha) + 2.0)
	t_1 = Float64(Float64(alpha + beta) + 2.0)
	return Float64(Float64(fma(Float64(beta / t_0), alpha, Float64(Float64(Float64(beta + alpha) + 1.0) / t_0)) / t_1) / Float64(t_1 + 1.0))
end

Wolfram

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

Derivation

1. Initial program 94.5%

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

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

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

   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. +-commutative N/A

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

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

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

   7. metadata-eval N/A

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

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

   11. div-add N/A

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

   12. lift-*.f64 N/A

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

   13. *-rgt-identity N/A

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

   14. times-frac N/A

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

   15. lower-fma.f64 N/A

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

4. Applied rewrites 99.8%

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

   1. lift-/.f64 N/A

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

   2. /-rgt-identity 99.8

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

6. Applied rewrites 99.8%

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

7. Final simplification 99.8%

   \[\leadsto \frac{\frac{\mathsf{fma}\left(\frac{\beta}{\left(\beta + \alpha\right) + 2}, \alpha, \frac{\left(\beta + \alpha\right) + 1}{\left(\beta + \alpha\right) + 2}\right)}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + 2\right) + 1} \]
8. Add Preprocessing

Alternative 3: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.7000000000000001e94

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

      2. lift-/.f64 N/A

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

      3. frac-2neg N/A

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

      4. associate-/l/ N/A

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

      5. lower-/.f64 N/A

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

      6. lower-neg.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lower-fma.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower-*.f64 N/A

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

   4. Applied rewrites 99.2%

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

   if 1.7000000000000001e94 < beta

   1. Initial program 77.8%

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

   3. Taylor expanded in beta around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-+.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. div-add-rev N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. associate-/l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 88.7

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

   5. Applied rewrites 88.7%

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

   7. Applied rewrites 88.7%

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

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

      2. lower--.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. div-add-rev N/A

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

      8. lower-/.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. associate-/l* N/A

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

      11. lower-*.f64 N/A

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

      12. lower-+.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-fma.f64 88.7

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

   10. Applied rewrites 88.7%

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

4. Final simplification 96.7%

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

Alternative 4: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \left(\beta + \alpha\right) + 2\\ \frac{\frac{\mathsf{fma}\left(\frac{\beta}{t\_0}, \alpha, \frac{\left(\beta + \alpha\right) + 1}{t\_0}\right)}{\left(\alpha + \beta\right) + 2}}{\left(\alpha + \beta\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)))
   (/
    (/
     (fma (/ beta t_0) alpha (/ (+ (+ beta alpha) 1.0) t_0))
     (+ (+ alpha beta) 2.0))
    (+ (+ alpha beta) 3.0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 2.0;
	return (fma((beta / t_0), alpha, (((beta + alpha) + 1.0) / t_0)) / ((alpha + beta) + 2.0)) / ((alpha + beta) + 3.0);
}

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(beta + alpha) + 2.0)
	return Float64(Float64(fma(Float64(beta / t_0), alpha, Float64(Float64(Float64(beta + alpha) + 1.0) / t_0)) / Float64(Float64(alpha + beta) + 2.0)) / Float64(Float64(alpha + beta) + 3.0))
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]}, N[(N[(N[(N[(beta / t$95$0), $MachinePrecision] * alpha + N[(N[(N[(beta + alpha), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 94.5%

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

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

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

   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. +-commutative N/A

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

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

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

   7. metadata-eval N/A

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

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

   11. div-add N/A

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

   12. lift-*.f64 N/A

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

   13. *-rgt-identity N/A

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

   14. times-frac N/A

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

   15. lower-fma.f64 N/A

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

4. Applied rewrites 99.8%

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

   1. lift-/.f64 N/A

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

   2. /-rgt-identity 99.8

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

6. Applied rewrites 99.8%

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

   1. lift-+.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. metadata-eval N/A

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

   5. associate-+l+ N/A

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

   6. metadata-eval N/A

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

   7. lower-+.f64 99.8

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

8. Applied rewrites 99.8%

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

9. Final simplification 99.8%

   \[\leadsto \frac{\frac{\mathsf{fma}\left(\frac{\beta}{\left(\beta + \alpha\right) + 2}, \alpha, \frac{\left(\beta + \alpha\right) + 1}{\left(\beta + \alpha\right) + 2}\right)}{\left(\alpha + \beta\right) + 2}}{\left(\alpha + \beta\right) + 3} \]
10. Add Preprocessing

Alternative 5: 99.5% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.7000000000000001e94

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

      2. lift-/.f64 N/A

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

      3. frac-2neg N/A

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

      4. associate-/l/ N/A

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

      5. lower-/.f64 N/A

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

      6. lower-neg.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lower-fma.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower-*.f64 N/A

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

   4. Applied rewrites 99.2%

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

   if 1.7000000000000001e94 < beta

   1. Initial program 77.8%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 88.4

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

   5. Applied rewrites 88.4%

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

   7. Applied rewrites 88.4%

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

4. Final simplification 96.6%

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

Alternative 6: 99.5% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1e27

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

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

      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. +-commutative N/A

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

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

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

      7. metadata-eval N/A

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

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

      11. div-add N/A

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

      12. lift-*.f64 N/A

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

      13. *-rgt-identity N/A

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

      14. times-frac N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied rewrites 99.8%

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

   6. Applied rewrites 92.7%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate-+l+ N/A

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

      4. lift-+.f64 N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. associate--l+ N/A

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

      8. lower-+.f64 N/A

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

      9. metadata-eval N/A

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

      10. lift-*.f64 N/A

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

      11. lower--.f64 92.7

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

      12. lift-*.f64 N/A

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

      13. metadata-eval 92.7

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

   8. Applied rewrites 92.7%

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

   if 1e27 < beta

   1. Initial program 81.1%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 86.3

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

   5. Applied rewrites 86.3%

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

   7. Applied rewrites 86.3%

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

4. Final simplification 90.9%

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

Alternative 7: 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 10^{+27}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) + 1}{t\_0 \cdot \left(\left(3 + \left(\beta + \alpha\right)\right) \cdot t\_0\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha - -1}{2 + \left(\alpha + \beta\right)}}{3 + \left(\alpha + \beta\right)}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1e27

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

      4. lift-/.f64 N/A

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

      5. associate-/l/ N/A

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

      6. lower-/.f64 N/A

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

   4. Applied rewrites 92.7%

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

   if 1e27 < beta

   1. Initial program 81.1%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 86.3

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

   5. Applied rewrites 86.3%

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

   7. Applied rewrites 86.3%

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

4. Final simplification 90.9%

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

Alternative 8: 98.6% accurate, 1.6× speedup

Math

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 4.05d+15) then
        tmp = (((1.0d0 + beta) / (2.0d0 + beta)) / (2.0d0 + beta)) / (3.0d0 + beta)
    else
        tmp = ((alpha - (-1.0d0)) / (2.0d0 + (alpha + beta))) / (3.0d0 + (alpha + beta))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.05e15

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

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

      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. +-commutative N/A

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

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

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

      7. metadata-eval N/A

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

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

      11. div-add N/A

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

      12. lift-*.f64 N/A

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

      13. *-rgt-identity N/A

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

      14. times-frac N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in alpha around 0

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

      1. associate-/r* N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. div-add-rev N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-+.f64 60.7

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

   7. Applied rewrites 60.7%

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

   if 4.05e15 < beta

   1. Initial program 81.6%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 84.8

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

   5. Applied rewrites 84.8%

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

   7. Applied rewrites 84.8%

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

4. Final simplification 67.8%

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

Alternative 9: 98.5% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = 2.0d0 + (alpha + beta)
    t_1 = 3.0d0 + (alpha + beta)
    if (beta <= 5.1d+19) then
        tmp = (1.0d0 + beta) / (t_0 * (t_1 * t_0))
    else
        tmp = ((alpha - (-1.0d0)) / t_0) / t_1
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 5.1e19

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

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

      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. +-commutative N/A

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

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

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

      7. metadata-eval N/A

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

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

      11. div-add N/A

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

      12. lift-*.f64 N/A

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

      13. *-rgt-identity N/A

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

      14. times-frac N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied rewrites 99.8%

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

   6. Applied rewrites 92.8%

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

   7. Taylor expanded in alpha around 0

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

      1. lower-+.f64 77.9

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

   9. Applied rewrites 77.9%

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

   if 5.1e19 < beta

   1. Initial program 81.6%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 84.8

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

   5. Applied rewrites 84.8%

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

   7. Applied rewrites 84.8%

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

4. Final simplification 79.9%

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

Alternative 10: 62.2% accurate, 2.2× speedup

Math

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 4.5e18

   1. Initial program 99.8%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 14.1

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

   5. Applied rewrites 14.1%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 30.1%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 12.6

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

   10. Applied rewrites 12.6%

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

   12. Applied rewrites 12.6%

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

   if 4.5e18 < beta

   1. Initial program 81.6%

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

   3. Taylor expanded in beta around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-+.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. div-add-rev N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. associate-/l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 85.4

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

   5. Applied rewrites 85.4%

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

   7. Applied rewrites 85.4%

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

   8. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 84.5

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

   10. Applied rewrites 84.5%

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

4. Final simplification 33.7%

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

Alternative 11: 62.2% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 3.0d0 + (alpha + beta)
    if (beta <= 1d+27) then
        tmp = (1.0d0 + alpha) / (t_0 * (2.0d0 + (alpha + beta)))
    else
        tmp = ((1.0d0 + alpha) / beta) / t_0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1e27

   1. Initial program 99.8%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 14.2

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

   5. Applied rewrites 14.2%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 30.4%

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

   8. Taylor expanded in alpha around 0

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

   10. Applied rewrites 30.4%

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

   if 1e27 < beta

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-+.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. div-add-rev N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. associate-/l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 86.4

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

   5. Applied rewrites 86.4%

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

   7. Applied rewrites 86.4%

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

   8. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 86.0

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

   10. Applied rewrites 86.0%

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

Alternative 12: 62.2% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 1d+27) then
        tmp = (1.0d0 + alpha) / ((3.0d0 + (alpha + beta)) * (2.0d0 + (alpha + beta)))
    else
        tmp = ((1.0d0 + alpha) / beta) / beta
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1e27

   1. Initial program 99.8%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 14.2

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

   5. Applied rewrites 14.2%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 30.4%

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

   8. Taylor expanded in alpha around 0

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

   10. Applied rewrites 30.4%

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

   if 1e27 < beta

   1. Initial program 81.1%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 76.6

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

   5. Applied rewrites 76.6%

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

   7. Applied rewrites 85.8%

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

4. Final simplification 46.2%

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

Alternative 13: 62.2% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    code = ((alpha - (-1.0d0)) / (3.0d0 + (alpha + beta))) / ((alpha + beta) + 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. lower--.f64 N/A

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

   4. mul-1-neg N/A

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

   5. lower-neg.f64 34.8

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

5. Applied rewrites 34.8%

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

   1. lift-/.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. associate-/l/ N/A

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

   4. lower-/.f64 N/A

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

7. Applied rewrites 44.5%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/r* N/A

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

   4. lift-+.f64 N/A

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

   5. +-commutative N/A

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

   6. metadata-eval N/A

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

   7. lift-*.f64 N/A

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

   8. lift-+.f64 N/A

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

   9. lower-/.f64 N/A

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

9. Applied rewrites 34.8%

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

10. Final simplification 34.8%

    \[\leadsto \frac{\frac{\alpha - -1}{3 + \left(\alpha + \beta\right)}}{\left(\alpha + \beta\right) + 2} \]
11. Add Preprocessing

Alternative 14: 62.2% accurate, 2.2× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    code = ((alpha - (-1.0d0)) / (2.0d0 + (alpha + beta))) / (3.0d0 + (alpha + beta))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. lower--.f64 N/A

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

   4. mul-1-neg N/A

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

   5. lower-neg.f64 34.8

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

5. Applied rewrites 34.8%

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

7. Applied rewrites 34.8%

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

8. Final simplification 34.8%

   \[\leadsto \frac{\frac{\alpha - -1}{2 + \left(\alpha + \beta\right)}}{3 + \left(\alpha + \beta\right)} \]
9. Add Preprocessing

Alternative 15: 61.7% accurate, 2.4× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.5:\\ \;\;\;\;\frac{\alpha - -1}{6}\\ \mathbf{elif}\;\beta \leq 1.35 \cdot 10^{+154}:\\ \;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 2.5)
   (/ (- alpha -1.0) 6.0)
   (if (<= beta 1.35e+154)
     (/ (+ 1.0 alpha) (* beta beta))
     (/ (/ alpha beta) beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.5) {
		tmp = (alpha - -1.0) / 6.0;
	} else if (beta <= 1.35e+154) {
		tmp = (1.0 + alpha) / (beta * beta);
	} else {
		tmp = (alpha / beta) / beta;
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 2.5d0) then
        tmp = (alpha - (-1.0d0)) / 6.0d0
    else if (beta <= 1.35d+154) then
        tmp = (1.0d0 + alpha) / (beta * beta)
    else
        tmp = (alpha / beta) / beta
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.5) {
		tmp = (alpha - -1.0) / 6.0;
	} else if (beta <= 1.35e+154) {
		tmp = (1.0 + alpha) / (beta * beta);
	} else {
		tmp = (alpha / beta) / beta;
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 2.5:
		tmp = (alpha - -1.0) / 6.0
	elif beta <= 1.35e+154:
		tmp = (1.0 + alpha) / (beta * beta)
	else:
		tmp = (alpha / beta) / beta
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.5)
		tmp = Float64(Float64(alpha - -1.0) / 6.0);
	elseif (beta <= 1.35e+154)
		tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta));
	else
		tmp = Float64(Float64(alpha / beta) / beta);
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 2.5)
		tmp = (alpha - -1.0) / 6.0;
	elseif (beta <= 1.35e+154)
		tmp = (1.0 + alpha) / (beta * beta);
	else
		tmp = (alpha / beta) / beta;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if beta < 2.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 beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 14.1

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

   5. Applied rewrites 14.1%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 30.2%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 12.7

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

   10. Applied rewrites 12.7%

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

   11. Taylor expanded in beta around 0

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

   13. Applied rewrites 12.7%

       \[\leadsto \frac{-\left(\left(-\alpha\right) - 1\right)}{6} \]

   if 2.5 < beta < 1.35000000000000003e154

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

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

   5. Applied rewrites 65.8%

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

   if 1.35000000000000003e154 < beta

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

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

   5. Applied rewrites 79.0%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 79.0%

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

   10. Applied rewrites 90.5%

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

4. Final simplification 33.2%

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

Alternative 16: 62.2% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 1d+18) then
        tmp = (alpha - (-1.0d0)) / ((3.0d0 + beta) * (2.0d0 + beta))
    else
        tmp = ((1.0d0 + alpha) / beta) / beta
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1e18

   1. Initial program 99.8%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 14.1

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

   5. Applied rewrites 14.1%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 30.1%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 12.6

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

   10. Applied rewrites 12.6%

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

   if 1e18 < beta

   1. Initial program 81.6%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 75.3

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

   5. Applied rewrites 75.3%

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

   7. Applied rewrites 84.3%

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

4. Final simplification 33.6%

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

Alternative 17: 62.2% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 2.8d+18) then
        tmp = -(-1.0d0) / ((3.0d0 + beta) * (2.0d0 + beta))
    else
        tmp = ((1.0d0 + alpha) / beta) / beta
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.8e18

   1. Initial program 99.8%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 14.1

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

   5. Applied rewrites 14.1%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 30.1%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 12.6

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

   10. Applied rewrites 12.6%

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

   11. Taylor expanded in alpha around 0

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

   13. Applied rewrites 13.1%

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

   if 2.8e18 < beta

   1. Initial program 81.6%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 75.3

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

   5. Applied rewrites 75.3%

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

   7. Applied rewrites 84.3%

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

4. Final simplification 33.9%

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

Alternative 18: 61.2% accurate, 2.7× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (alpha <= 215.0d0) then
        tmp = -(-1.0d0) / ((3.0d0 + beta) * (2.0d0 + beta))
    else
        tmp = (alpha / beta) / beta
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 215

   1. Initial program 99.9%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 44.3

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

   5. Applied rewrites 44.3%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 43.6%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 43.6

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

   10. Applied rewrites 43.6%

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

   11. Taylor expanded in alpha around 0

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

   13. Applied rewrites 43.6%

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

   if 215 < alpha

   1. Initial program 85.5%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 9.4

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

   5. Applied rewrites 9.4%

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

   6. Taylor expanded in alpha around inf

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

   8. Applied rewrites 8.7%

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

   10. Applied rewrites 14.5%

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

4. Final simplification 32.6%

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

Alternative 19: 59.5% accurate, 3.2× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 2.5d0) then
        tmp = (alpha - (-1.0d0)) / 6.0d0
    else
        tmp = (1.0d0 + alpha) / (beta * beta)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.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 beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 14.1

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

   5. Applied rewrites 14.1%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 30.2%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 12.7

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

   10. Applied rewrites 12.7%

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

   11. Taylor expanded in beta around 0

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

   13. Applied rewrites 12.7%

       \[\leadsto \frac{-\left(\left(-\alpha\right) - 1\right)}{6} \]

   if 2.5 < beta

   1. Initial program 81.8%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 74.3

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

   5. Applied rewrites 74.3%

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

4. Final simplification 31.0%

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

Alternative 20: 56.8% accurate, 3.6× speedup

Math

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 2.3d0) then
        tmp = (alpha - (-1.0d0)) / 6.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 <= 2.3) {
		tmp = (alpha - -1.0) / 6.0;
	} else {
		tmp = 1.0 / (beta * beta);
	}
	return tmp;
}

Python

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.3)
		tmp = Float64(Float64(alpha - -1.0) / 6.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 <= 2.3)
		tmp = (alpha - -1.0) / 6.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, 2.3], N[(N[(alpha - -1.0), $MachinePrecision] / 6.0), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.2999999999999998

   1. Initial program 99.8%

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

   3. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower--.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 14.1

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

   5. Applied rewrites 14.1%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

   7. Applied rewrites 30.2%

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

   8. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-+.f64 12.7

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

   10. Applied rewrites 12.7%

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

   11. Taylor expanded in beta around 0

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

   13. Applied rewrites 12.7%

       \[\leadsto \frac{-\left(\left(-\alpha\right) - 1\right)}{6} \]

   if 2.2999999999999998 < beta

   1. Initial program 81.8%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 74.3

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

   5. Applied rewrites 74.3%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 73.0%

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

4. Final simplification 30.6%

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

Alternative 21: 50.2% accurate, 4.9× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    code = 1.0d0 / (beta * beta)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.5%

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

3. Taylor expanded in beta around inf

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 24.4

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

5. Applied rewrites 24.4%

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

6. Taylor expanded in alpha around 0

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

8. Applied rewrites 24.1%

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

9. Final simplification 24.1%

   \[\leadsto \frac{1}{\beta \cdot \beta} \]
10. Add Preprocessing

Alternative 22: 31.7% accurate, 4.9× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(alpha, beta)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    code = alpha / (beta * beta)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.5%

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

3. Taylor expanded in beta around inf

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 24.4

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

5. Applied rewrites 24.4%

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

6. Taylor expanded in alpha around inf

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

8. Applied rewrites 17.8%

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

9. Final simplification 17.8%

   \[\leadsto \frac{\alpha}{\beta \cdot \beta} \]
10. Add Preprocessing

Reproduce

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