Octave 3.8, jcobi/1

Percentage Accurate: 74.4% → 99.6%

Time: 3.0s

Alternatives: 14

Speedup: 0.6×

Specification

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

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0))

C

double code(double alpha, double beta) {
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.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
    code = (((beta - alpha) / ((alpha + beta) + 2.0d0)) + 1.0d0) / 2.0d0
end function

Java

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

Python

def code(alpha, beta):
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0

Julia

function code(alpha, beta)
	return Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
end

MATLAB

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

Wolfram

code[alpha_, beta_] := N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]

Initial Program: 74.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0))

C

double code(double alpha, double beta) {
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.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
    code = (((beta - alpha) / ((alpha + beta) + 2.0d0)) + 1.0d0) / 2.0d0
end function

Java

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

Python

def code(alpha, beta):
	return (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0

Julia

function code(alpha, beta)
	return Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
end

MATLAB

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

Wolfram

code[alpha_, beta_] := N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]

Alternative 1: 99.6% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) 2.0)) (t_1 (* t_0 2.0)))
   (if (<= (/ (+ (/ (- beta alpha) t_0) 1.0) 2.0) 0.0)
     (* (fma (/ beta alpha) 2.0 (/ 2.0 alpha)) 0.5)
     (/ (/ (fma (- beta alpha) 2.0 t_1) t_1) 2.0))))

C

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

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(alpha + beta) + 2.0)
	t_1 = Float64(t_0 * 2.0)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(beta - alpha) / t_0) + 1.0) / 2.0) <= 0.0)
		tmp = Float64(fma(Float64(beta / alpha), 2.0, Float64(2.0 / alpha)) * 0.5);
	else
		tmp = Float64(Float64(fma(Float64(beta - alpha), 2.0, t_1) / t_1) / 2.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.0

   1. Initial program 5.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 100.0

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 100.0%

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

      1. lift-/.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. div-add N/A

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

      4. associate-*r/ N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 100.0

          \[\leadsto \mathsf{fma}\left(\frac{\beta}{\alpha}, 2, \frac{2}{\alpha}\right) \cdot 0.5 \]

   6. Applied rewrites 100.0%

      \[\leadsto \mathsf{fma}\left(\frac{\beta}{\alpha}, 2, \frac{2}{\alpha}\right) \cdot 0.5 \]

   if 0.0 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 98.9%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. metadata-eval N/A

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

      7. frac-add N/A

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

      8. lower-/.f64 N/A

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

      9. lower-fma.f64 N/A

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

      10. lift--.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lift-+.f64 N/A

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

      13. lift-+.f64 N/A

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

      14. lower-*.f64 N/A

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

      15. lift-+.f64 N/A

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

      16. lift-+.f64 99.5

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

   3. Applied rewrites 99.5%

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

Alternative 2: 97.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2}\\ \mathbf{if}\;t\_0 \leq 10^{-10}:\\ \;\;\;\;\frac{1 + \beta}{\alpha}\\ \mathbf{elif}\;t\_0 \leq 0.6:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-0.0625, \alpha, 0.125\right) \cdot \alpha - 0.25, \alpha, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\left(2 - \frac{2}{\beta}\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0)))
   (if (<= t_0 1e-10)
     (/ (+ 1.0 beta) alpha)
     (if (<= t_0 0.6)
       (fma (- (* (fma -0.0625 alpha 0.125) alpha) 0.25) alpha 0.5)
       (* (- 2.0 (/ 2.0 beta)) 0.5)))))

C

double code(double alpha, double beta) {
	double t_0 = (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_0 <= 1e-10) {
		tmp = (1.0 + beta) / alpha;
	} else if (t_0 <= 0.6) {
		tmp = fma(((fma(-0.0625, alpha, 0.125) * alpha) - 0.25), alpha, 0.5);
	} else {
		tmp = (2.0 - (2.0 / beta)) * 0.5;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_0 <= 1e-10)
		tmp = Float64(Float64(1.0 + beta) / alpha);
	elseif (t_0 <= 0.6)
		tmp = fma(Float64(Float64(fma(-0.0625, alpha, 0.125) * alpha) - 0.25), alpha, 0.5);
	else
		tmp = Float64(Float64(2.0 - Float64(2.0 / beta)) * 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$0, 1e-10], N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision], If[LessEqual[t$95$0, 0.6], N[(N[(N[(N[(-0.0625 * alpha + 0.125), $MachinePrecision] * alpha), $MachinePrecision] - 0.25), $MachinePrecision] * alpha + 0.5), $MachinePrecision], N[(N[(2.0 - N[(2.0 / beta), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 1.00000000000000004e-10

   1. Initial program 6.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.5

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 99.5%

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

   5. Taylor expanded in beta around 0

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

      1. div-add-rev N/A

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

      2. lower-/.f64 N/A

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

      3. lower-+.f64 99.5

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

   7. Applied rewrites 99.5%

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

   if 1.00000000000000004e-10 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.599999999999999978

   1. Initial program 99.5%

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

   2. Taylor expanded in beta around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 97.2

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

   4. Applied rewrites 97.2%

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

   5. Taylor expanded in alpha around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 95.5

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-0.0625, \alpha, 0.125\right) \cdot \alpha - 0.25, \alpha, 0.5\right) \]

   7. Applied rewrites 95.5%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-0.0625, \alpha, 0.125\right) \cdot \alpha - 0.25, \color{blue}{\alpha}, 0.5\right) \]

   if 0.599999999999999978 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 100.0%

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

   2. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 99.1

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

   4. Applied rewrites 99.1%

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

   5. Taylor expanded in beta around inf

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

      1. lower--.f64 N/A

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

      2. associate-*r/ N/A

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

      3. metadata-eval N/A

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

      4. lower-/.f64 98.1

         \[\leadsto \left(2 - \frac{2}{\beta}\right) \cdot 0.5 \]

   7. Applied rewrites 98.1%

      \[\leadsto \left(2 - \frac{2}{\beta}\right) \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 97.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0)))
   (if (<= t_0 1e-10)
     (/ (+ 1.0 beta) alpha)
     (if (<= t_0 0.6)
       (fma (- (* 0.125 alpha) 0.25) alpha 0.5)
       (* (- 2.0 (/ 2.0 beta)) 0.5)))))

C

double code(double alpha, double beta) {
	double t_0 = (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_0 <= 1e-10) {
		tmp = (1.0 + beta) / alpha;
	} else if (t_0 <= 0.6) {
		tmp = fma(((0.125 * alpha) - 0.25), alpha, 0.5);
	} else {
		tmp = (2.0 - (2.0 / beta)) * 0.5;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_0 <= 1e-10)
		tmp = Float64(Float64(1.0 + beta) / alpha);
	elseif (t_0 <= 0.6)
		tmp = fma(Float64(Float64(0.125 * alpha) - 0.25), alpha, 0.5);
	else
		tmp = Float64(Float64(2.0 - Float64(2.0 / beta)) * 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$0, 1e-10], N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision], If[LessEqual[t$95$0, 0.6], N[(N[(N[(0.125 * alpha), $MachinePrecision] - 0.25), $MachinePrecision] * alpha + 0.5), $MachinePrecision], N[(N[(2.0 - N[(2.0 / beta), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 1.00000000000000004e-10

   1. Initial program 6.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.5

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 99.5%

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

   5. Taylor expanded in beta around 0

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

      1. div-add-rev N/A

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

      2. lower-/.f64 N/A

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

      3. lower-+.f64 99.5

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

   7. Applied rewrites 99.5%

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

   if 1.00000000000000004e-10 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.599999999999999978

   1. Initial program 99.5%

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

   2. Taylor expanded in beta around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 97.2

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

   4. Applied rewrites 97.2%

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

   5. Taylor expanded in alpha around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{8} \cdot \alpha - \frac{1}{4}, \alpha, \frac{1}{2}\right) \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{8} \cdot \alpha - \frac{1}{4}, \alpha, \frac{1}{2}\right) \]

      5. lower-*.f64 95.6

         \[\leadsto \mathsf{fma}\left(0.125 \cdot \alpha - 0.25, \alpha, 0.5\right) \]

   7. Applied rewrites 95.6%

      \[\leadsto \mathsf{fma}\left(0.125 \cdot \alpha - 0.25, \color{blue}{\alpha}, 0.5\right) \]

   if 0.599999999999999978 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 100.0%

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

   2. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 99.1

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

   4. Applied rewrites 99.1%

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

   5. Taylor expanded in beta around inf

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

      1. lower--.f64 N/A

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

      2. associate-*r/ N/A

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

      3. metadata-eval N/A

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

      4. lower-/.f64 98.1

         \[\leadsto \left(2 - \frac{2}{\beta}\right) \cdot 0.5 \]

   7. Applied rewrites 98.1%

      \[\leadsto \left(2 - \frac{2}{\beta}\right) \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 97.1% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0)))
   (if (<= t_0 1e-10)
     (/ (+ 1.0 beta) alpha)
     (if (<= t_0 0.6) (fma (- (* 0.125 alpha) 0.25) alpha 0.5) 1.0))))

C

double code(double alpha, double beta) {
	double t_0 = (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_0 <= 1e-10) {
		tmp = (1.0 + beta) / alpha;
	} else if (t_0 <= 0.6) {
		tmp = fma(((0.125 * alpha) - 0.25), alpha, 0.5);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_0 <= 1e-10)
		tmp = Float64(Float64(1.0 + beta) / alpha);
	elseif (t_0 <= 0.6)
		tmp = fma(Float64(Float64(0.125 * alpha) - 0.25), alpha, 0.5);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$0, 1e-10], N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision], If[LessEqual[t$95$0, 0.6], N[(N[(N[(0.125 * alpha), $MachinePrecision] - 0.25), $MachinePrecision] * alpha + 0.5), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 1.00000000000000004e-10

   1. Initial program 6.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.5

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 99.5%

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

   5. Taylor expanded in beta around 0

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

      1. div-add-rev N/A

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

      2. lower-/.f64 N/A

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

      3. lower-+.f64 99.5

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

   7. Applied rewrites 99.5%

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

   if 1.00000000000000004e-10 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.599999999999999978

   1. Initial program 99.5%

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

   2. Taylor expanded in beta around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 97.2

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

   4. Applied rewrites 97.2%

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

   5. Taylor expanded in alpha around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{8} \cdot \alpha - \frac{1}{4}, \alpha, \frac{1}{2}\right) \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{8} \cdot \alpha - \frac{1}{4}, \alpha, \frac{1}{2}\right) \]

      5. lower-*.f64 95.6

         \[\leadsto \mathsf{fma}\left(0.125 \cdot \alpha - 0.25, \alpha, 0.5\right) \]

   7. Applied rewrites 95.6%

      \[\leadsto \mathsf{fma}\left(0.125 \cdot \alpha - 0.25, \color{blue}{\alpha}, 0.5\right) \]

   if 0.599999999999999978 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 100.0%

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

   2. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{1} \]
   3. Step-by-step derivation

   4. Applied rewrites 97.3%

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

Alternative 5: 92.0% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0)))
   (if (<= t_0 1e-10)
     (/ 1.0 alpha)
     (if (<= t_0 0.6) (fma (- (* 0.125 alpha) 0.25) alpha 0.5) 1.0))))

C

double code(double alpha, double beta) {
	double t_0 = (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_0 <= 1e-10) {
		tmp = 1.0 / alpha;
	} else if (t_0 <= 0.6) {
		tmp = fma(((0.125 * alpha) - 0.25), alpha, 0.5);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_0 <= 1e-10)
		tmp = Float64(1.0 / alpha);
	elseif (t_0 <= 0.6)
		tmp = fma(Float64(Float64(0.125 * alpha) - 0.25), alpha, 0.5);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$0, 1e-10], N[(1.0 / alpha), $MachinePrecision], If[LessEqual[t$95$0, 0.6], N[(N[(N[(0.125 * alpha), $MachinePrecision] - 0.25), $MachinePrecision] * alpha + 0.5), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 1.00000000000000004e-10

   1. Initial program 6.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.5

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 99.5%

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

   5. Taylor expanded in beta around 0

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

      1. div-add-rev N/A

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

      2. lower-/.f64 N/A

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

      3. lower-+.f64 99.5

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

   7. Applied rewrites 99.5%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 80.7%

       \[\leadsto \frac{1}{\alpha} \]

   if 1.00000000000000004e-10 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.599999999999999978

   1. Initial program 99.5%

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

   2. Taylor expanded in beta around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 97.2

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

   4. Applied rewrites 97.2%

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

   5. Taylor expanded in alpha around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{8} \cdot \alpha - \frac{1}{4}, \alpha, \frac{1}{2}\right) \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{8} \cdot \alpha - \frac{1}{4}, \alpha, \frac{1}{2}\right) \]

      5. lower-*.f64 95.6

         \[\leadsto \mathsf{fma}\left(0.125 \cdot \alpha - 0.25, \alpha, 0.5\right) \]

   7. Applied rewrites 95.6%

      \[\leadsto \mathsf{fma}\left(0.125 \cdot \alpha - 0.25, \color{blue}{\alpha}, 0.5\right) \]

   if 0.599999999999999978 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 100.0%

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

   2. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{1} \]
   3. Step-by-step derivation

   4. Applied rewrites 97.3%

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

Alternative 6: 92.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2}\\ \mathbf{if}\;t\_0 \leq 0.4:\\ \;\;\;\;\frac{1}{\alpha}\\ \mathbf{elif}\;t\_0 \leq 0.6:\\ \;\;\;\;\mathsf{fma}\left(-0.25, \alpha, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0)))
   (if (<= t_0 0.4)
     (/ 1.0 alpha)
     (if (<= t_0 0.6) (fma -0.25 alpha 0.5) 1.0))))

C

double code(double alpha, double beta) {
	double t_0 = (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_0 <= 0.4) {
		tmp = 1.0 / alpha;
	} else if (t_0 <= 0.6) {
		tmp = fma(-0.25, alpha, 0.5);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_0 <= 0.4)
		tmp = Float64(1.0 / alpha);
	elseif (t_0 <= 0.6)
		tmp = fma(-0.25, alpha, 0.5);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$0, 0.4], N[(1.0 / alpha), $MachinePrecision], If[LessEqual[t$95$0, 0.6], N[(-0.25 * alpha + 0.5), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.40000000000000002

   1. Initial program 9.0%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 97.4

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 97.4%

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

   5. Taylor expanded in beta around 0

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

      1. div-add-rev N/A

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

      2. lower-/.f64 N/A

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

      3. lower-+.f64 97.4

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

   7. Applied rewrites 97.4%

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

   8. Taylor expanded in beta around 0

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

   10. Applied rewrites 78.8%

       \[\leadsto \frac{1}{\alpha} \]

   if 0.40000000000000002 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.599999999999999978

   1. Initial program 100.0%

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

   2. Taylor expanded in beta around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 98.1

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

   4. Applied rewrites 98.1%

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

   5. Taylor expanded in alpha around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{-1}{4} \cdot \alpha + \frac{1}{2} \]

      2. lower-fma.f64 97.3

         \[\leadsto \mathsf{fma}\left(-0.25, \alpha, 0.5\right) \]

   7. Applied rewrites 97.3%

      \[\leadsto \mathsf{fma}\left(-0.25, \color{blue}{\alpha}, 0.5\right) \]

   if 0.599999999999999978 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 100.0%

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

   2. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{1} \]
   3. Step-by-step derivation

   4. Applied rewrites 97.3%

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

Alternative 7: 76.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2}\\ \mathbf{if}\;t\_0 \leq 10^{-10}:\\ \;\;\;\;\frac{\beta}{\alpha}\\ \mathbf{elif}\;t\_0 \leq 0.6:\\ \;\;\;\;\mathsf{fma}\left(-0.25, \alpha, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0)))
   (if (<= t_0 1e-10)
     (/ beta alpha)
     (if (<= t_0 0.6) (fma -0.25 alpha 0.5) 1.0))))

C

double code(double alpha, double beta) {
	double t_0 = (((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_0 <= 1e-10) {
		tmp = beta / alpha;
	} else if (t_0 <= 0.6) {
		tmp = fma(-0.25, alpha, 0.5);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_0 <= 1e-10)
		tmp = Float64(beta / alpha);
	elseif (t_0 <= 0.6)
		tmp = fma(-0.25, alpha, 0.5);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$0, 1e-10], N[(beta / alpha), $MachinePrecision], If[LessEqual[t$95$0, 0.6], N[(-0.25 * alpha + 0.5), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 1.00000000000000004e-10

   1. Initial program 6.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.5

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 99.5%

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

   5. Taylor expanded in beta around inf

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

      1. lower-/.f64 22.4

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

   7. Applied rewrites 22.4%

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

   if 1.00000000000000004e-10 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.599999999999999978

   1. Initial program 99.5%

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

   2. Taylor expanded in beta around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 97.2

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

   4. Applied rewrites 97.2%

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

   5. Taylor expanded in alpha around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{-1}{4} \cdot \alpha + \frac{1}{2} \]

      2. lower-fma.f64 95.1

         \[\leadsto \mathsf{fma}\left(-0.25, \alpha, 0.5\right) \]

   7. Applied rewrites 95.1%

      \[\leadsto \mathsf{fma}\left(-0.25, \color{blue}{\alpha}, 0.5\right) \]

   if 0.599999999999999978 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 100.0%

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

   2. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{1} \]
   3. Step-by-step derivation

   4. Applied rewrites 97.3%

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

Alternative 8: 99.6% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0)))
   (if (<= t_0 1e-10) (* (fma (/ beta alpha) 2.0 (/ 2.0 alpha)) 0.5) t_0)))

C

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

Julia

function code(alpha, beta)
	t_0 = Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_0 <= 1e-10)
		tmp = Float64(fma(Float64(beta / alpha), 2.0, Float64(2.0 / alpha)) * 0.5);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := Block[{t$95$0 = N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$0, 1e-10], N[(N[(N[(beta / alpha), $MachinePrecision] * 2.0 + N[(2.0 / alpha), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], t$95$0]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 1.00000000000000004e-10

   1. Initial program 6.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.5

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 99.5%

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

      1. lift-/.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. div-add N/A

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

      4. associate-*r/ N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 99.5

          \[\leadsto \mathsf{fma}\left(\frac{\beta}{\alpha}, 2, \frac{2}{\alpha}\right) \cdot 0.5 \]

   6. Applied rewrites 99.5%

      \[\leadsto \mathsf{fma}\left(\frac{\beta}{\alpha}, 2, \frac{2}{\alpha}\right) \cdot 0.5 \]

   if 1.00000000000000004e-10 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 99.7%

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

Alternative 9: 97.9% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0) 1e-10)
   (* (fma (/ beta alpha) 2.0 (/ 2.0 alpha)) 0.5)
   (* (/ (* 2.0 (+ beta (+ 2.0 beta))) (+ 2.0 beta)) 0.25)))

C

double code(double alpha, double beta) {
	double tmp;
	if (((((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0) <= 1e-10) {
		tmp = fma((beta / alpha), 2.0, (2.0 / alpha)) * 0.5;
	} else {
		tmp = ((2.0 * (beta + (2.0 + beta))) / (2.0 + beta)) * 0.25;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0) <= 1e-10)
		tmp = Float64(fma(Float64(beta / alpha), 2.0, Float64(2.0 / alpha)) * 0.5);
	else
		tmp = Float64(Float64(Float64(2.0 * Float64(beta + Float64(2.0 + beta))) / Float64(2.0 + beta)) * 0.25);
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], 1e-10], N[(N[(N[(beta / alpha), $MachinePrecision] * 2.0 + N[(2.0 / alpha), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(2.0 * N[(beta + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 1.00000000000000004e-10

   1. Initial program 6.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.5

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 99.5%

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

      1. lift-/.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. div-add N/A

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

      4. associate-*r/ N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 99.5

          \[\leadsto \mathsf{fma}\left(\frac{\beta}{\alpha}, 2, \frac{2}{\alpha}\right) \cdot 0.5 \]

   6. Applied rewrites 99.5%

      \[\leadsto \mathsf{fma}\left(\frac{\beta}{\alpha}, 2, \frac{2}{\alpha}\right) \cdot 0.5 \]

   if 1.00000000000000004e-10 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 99.7%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. metadata-eval N/A

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

      7. frac-add N/A

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

      8. lower-/.f64 N/A

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

      9. lower-fma.f64 N/A

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

      10. lift--.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lift-+.f64 N/A

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

      13. lift-+.f64 N/A

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

      14. lower-*.f64 N/A

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

      15. lift-+.f64 N/A

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

      16. lift-+.f64 99.8

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

   3. Applied rewrites 99.8%

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

   4. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. distribute-lft-out N/A

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

      5. lower-*.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. lift-+.f64 97.3

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

   6. Applied rewrites 97.3%

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

Alternative 10: 97.9% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0) 1e-10)
   (/ (+ 1.0 beta) alpha)
   (* (/ (* 2.0 (+ beta (+ 2.0 beta))) (+ 2.0 beta)) 0.25)))

C

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

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) :: tmp
    if (((((beta - alpha) / ((alpha + beta) + 2.0d0)) + 1.0d0) / 2.0d0) <= 1d-10) then
        tmp = (1.0d0 + beta) / alpha
    else
        tmp = ((2.0d0 * (beta + (2.0d0 + beta))) / (2.0d0 + beta)) * 0.25d0
    end if
    code = tmp
end function

Java

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

Python

def code(alpha, beta):
	tmp = 0
	if ((((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0) <= 1e-10:
		tmp = (1.0 + beta) / alpha
	else:
		tmp = ((2.0 * (beta + (2.0 + beta))) / (2.0 + beta)) * 0.25
	return tmp

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0) <= 1e-10)
		tmp = Float64(Float64(1.0 + beta) / alpha);
	else
		tmp = Float64(Float64(Float64(2.0 * Float64(beta + Float64(2.0 + beta))) / Float64(2.0 + beta)) * 0.25);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (((((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0) <= 1e-10)
		tmp = (1.0 + beta) / alpha;
	else
		tmp = ((2.0 * (beta + (2.0 + beta))) / (2.0 + beta)) * 0.25;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], 1e-10], N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision], N[(N[(N[(2.0 * N[(beta + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 1.00000000000000004e-10

   1. Initial program 6.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.5

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 99.5%

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

   5. Taylor expanded in beta around 0

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

      1. div-add-rev N/A

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

      2. lower-/.f64 N/A

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

      3. lower-+.f64 99.5

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

   7. Applied rewrites 99.5%

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

   if 1.00000000000000004e-10 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 99.7%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. metadata-eval N/A

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

      7. frac-add N/A

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

      8. lower-/.f64 N/A

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

      9. lower-fma.f64 N/A

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

      10. lift--.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lift-+.f64 N/A

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

      13. lift-+.f64 N/A

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

      14. lower-*.f64 N/A

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

      15. lift-+.f64 N/A

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

      16. lift-+.f64 99.8

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

   3. Applied rewrites 99.8%

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

   4. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. distribute-lft-out N/A

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

      5. lower-*.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. lift-+.f64 97.3

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

   6. Applied rewrites 97.3%

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

Alternative 11: 97.9% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0) 1e-10)
   (/ (+ 1.0 beta) alpha)
   (* (+ (/ beta (+ 2.0 beta)) 1.0) 0.5)))

C

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

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) :: tmp
    if (((((beta - alpha) / ((alpha + beta) + 2.0d0)) + 1.0d0) / 2.0d0) <= 1d-10) then
        tmp = (1.0d0 + beta) / alpha
    else
        tmp = ((beta / (2.0d0 + beta)) + 1.0d0) * 0.5d0
    end if
    code = tmp
end function

Java

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

Python

def code(alpha, beta):
	tmp = 0
	if ((((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0) <= 1e-10:
		tmp = (1.0 + beta) / alpha
	else:
		tmp = ((beta / (2.0 + beta)) + 1.0) * 0.5
	return tmp

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0) <= 1e-10)
		tmp = Float64(Float64(1.0 + beta) / alpha);
	else
		tmp = Float64(Float64(Float64(beta / Float64(2.0 + beta)) + 1.0) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (((((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0) <= 1e-10)
		tmp = (1.0 + beta) / alpha;
	else
		tmp = ((beta / (2.0 + beta)) + 1.0) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], 1e-10], N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision], N[(N[(N[(beta / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 1.00000000000000004e-10

   1. Initial program 6.3%

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

   2. Taylor expanded in alpha around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 99.5

         \[\leadsto \frac{\mathsf{fma}\left(2, \beta, 2\right)}{\alpha} \cdot 0.5 \]

   4. Applied rewrites 99.5%

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

   5. Taylor expanded in beta around 0

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

      1. div-add-rev N/A

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

      2. lower-/.f64 N/A

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

      3. lower-+.f64 99.5

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

   7. Applied rewrites 99.5%

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

   if 1.00000000000000004e-10 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 99.7%

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

   2. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 97.4

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

   4. Applied rewrites 97.4%

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

Alternative 12: 71.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2} + 1}{2} \leq 0.75:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0) 0.75)
   0.5
   1.0))

C

double code(double alpha, double beta) {
	double tmp;
	if (((((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0) <= 0.75) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

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) :: tmp
    if (((((beta - alpha) / ((alpha + beta) + 2.0d0)) + 1.0d0) / 2.0d0) <= 0.75d0) then
        tmp = 0.5d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta) {
	double tmp;
	if (((((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0) <= 0.75) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta):
	tmp = 0
	if ((((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0) <= 0.75:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0) <= 0.75)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (((((beta - alpha) / ((alpha + beta) + 2.0)) + 1.0) / 2.0) <= 0.75)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_] := If[LessEqual[N[(N[(N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], 0.75], 0.5, 1.0]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.75

   1. Initial program 64.6%

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

   2. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 62.2

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

   4. Applied rewrites 62.2%

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

   5. Taylor expanded in beta around 0

      \[\leadsto \frac{1}{2} \]
   6. Step-by-step derivation

   7. Applied rewrites 61.1%

      \[\leadsto 0.5 \]

   if 0.75 < (/.f64 (+.f64 (/.f64 (-.f64 beta alpha) (+.f64 (+.f64 alpha beta) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 100.0%

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

   2. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{1} \]
   3. Step-by-step derivation

   4. Applied rewrites 97.5%

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

Alternative 13: 71.6% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2:\\ \;\;\;\;\mathsf{fma}\left(0.25, \beta, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 2.0) (fma 0.25 beta 0.5) 1.0))

C

double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.0) {
		tmp = fma(0.25, beta, 0.5);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Julia

function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.0)
		tmp = fma(0.25, beta, 0.5);
	else
		tmp = 1.0;
	end
	return tmp
end

Wolfram

code[alpha_, beta_] := If[LessEqual[beta, 2.0], N[(0.25 * beta + 0.5), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 69.0%

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

   2. Taylor expanded in alpha around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-+.f64 66.6

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

   4. Applied rewrites 66.6%

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

   5. Taylor expanded in beta around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{1}{4} \cdot \beta + \frac{1}{2} \]

      2. lower-fma.f64 66.0

         \[\leadsto \mathsf{fma}\left(0.25, \beta, 0.5\right) \]

   7. Applied rewrites 66.0%

      \[\leadsto \mathsf{fma}\left(0.25, \color{blue}{\beta}, 0.5\right) \]

   if 2 < beta

   1. Initial program 85.5%

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

   2. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{1} \]
   3. Step-by-step derivation

   4. Applied rewrites 83.0%

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

Alternative 14: 36.9% accurate, 35.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (alpha beta) :precision binary64 1.0)

C

double code(double alpha, double beta) {
	return 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
    code = 1.0d0
end function

Java

public static double code(double alpha, double beta) {
	return 1.0;
}

Python

def code(alpha, beta):
	return 1.0

Julia

function code(alpha, beta)
	return 1.0
end

MATLAB

function tmp = code(alpha, beta)
	tmp = 1.0;
end

Wolfram

code[alpha_, beta_] := 1.0

Derivation

1. Initial program 74.4%

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

2. Taylor expanded in beta around inf

   \[\leadsto \color{blue}{1} \]
3. Step-by-step derivation

4. Applied rewrites 36.9%

   \[\leadsto \color{blue}{1} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025092 
(FPCore (alpha beta)
  :name "Octave 3.8, jcobi/1"
  :precision binary64
  :pre (and (> alpha -1.0) (> beta -1.0))
  (/ (+ (/ (- beta alpha) (+ (+ alpha beta) 2.0)) 1.0) 2.0))