Octave 3.8, jcobi/3

Percentage Accurate: 93.8% → 99.6%

Time: 5.1s

Alternatives: 17

Speedup: 3.2×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.00000000000000003e100

   1. Initial program 98.3%

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

      1. lift-/.f64 N/A

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

   4. Applied rewrites 98.0%

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

   if 2.00000000000000003e100 < beta

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

   5. Applied rewrites 92.2%

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

4. Final simplification 96.7%

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

Alternative 2: 99.6% accurate, 1.0× speedup

Math

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

C

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(Float64(beta + alpha) + 2.0)
	tmp = 0.0
	if (beta <= 2e+100)
		tmp = Float64(Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) + 1.0) / t_0) / Float64(t_0 * Float64(3.0 + Float64(beta + alpha))));
	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(Float64(Float64(alpha + beta) + 2.0) + 1.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.00000000000000003e100

   1. Initial program 98.3%

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

      1. lift-/.f64 N/A

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

   4. Applied rewrites 98.0%

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

   if 2.00000000000000003e100 < beta

   1. Initial program 81.5%

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

   3. Taylor expanded in beta around inf

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

   5. Applied rewrites 92.1%

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

4. Final simplification 96.7%

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

Alternative 3: 99.5% accurate, 1.3× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.00000000000000003e100

   1. Initial program 98.3%

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

      1. lift-/.f64 N/A

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

   4. Applied rewrites 98.0%

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

   if 2.00000000000000003e100 < beta

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

   5. Applied rewrites 92.3%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

   7. Applied rewrites 92.3%

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

Alternative 4: 98.1% accurate, 1.6× speedup

Math

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 5.0000000000000004e43

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.5

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

   4. Applied rewrites 99.5%

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

   7. Applied rewrites 69.6%

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

   9. Applied rewrites 69.6%

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

   if 5.0000000000000004e43 < beta

   1. Initial program 82.6%

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

   3. Taylor expanded in beta around inf

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

   5. Applied rewrites 84.5%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

   7. Applied rewrites 84.5%

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

Alternative 5: 98.3% accurate, 1.6× speedup

Math

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 6e15

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

   4. Applied rewrites 99.6%

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

   5. Taylor expanded in alpha around 0

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

   7. Applied rewrites 84.0%

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

   if 6e15 < beta

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

   5. Applied rewrites 84.2%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

   7. Applied rewrites 84.2%

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

4. Final simplification 84.1%

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

Alternative 6: 97.7% accurate, 1.8× speedup

Math

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

C

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = (alpha + beta) + 2.0
	t_1 = t_0 + 1.0
	tmp = 0
	if beta <= 1.35:
		tmp = (0.25 + (-0.0625 * (beta * beta))) / t_1
	else:
		tmp = ((1.0 + alpha) / t_0) / t_1
	return tmp

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.3500000000000001

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 70.3%

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

   if 1.3500000000000001 < beta

   1. Initial program 84.1%

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

   3. Taylor expanded in beta around inf

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

   5. Applied rewrites 82.5%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

   7. Applied rewrites 82.5%

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

4. Final simplification 74.5%

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

Alternative 7: 97.6% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.44999999999999996

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 70.3%

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

   if 1.44999999999999996 < beta

   1. Initial program 84.1%

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

   3. Taylor expanded in beta around inf

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

   5. Applied rewrites 82.5%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 82.1%

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

   9. Taylor expanded in alpha around 0

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

   11. Applied rewrites 81.9%

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

4. Final simplification 74.3%

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

Alternative 8: 97.5% accurate, 2.2× speedup

Math

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

FPCore

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.4) {
		tmp = 0.25 / (((alpha + beta) + 2.0) + 1.0);
	} else {
		tmp = ((1.0 + alpha) / (2.0 + beta)) / (3.0 + 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.4d0) then
        tmp = 0.25d0 / (((alpha + beta) + 2.0d0) + 1.0d0)
    else
        tmp = ((1.0d0 + alpha) / (2.0d0 + beta)) / (3.0d0 + beta)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.39999999999999991

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 70.1%

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

   if 2.39999999999999991 < beta

   1. Initial program 84.1%

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

   3. Taylor expanded in beta around inf

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

   5. Applied rewrites 82.5%

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

   6. Taylor expanded in alpha around 0

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

   8. Applied rewrites 82.1%

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

   9. Taylor expanded in alpha around 0

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

   11. Applied rewrites 81.9%

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

4. Final simplification 74.1%

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

Alternative 9: 97.4% accurate, 2.2× speedup

Math

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

C

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 4.4:
		tmp = 0.25 / (((alpha + beta) + 2.0) + 1.0)
	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.4)
		tmp = Float64(0.25 / Float64(Float64(Float64(alpha + beta) + 2.0) + 1.0));
	else
		tmp = Float64(Float64(Float64(1.0 + 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.4)
		tmp = 0.25 / (((alpha + beta) + 2.0) + 1.0);
	else
		tmp = ((1.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.4], N[(0.25 / N[(N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision] + 1.0), $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.4000000000000004

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 70.1%

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

   if 4.4000000000000004 < beta

   1. Initial program 84.1%

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

   3. Taylor expanded in beta around inf

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

   5. Applied rewrites 82.5%

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

   6. Taylor expanded in beta around inf

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

   8. Applied rewrites 82.0%

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

   9. Taylor expanded in alpha around 0

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

   11. Applied rewrites 82.0%

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

4. Final simplification 74.2%

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

Alternative 10: 97.4% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 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. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 70.1%

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

   if 5 < beta

   1. Initial program 84.1%

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

   3. Taylor expanded in beta around inf

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

   5. Applied rewrites 82.5%

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

   6. Taylor expanded in beta around inf

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

   8. Applied rewrites 82.0%

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

   9. Taylor expanded in alpha around 0

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

   11. Applied rewrites 81.8%

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

4. Final simplification 74.1%

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

Alternative 11: 97.4% accurate, 2.6× speedup

Math

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

C

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 6.8:
		tmp = 0.25 / (((alpha + beta) + 2.0) + 1.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 <= 6.8)
		tmp = Float64(0.25 / Float64(Float64(Float64(alpha + beta) + 2.0) + 1.0));
	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 <= 6.8)
		tmp = 0.25 / (((alpha + beta) + 2.0) + 1.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, 6.8], N[(0.25 / N[(N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 6.79999999999999982

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 70.1%

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

   if 6.79999999999999982 < beta

   1. Initial program 84.1%

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

   3. Taylor expanded in beta around inf

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

   5. Applied rewrites 82.5%

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

   6. Taylor expanded in beta around inf

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

   8. Applied rewrites 82.0%

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

   9. Taylor expanded in beta around inf

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

   11. Applied rewrites 81.7%

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

4. Final simplification 74.1%

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

Alternative 12: 94.2% accurate, 2.7× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.2:\\ \;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot \left(0.024691358024691357 \cdot \beta - 0.011574074074074073\right) - 0.027777777777777776\right)\\ \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.2)
   (+
    0.08333333333333333
    (*
     beta
     (-
      (* beta (- (* 0.024691358024691357 beta) 0.011574074074074073))
      0.027777777777777776)))
   (/ (+ 1.0 alpha) (* beta beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.2) {
		tmp = 0.08333333333333333 + (beta * ((beta * ((0.024691358024691357 * beta) - 0.011574074074074073)) - 0.027777777777777776));
	} 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.2d0) then
        tmp = 0.08333333333333333d0 + (beta * ((beta * ((0.024691358024691357d0 * beta) - 0.011574074074074073d0)) - 0.027777777777777776d0))
    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.2) {
		tmp = 0.08333333333333333 + (beta * ((beta * ((0.024691358024691357 * beta) - 0.011574074074074073)) - 0.027777777777777776));
	} else {
		tmp = (1.0 + alpha) / (beta * beta);
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 2.2:
		tmp = 0.08333333333333333 + (beta * ((beta * ((0.024691358024691357 * beta) - 0.011574074074074073)) - 0.027777777777777776))
	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.2)
		tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * Float64(Float64(0.024691358024691357 * beta) - 0.011574074074074073)) - 0.027777777777777776)));
	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.2)
		tmp = 0.08333333333333333 + (beta * ((beta * ((0.024691358024691357 * beta) - 0.011574074074074073)) - 0.027777777777777776));
	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.2], N[(0.08333333333333333 + N[(beta * N[(N[(beta * N[(N[(0.024691358024691357 * beta), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.2000000000000002

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 69.3%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 69.3%

       \[\leadsto 0.08333333333333333 + \color{blue}{\beta \cdot \left(\beta \cdot \left(0.024691358024691357 \cdot \beta - 0.011574074074074073\right) - 0.027777777777777776\right)} \]

   if 2.2000000000000002 < beta

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

   5. Applied rewrites 77.2%

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

Alternative 13: 94.5% accurate, 3.1× speedup

Math

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

C

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

Python

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

Derivation

1. Split input into 2 regimes

2. if beta < 6.79999999999999982

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 70.1%

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

   if 6.79999999999999982 < beta

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

   5. Applied rewrites 77.2%

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

4. Final simplification 72.5%

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

Alternative 14: 94.1% accurate, 3.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.7:\\ \;\;\;\;0.08333333333333333 + \beta \cdot \left(-0.011574074074074073 \cdot \beta - 0.027777777777777776\right)\\ \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 1.7)
   (+
    0.08333333333333333
    (* beta (- (* -0.011574074074074073 beta) 0.027777777777777776)))
   (/ (+ 1.0 alpha) (* beta beta))))

C

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 1.7:
		tmp = 0.08333333333333333 + (beta * ((-0.011574074074074073 * beta) - 0.027777777777777776))
	else:
		tmp = (1.0 + alpha) / (beta * beta)
	return tmp

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.69999999999999996

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 69.3%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 69.0%

       \[\leadsto 0.08333333333333333 + \color{blue}{\beta \cdot \left(-0.011574074074074073 \cdot \beta - 0.027777777777777776\right)} \]

   if 1.69999999999999996 < beta

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

   5. Applied rewrites 77.2%

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

Alternative 15: 91.5% accurate, 3.6× speedup

Math

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

FPCore

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

C

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

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 1.7:
		tmp = 0.08333333333333333 + (beta * ((-0.011574074074074073 * beta) - 0.027777777777777776))
	else:
		tmp = 1.0 / (beta * beta)
	return tmp

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.69999999999999996

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 69.3%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 69.0%

       \[\leadsto 0.08333333333333333 + \color{blue}{\beta \cdot \left(-0.011574074074074073 \cdot \beta - 0.027777777777777776\right)} \]

   if 1.69999999999999996 < beta

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

   5. Applied rewrites 77.2%

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

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

Alternative 16: 91.4% accurate, 3.6× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.8:\\ \;\;\;\;0.08333333333333333 + -0.027777777777777776 \cdot \beta\\ \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.8)
   (+ 0.08333333333333333 (* -0.027777777777777776 beta))
   (/ 1.0 (* beta beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.8) {
		tmp = 0.08333333333333333 + (-0.027777777777777776 * beta);
	} 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.8d0) then
        tmp = 0.08333333333333333d0 + ((-0.027777777777777776d0) * beta)
    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.8) {
		tmp = 0.08333333333333333 + (-0.027777777777777776 * beta);
	} else {
		tmp = 1.0 / (beta * beta);
	}
	return tmp;
}

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.7999999999999998

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. metadata-eval N/A

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

      5. flip-+ N/A

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

      6. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   7. Applied rewrites 69.3%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 68.9%

       \[\leadsto 0.08333333333333333 + \color{blue}{-0.027777777777777776 \cdot \beta} \]

   if 2.7999999999999998 < beta

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

   5. Applied rewrites 77.2%

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

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

Alternative 17: 44.8% accurate, 84.0× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
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 = 0.08333333333333333d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.4%

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

   1. lift-+.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. metadata-eval N/A

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

   5. flip-+ N/A

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

   6. lower-/.f64 N/A

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

   9. lower-*.f64 N/A

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

   10. +-commutative N/A

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

   12. +-commutative N/A

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

   13. lower-+.f64 N/A

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

   14. lower--.f64 N/A

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

   15. +-commutative N/A

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

   16. lower-+.f64 92.6

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

4. Applied rewrites 92.6%

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

7. Applied rewrites 67.1%

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

8. Taylor expanded in beta around 0

   \[\leadsto \frac{1}{12} \]
9. Step-by-step derivation

10. Applied rewrites 46.1%

    \[\leadsto 0.08333333333333333 \]
11. Add Preprocessing

Reproduce

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