Octave 3.8, jcobi/3

Percentage Accurate: 94.5% → 99.6%

Time: 3.7s

Alternatives: 16

Speedup: 2.0×

Specification

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

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 94.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.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 \cdot 1\\ t_1 := t\_0 + 1\\ \mathbf{if}\;\beta \leq 2 \cdot 10^{+141}:\\ \;\;\;\;\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_1}\\ \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\_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 1.0))) (t_1 (+ t_0 1.0)))
   (if (<= beta 2e+141)
     (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) t_1)
     (/
      (/
       (-
        (+ (+ (/ (+ 1.0 alpha) beta) alpha) 1.0)
        (* (+ 1.0 alpha) (/ (+ 2.0 alpha) beta)))
       t_0)
      t_1))))

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.00000000000000003e141

   1. Initial program 94.5%

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

   if 2.00000000000000003e141 < beta

   1. Initial program 94.5%

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

   2. 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} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-+.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. div-add-rev N/A

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

      7. lower-/.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. associate-/l* N/A

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

      10. div-add N/A

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

      11. metadata-eval N/A

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

      12. associate-*r/ N/A

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

      15. associate-*r/ N/A

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

      16. metadata-eval N/A

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

      17. div-add N/A

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

      18. lower-/.f64 N/A

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

   4. Applied rewrites 55.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. Add Preprocessing

Alternative 2: 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 \cdot 1\\ t_1 := t\_0 + 1\\ \mathbf{if}\;\beta \leq 2 \cdot 10^{+141}:\\ \;\;\;\;\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\left(\frac{1 + \alpha}{\beta} + \alpha\right) + 1\right) - \left(1 + \alpha\right) \cdot \frac{\mathsf{fma}\left(2, \alpha, 4\right)}{\beta}}{\beta}}{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 1.0))) (t_1 (+ t_0 1.0)))
   (if (<= beta 2e+141)
     (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) t_1)
     (/
      (/
       (-
        (+ (+ (/ (+ 1.0 alpha) beta) alpha) 1.0)
        (* (+ 1.0 alpha) (/ (fma 2.0 alpha 4.0) beta)))
       beta)
      t_1))))

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 2.00000000000000003e141

   1. Initial program 94.5%

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

   if 2.00000000000000003e141 < beta

   1. Initial program 94.5%

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

   2. 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} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

   4. Applied rewrites 54.7%

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

Alternative 3: 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^{+141}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) + 1}{t\_0 \cdot t\_0}}{3 + \left(\beta + \alpha\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 \cdot 1\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+141)
     (/
      (/ (+ (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)) 1.0)))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = (beta + alpha) + 2.0;
	double tmp;
	if (beta <= 2e+141) {
		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)) + 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+141)
		tmp = Float64(Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) + 1.0) / Float64(t_0 * 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) + Float64(2.0 * 1.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+141], N[(N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $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] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.00000000000000003e141

   1. Initial program 94.5%

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

   3. Applied rewrites 93.1%

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

   if 2.00000000000000003e141 < beta

   1. Initial program 94.5%

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

   2. 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} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

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

   4. Applied rewrites 54.7%

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

Alternative 4: 99.5% accurate, 1.2× 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^{+141}:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(\beta, \alpha, \beta + \alpha\right) + 1}{t\_1 \cdot t\_1}}{3 + \left(\beta + \alpha\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{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+141)
     (/
      (/ (+ (fma beta alpha (+ beta alpha)) 1.0) (* t_1 t_1))
      (+ 3.0 (+ beta alpha)))
     (/ (/ (- (- (- alpha) 1.0)) 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+141) {
		tmp = ((fma(beta, alpha, (beta + alpha)) + 1.0) / (t_1 * t_1)) / (3.0 + (beta + alpha));
	} else {
		tmp = (-(-alpha - 1.0) / 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+141)
		tmp = Float64(Float64(Float64(fma(beta, alpha, Float64(beta + alpha)) + 1.0) / Float64(t_1 * t_1)) / Float64(3.0 + Float64(beta + alpha)));
	else
		tmp = Float64(Float64(Float64(-Float64(Float64(-alpha) - 1.0)) / 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+141], N[(N[(N[(N[(beta * alpha + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-N[((-alpha) - 1.0), $MachinePrecision]) / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.00000000000000003e141

   1. Initial program 94.5%

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

   3. Applied rewrites 93.1%

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

   if 2.00000000000000003e141 < beta

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-neg.f64 62.1

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

   4. Applied rewrites 62.1%

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

      1. metadata-eval 62.1

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

      2. metadata-eval 62.1

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

      3. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot 1\right)\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]

      4. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(metadata-eval, 2\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot 1\right)\right)\right) + 1} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(metadata-eval, 2\right)\right) + 1} \]

   6. Applied rewrites 62.1%

      \[\leadsto \color{blue}{\frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\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.7% accurate, 1.5× 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 8.2 \cdot 10^{+15}:\\ \;\;\;\;\frac{\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(2 + \beta\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{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 8.2e+15)
     (/
      (/ (+ 1.0 beta) (* (+ 2.0 beta) (+ 2.0 beta)))
      (+ (+ (+ alpha beta) (* 2.0 1.0)) 1.0))
     (/ (/ (- (- (- alpha) 1.0)) 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 <= 8.2e+15) {
		tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (((alpha + beta) + (2.0 * 1.0)) + 1.0);
	} else {
		tmp = (-(-alpha - 1.0) / 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 <= 8.2d+15) then
        tmp = ((1.0d0 + beta) / ((2.0d0 + beta) * (2.0d0 + beta))) / (((alpha + beta) + (2.0d0 * 1.0d0)) + 1.0d0)
    else
        tmp = (-(-alpha - 1.0d0) / 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 <= 8.2e+15) {
		tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (((alpha + beta) + (2.0 * 1.0)) + 1.0);
	} else {
		tmp = (-(-alpha - 1.0) / 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 <= 8.2e+15:
		tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (((alpha + beta) + (2.0 * 1.0)) + 1.0)
	else:
		tmp = (-(-alpha - 1.0) / 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 <= 8.2e+15)
		tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(2.0 + beta))) / Float64(Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) + 1.0));
	else
		tmp = Float64(Float64(Float64(-Float64(Float64(-alpha) - 1.0)) / 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 <= 8.2e+15)
		tmp = ((1.0 + beta) / ((2.0 + beta) * (2.0 + beta))) / (((alpha + beta) + (2.0 * 1.0)) + 1.0);
	else
		tmp = (-(-alpha - 1.0) / 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, 8.2e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[((-N[((-alpha) - 1.0), $MachinePrecision]) / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 8.2e15

   1. Initial program 94.5%

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

   2. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. lower-+.f64 93.1

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

   4. Applied rewrites 93.1%

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

   if 8.2e15 < beta

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-neg.f64 62.1

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

   4. Applied rewrites 62.1%

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

      1. metadata-eval 62.1

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

      2. metadata-eval 62.1

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

      3. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot 1\right)\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]

      4. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(metadata-eval, 2\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot 1\right)\right)\right) + 1} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(metadata-eval, 2\right)\right) + 1} \]

   6. Applied rewrites 62.1%

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

Alternative 6: 98.2% accurate, 1.7× 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.8 \cdot 10^{+15}:\\ \;\;\;\;\frac{1 + \beta}{\left(3 + \beta\right) \cdot \left(\left(2 + \beta\right) \cdot \left(2 + \beta\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{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 6.8e+15)
     (/ (+ 1.0 beta) (* (+ 3.0 beta) (* (+ 2.0 beta) (+ 2.0 beta))))
     (/ (/ (- (- (- alpha) 1.0)) 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 <= 6.8e+15) {
		tmp = (1.0 + beta) / ((3.0 + beta) * ((2.0 + beta) * (2.0 + beta)));
	} else {
		tmp = (-(-alpha - 1.0) / 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 <= 6.8d+15) then
        tmp = (1.0d0 + beta) / ((3.0d0 + beta) * ((2.0d0 + beta) * (2.0d0 + beta)))
    else
        tmp = (-(-alpha - 1.0d0) / 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 <= 6.8e+15) {
		tmp = (1.0 + beta) / ((3.0 + beta) * ((2.0 + beta) * (2.0 + beta)));
	} else {
		tmp = (-(-alpha - 1.0) / 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 <= 6.8e+15:
		tmp = (1.0 + beta) / ((3.0 + beta) * ((2.0 + beta) * (2.0 + beta)))
	else:
		tmp = (-(-alpha - 1.0) / 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 <= 6.8e+15)
		tmp = Float64(Float64(1.0 + beta) / Float64(Float64(3.0 + beta) * Float64(Float64(2.0 + beta) * Float64(2.0 + beta))));
	else
		tmp = Float64(Float64(Float64(-Float64(Float64(-alpha) - 1.0)) / 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 <= 6.8e+15)
		tmp = (1.0 + beta) / ((3.0 + beta) * ((2.0 + beta) * (2.0 + beta)));
	else
		tmp = (-(-alpha - 1.0) / 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, 6.8e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(3.0 + beta), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-N[((-alpha) - 1.0), $MachinePrecision]) / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if beta < 6.8e15

   1. Initial program 94.5%

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

   2. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-+.f64 85.9

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

   4. Applied rewrites 85.9%

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

   if 6.8e15 < beta

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-neg.f64 62.1

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

   4. Applied rewrites 62.1%

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

      1. metadata-eval 62.1

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

      2. metadata-eval 62.1

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

      3. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot 1\right)\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]

      4. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(metadata-eval, 2\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot 1\right) + 1} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot 1\right)\right)\right) + 1} \]

      6. metadata-eval N/A

         \[\leadsto \frac{\frac{-\left(\left(-\alpha\right) - 1\right)}{\left(\alpha + \beta\right) + 2}}{\left(\left(\alpha + \beta\right) + \mathsf{Rewrite=>}\left(metadata-eval, 2\right)\right) + 1} \]

   6. Applied rewrites 62.1%

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

Alternative 7: 98.2% accurate, 2.0× speedup

Math

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

C

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

Python

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 8.5e+15)
		tmp = Float64(Float64(1.0 + beta) / Float64(Float64(3.0 + beta) * Float64(Float64(2.0 + beta) * Float64(2.0 + beta))));
	else
		tmp = Float64(Float64(Float64(-Float64(Float64(-alpha) - 1.0)) / Float64(Float64(alpha + beta) + 2.0)) / 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 <= 8.5e+15)
		tmp = (1.0 + beta) / ((3.0 + beta) * ((2.0 + beta) * (2.0 + beta)));
	else
		tmp = (-(-alpha - 1.0) / ((alpha + beta) + 2.0)) / (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, 8.5e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(3.0 + beta), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-N[((-alpha) - 1.0), $MachinePrecision]) / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[(3.0 + beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 8.5e15

   1. Initial program 94.5%

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

   2. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-+.f64 85.9

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

   4. Applied rewrites 85.9%

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

   if 8.5e15 < beta

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-neg.f64 62.1

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

   4. Applied rewrites 62.1%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-+.f64 62.1

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

   7. Applied rewrites 62.1%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval 62.1

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

   9. Applied rewrites 62.1%

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

Alternative 8: 97.5% accurate, 2.0× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.5

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-+.f64 48.7

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

   4. Applied rewrites 48.7%

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

   if 1.5 < beta

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-neg.f64 62.1

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

   4. Applied rewrites 62.1%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-+.f64 62.1

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

   7. Applied rewrites 62.1%

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

      1. lift-*.f64 N/A

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

      2. metadata-eval 62.1

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

   9. Applied rewrites 62.1%

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

Alternative 9: 62.1% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.5%

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

2. Taylor expanded in beta around -inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. mul-1-neg N/A

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

   4. lower--.f64 N/A

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

   5. lower-neg.f64 62.1

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

4. Applied rewrites 62.1%

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

5. Taylor expanded in alpha around 0

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

   1. lower-+.f64 62.1

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

7. Applied rewrites 62.1%

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

   1. lift-*.f64 N/A

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

   2. metadata-eval 62.1

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

9. Applied rewrites 62.1%

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

Alternative 10: 62.1% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.5%

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

2. Taylor expanded in beta around -inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. mul-1-neg N/A

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

   4. lower--.f64 N/A

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

   5. lower-neg.f64 62.1

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

4. Applied rewrites 62.1%

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

5. Taylor expanded in alpha around 0

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

   1. lower-+.f64 62.1

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

7. Applied rewrites 62.1%

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

8. Taylor expanded in alpha around 0

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

   1. lower-+.f64 62.1

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

10. Applied rewrites 62.1%

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

Alternative 11: 62.0% accurate, 2.3× speedup

Math

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

C

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

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.0)
		tmp = Float64(Float64(Float64(-Float64(Float64(-alpha) - 1.0)) / Float64(2.0 + alpha)) / Float64(3.0 + beta));
	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 <= 2.0)
		tmp = (-(-alpha - 1.0) / (2.0 + alpha)) / (3.0 + beta);
	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, 2.0], N[(N[((-N[((-alpha) - 1.0), $MachinePrecision]) / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(3.0 + beta), $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 < 2

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-neg.f64 62.1

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

   4. Applied rewrites 62.1%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-+.f64 62.1

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

   7. Applied rewrites 62.1%

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

   8. Taylor expanded in beta around 0

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

      1. lower-+.f64 12.4

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

   10. Applied rewrites 12.4%

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

   if 2 < beta

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 55.7

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

   4. Applied rewrites 55.7%

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

   5. Taylor expanded in alpha around 0

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

      1. lower-+.f64 N/A

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

      2. lift-+.f64 55.7

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

   7. Applied rewrites 55.7%

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

Alternative 12: 55.7% accurate, 3.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.5%

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

2. Taylor expanded in beta around inf

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 55.7

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

4. Applied rewrites 55.7%

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

5. Taylor expanded in alpha around 0

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

   1. lower-+.f64 N/A

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

   2. lift-+.f64 55.7

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

7. Applied rewrites 55.7%

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

Alternative 13: 55.6% accurate, 3.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.5%

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

2. Taylor expanded in beta around inf

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 55.7

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

4. Applied rewrites 55.7%

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

5. Taylor expanded in alpha around 0

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

   1. lower-+.f64 55.6

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

7. Applied rewrites 55.6%

   \[\leadsto \frac{\frac{1 + \alpha}{\beta}}{\color{blue}{3 + \beta}} \]
8. Add Preprocessing

Alternative 14: 52.8% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.5%

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

2. Taylor expanded in beta around inf

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 52.8

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

4. Applied rewrites 52.8%

   \[\leadsto \color{blue}{\frac{1 + \alpha}{\beta \cdot \beta}} \]
5. Add Preprocessing

Alternative 15: 52.0% accurate, 4.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 52.8

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

   4. Applied rewrites 52.8%

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

   5. Taylor expanded in alpha around 0

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

   7. Applied rewrites 49.8%

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

   if 1 < alpha

   1. Initial program 94.5%

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

   2. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 52.8

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

   4. Applied rewrites 52.8%

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

   5. Taylor expanded in alpha around inf

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

      1. lower-/.f64 N/A

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

      2. pow2 N/A

         \[\leadsto \frac{\alpha}{\beta \cdot \beta} \]

      3. lift-*.f64 31.9

         \[\leadsto \frac{\alpha}{\beta \cdot \beta} \]

   7. Applied rewrites 31.9%

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

Alternative 16: 31.9% accurate, 6.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.5%

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

2. Taylor expanded in beta around inf

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 N/A

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

   3. unpow2 N/A

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

   4. lower-*.f64 52.8

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

4. Applied rewrites 52.8%

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

5. Taylor expanded in alpha around inf

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

   1. lower-/.f64 N/A

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

   2. pow2 N/A

      \[\leadsto \frac{\alpha}{\beta \cdot \beta} \]

   3. lift-*.f64 31.9

      \[\leadsto \frac{\alpha}{\beta \cdot \beta} \]

7. Applied rewrites 31.9%

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

Reproduce

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