Quotient of sum of exps

Percentage Accurate: 98.9% → 98.9%

Time: 5.8s

Alternatives: 14

Speedup: 1.0×

• could not determine a ground truth

  1. a = 4.4840989349505177e+136
  2. b = 1.7875579384428928e+54

Specification

Math

\[\begin{array}{l} \\ \frac{e^{a}}{e^{a} + e^{b}} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (/ (exp a) (+ (exp a) (exp b))))

C

double code(double a, double b) {
	return exp(a) / (exp(a) + exp(b));
}

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(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = exp(a) / (exp(a) + exp(b))
end function

Java

public static double code(double a, double b) {
	return Math.exp(a) / (Math.exp(a) + Math.exp(b));
}

Python

def code(a, b):
	return math.exp(a) / (math.exp(a) + math.exp(b))

Julia

function code(a, b)
	return Float64(exp(a) / Float64(exp(a) + exp(b)))
end

MATLAB

function tmp = code(a, b)
	tmp = exp(a) / (exp(a) + exp(b));
end

Wolfram

code[a_, b_] := N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 98.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{a}}{e^{a} + e^{b}} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (/ (exp a) (+ (exp a) (exp b))))

C

double code(double a, double b) {
	return exp(a) / (exp(a) + exp(b));
}

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(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = exp(a) / (exp(a) + exp(b))
end function

Java

public static double code(double a, double b) {
	return Math.exp(a) / (Math.exp(a) + Math.exp(b));
}

Python

def code(a, b):
	return math.exp(a) / (math.exp(a) + math.exp(b))

Julia

function code(a, b)
	return Float64(exp(a) / Float64(exp(a) + exp(b)))
end

MATLAB

function tmp = code(a, b)
	tmp = exp(a) / (exp(a) + exp(b));
end

Wolfram

code[a_, b_] := N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{a}}{e^{a} + e^{b}} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (/ (exp a) (+ (exp a) (exp b))))

C

double code(double a, double b) {
	return exp(a) / (exp(a) + exp(b));
}

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(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = exp(a) / (exp(a) + exp(b))
end function

Java

public static double code(double a, double b) {
	return Math.exp(a) / (Math.exp(a) + Math.exp(b));
}

Python

def code(a, b):
	return math.exp(a) / (math.exp(a) + math.exp(b))

Julia

function code(a, b)
	return Float64(exp(a) / Float64(exp(a) + exp(b)))
end

MATLAB

function tmp = code(a, b)
	tmp = exp(a) / (exp(a) + exp(b));
end

Wolfram

code[a_, b_] := N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 71.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.5000000000000003:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), b, 2\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{a - -1}{a + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (/ (exp a) (+ (exp a) (exp b))) 0.5000000000000003)
   (/ 1.0 (fma (fma (fma 0.16666666666666666 b 0.5) b 1.0) b 2.0))
   (/ (- a -1.0) (+ a 1.0))))

C

double code(double a, double b) {
	double tmp;
	if ((exp(a) / (exp(a) + exp(b))) <= 0.5000000000000003) {
		tmp = 1.0 / fma(fma(fma(0.16666666666666666, b, 0.5), b, 1.0), b, 2.0);
	} else {
		tmp = (a - -1.0) / (a + 1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(exp(a) / Float64(exp(a) + exp(b))) <= 0.5000000000000003)
		tmp = Float64(1.0 / fma(fma(fma(0.16666666666666666, b, 0.5), b, 1.0), b, 2.0));
	else
		tmp = Float64(Float64(a - -1.0) / Float64(a + 1.0));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5000000000000003], N[(1.0 / N[(N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * b + 1.0), $MachinePrecision] * b + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(a - -1.0), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b))) < 0.500000000000000333

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 78.1%

      \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 67.9%

      \[\leadsto \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), \color{blue}{b}, 2\right)} \]

   if 0.500000000000000333 < (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b)))

   1. Initial program 97.7%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 18.3%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 18.4%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 19.7%

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

   12. Taylor expanded in a around inf

       \[\leadsto \frac{a - -1}{a + 1} \]
   13. Step-by-step derivation

   14. Applied rewrites 100.0%

       \[\leadsto \frac{a - -1}{a + 1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 71.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.5000000000000003:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(\left(0.16666666666666666 \cdot b\right) \cdot b, b, 2\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{a - -1}{a + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (/ (exp a) (+ (exp a) (exp b))) 0.5000000000000003)
   (/ 1.0 (fma (* (* 0.16666666666666666 b) b) b 2.0))
   (/ (- a -1.0) (+ a 1.0))))

C

double code(double a, double b) {
	double tmp;
	if ((exp(a) / (exp(a) + exp(b))) <= 0.5000000000000003) {
		tmp = 1.0 / fma(((0.16666666666666666 * b) * b), b, 2.0);
	} else {
		tmp = (a - -1.0) / (a + 1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(exp(a) / Float64(exp(a) + exp(b))) <= 0.5000000000000003)
		tmp = Float64(1.0 / fma(Float64(Float64(0.16666666666666666 * b) * b), b, 2.0));
	else
		tmp = Float64(Float64(a - -1.0) / Float64(a + 1.0));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5000000000000003], N[(1.0 / N[(N[(N[(0.16666666666666666 * b), $MachinePrecision] * b), $MachinePrecision] * b + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(a - -1.0), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b))) < 0.500000000000000333

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 78.1%

      \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 67.9%

      \[\leadsto \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), \color{blue}{b}, 2\right)} \]

   9. Taylor expanded in b around inf

      \[\leadsto \frac{1}{\mathsf{fma}\left(\frac{1}{6} \cdot {b}^{2}, b, 2\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 67.9%

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

   if 0.500000000000000333 < (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b)))

   1. Initial program 97.7%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 18.3%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 18.4%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 19.7%

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

   12. Taylor expanded in a around inf

       \[\leadsto \frac{a - -1}{a + 1} \]
   13. Step-by-step derivation

   14. Applied rewrites 100.0%

       \[\leadsto \frac{a - -1}{a + 1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 67.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.5000000000000003:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, b, 1\right), b, 2\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{a - -1}{a + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (/ (exp a) (+ (exp a) (exp b))) 0.5000000000000003)
   (/ 1.0 (fma (fma 0.5 b 1.0) b 2.0))
   (/ (- a -1.0) (+ a 1.0))))

C

double code(double a, double b) {
	double tmp;
	if ((exp(a) / (exp(a) + exp(b))) <= 0.5000000000000003) {
		tmp = 1.0 / fma(fma(0.5, b, 1.0), b, 2.0);
	} else {
		tmp = (a - -1.0) / (a + 1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(exp(a) / Float64(exp(a) + exp(b))) <= 0.5000000000000003)
		tmp = Float64(1.0 / fma(fma(0.5, b, 1.0), b, 2.0));
	else
		tmp = Float64(Float64(a - -1.0) / Float64(a + 1.0));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5000000000000003], N[(1.0 / N[(N[(0.5 * b + 1.0), $MachinePrecision] * b + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(a - -1.0), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b))) < 0.500000000000000333

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 78.1%

      \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 62.2%

      \[\leadsto \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, b, 1\right), \color{blue}{b}, 2\right)} \]

   if 0.500000000000000333 < (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b)))

   1. Initial program 97.7%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 18.3%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 18.4%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 19.7%

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

   12. Taylor expanded in a around inf

       \[\leadsto \frac{a - -1}{a + 1} \]
   13. Step-by-step derivation

   14. Applied rewrites 100.0%

       \[\leadsto \frac{a - -1}{a + 1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 54.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.5000000000000003:\\ \;\;\;\;\frac{1}{\left(a - -1\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{a - -1}{a + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (/ (exp a) (+ (exp a) (exp b))) 0.5000000000000003)
   (/ 1.0 (+ (- a -1.0) 1.0))
   (/ (- a -1.0) (+ a 1.0))))

C

double code(double a, double b) {
	double tmp;
	if ((exp(a) / (exp(a) + exp(b))) <= 0.5000000000000003) {
		tmp = 1.0 / ((a - -1.0) + 1.0);
	} else {
		tmp = (a - -1.0) / (a + 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(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((exp(a) / (exp(a) + exp(b))) <= 0.5000000000000003d0) then
        tmp = 1.0d0 / ((a - (-1.0d0)) + 1.0d0)
    else
        tmp = (a - (-1.0d0)) / (a + 1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((Math.exp(a) / (Math.exp(a) + Math.exp(b))) <= 0.5000000000000003) {
		tmp = 1.0 / ((a - -1.0) + 1.0);
	} else {
		tmp = (a - -1.0) / (a + 1.0);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (math.exp(a) / (math.exp(a) + math.exp(b))) <= 0.5000000000000003:
		tmp = 1.0 / ((a - -1.0) + 1.0)
	else:
		tmp = (a - -1.0) / (a + 1.0)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(exp(a) / Float64(exp(a) + exp(b))) <= 0.5000000000000003)
		tmp = Float64(1.0 / Float64(Float64(a - -1.0) + 1.0));
	else
		tmp = Float64(Float64(a - -1.0) / Float64(a + 1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((exp(a) / (exp(a) + exp(b))) <= 0.5000000000000003)
		tmp = 1.0 / ((a - -1.0) + 1.0);
	else
		tmp = (a - -1.0) / (a + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5000000000000003], N[(1.0 / N[(N[(a - -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(a - -1.0), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b))) < 0.500000000000000333

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 80.0%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 79.5%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 47.1%

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

   if 0.500000000000000333 < (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b)))

   1. Initial program 97.7%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 18.3%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 18.4%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 19.7%

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

   12. Taylor expanded in a around inf

       \[\leadsto \frac{a - -1}{a + 1} \]
   13. Step-by-step derivation

   14. Applied rewrites 100.0%

       \[\leadsto \frac{a - -1}{a + 1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 98.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -0.385:\\ \;\;\;\;\frac{e^{a}}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{e^{b} - -1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -0.385) (/ (exp a) (+ (exp a) 1.0)) (/ 1.0 (- (exp b) -1.0))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -0.385) {
		tmp = exp(a) / (exp(a) + 1.0);
	} else {
		tmp = 1.0 / (exp(b) - -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(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-0.385d0)) then
        tmp = exp(a) / (exp(a) + 1.0d0)
    else
        tmp = 1.0d0 / (exp(b) - (-1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (a <= -0.385) {
		tmp = Math.exp(a) / (Math.exp(a) + 1.0);
	} else {
		tmp = 1.0 / (Math.exp(b) - -1.0);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if a <= -0.385:
		tmp = math.exp(a) / (math.exp(a) + 1.0)
	else:
		tmp = 1.0 / (math.exp(b) - -1.0)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -0.385)
		tmp = Float64(exp(a) / Float64(exp(a) + 1.0));
	else
		tmp = Float64(1.0 / Float64(exp(b) - -1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -0.385)
		tmp = exp(a) / (exp(a) + 1.0);
	else
		tmp = 1.0 / (exp(b) - -1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[a, -0.385], N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[Exp[b], $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -0.38500000000000001

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   if -0.38500000000000001 < a

   1. Initial program 99.5%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.4%

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

Alternative 7: 98.3% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -92:\\ \;\;\;\;\frac{e^{a}}{1 + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{e^{b} - -1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -92.0) (/ (exp a) (+ 1.0 1.0)) (/ 1.0 (- (exp b) -1.0))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -92.0) {
		tmp = exp(a) / (1.0 + 1.0);
	} else {
		tmp = 1.0 / (exp(b) - -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(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-92.0d0)) then
        tmp = exp(a) / (1.0d0 + 1.0d0)
    else
        tmp = 1.0d0 / (exp(b) - (-1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (a <= -92.0) {
		tmp = Math.exp(a) / (1.0 + 1.0);
	} else {
		tmp = 1.0 / (Math.exp(b) - -1.0);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if a <= -92.0:
		tmp = math.exp(a) / (1.0 + 1.0)
	else:
		tmp = 1.0 / (math.exp(b) - -1.0)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -92.0)
		tmp = Float64(exp(a) / Float64(1.0 + 1.0));
	else
		tmp = Float64(1.0 / Float64(exp(b) - -1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -92.0)
		tmp = exp(a) / (1.0 + 1.0);
	else
		tmp = 1.0 / (exp(b) - -1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[a, -92.0], N[(N[Exp[a], $MachinePrecision] / N[(1.0 + 1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[Exp[b], $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -92

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{1} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.9%

      \[\leadsto \frac{e^{a}}{\color{blue}{1} + 1} \]

   if -92 < a

   1. Initial program 99.5%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.4%

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

Alternative 8: 88.7% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -5.2 \cdot 10^{+162}:\\ \;\;\;\;\frac{a - -1}{\frac{\mathsf{fma}\left(a, a, -1\right)}{-1 + a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{e^{b} - -1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -5.2e+162)
   (/ (- a -1.0) (+ (/ (fma a a -1.0) (+ -1.0 a)) 1.0))
   (/ 1.0 (- (exp b) -1.0))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -5.2e+162) {
		tmp = (a - -1.0) / ((fma(a, a, -1.0) / (-1.0 + a)) + 1.0);
	} else {
		tmp = 1.0 / (exp(b) - -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -5.2e+162)
		tmp = Float64(Float64(a - -1.0) / Float64(Float64(fma(a, a, -1.0) / Float64(-1.0 + a)) + 1.0));
	else
		tmp = Float64(1.0 / Float64(exp(b) - -1.0));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[a, -5.2e+162], N[(N[(a - -1.0), $MachinePrecision] / N[(N[(N[(a * a + -1.0), $MachinePrecision] / N[(-1.0 + a), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[Exp[b], $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -5.2e162

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 3.1%

       \[\leadsto \frac{\color{blue}{a - -1}}{\left(a - -1\right) + 1} \]
   12. Step-by-step derivation

   13. Applied rewrites 100.0%

       \[\leadsto \frac{a - -1}{\frac{\mathsf{fma}\left(a, a, -1\right)}{\color{blue}{-1 + a}} + 1} \]

   if -5.2e162 < a

   1. Initial program 99.5%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 91.0%

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

Alternative 9: 85.3% accurate, 3.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right) \cdot b\\ \mathbf{if}\;b \leq -8.6:\\ \;\;\;\;\frac{a - -1}{a + 1}\\ \mathbf{elif}\;b \leq 2 \cdot 10^{+51}:\\ \;\;\;\;\frac{a - -1}{\frac{\mathsf{fma}\left(a, a, -1\right)}{-1 + a} + 1}\\ \mathbf{elif}\;b \leq 1.02 \cdot 10^{+103}:\\ \;\;\;\;\frac{1}{\frac{t\_0 \cdot t\_0 - 4}{t\_0 - 2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot \left(b \cdot b\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* (fma (fma 0.16666666666666666 b 0.5) b 1.0) b)))
   (if (<= b -8.6)
     (/ (- a -1.0) (+ a 1.0))
     (if (<= b 2e+51)
       (/ (- a -1.0) (+ (/ (fma a a -1.0) (+ -1.0 a)) 1.0))
       (if (<= b 1.02e+103)
         (/ 1.0 (/ (- (* t_0 t_0) 4.0) (- t_0 2.0)))
         (/ 1.0 (* (fma 0.16666666666666666 b 0.5) (* b b))))))))

C

double code(double a, double b) {
	double t_0 = fma(fma(0.16666666666666666, b, 0.5), b, 1.0) * b;
	double tmp;
	if (b <= -8.6) {
		tmp = (a - -1.0) / (a + 1.0);
	} else if (b <= 2e+51) {
		tmp = (a - -1.0) / ((fma(a, a, -1.0) / (-1.0 + a)) + 1.0);
	} else if (b <= 1.02e+103) {
		tmp = 1.0 / (((t_0 * t_0) - 4.0) / (t_0 - 2.0));
	} else {
		tmp = 1.0 / (fma(0.16666666666666666, b, 0.5) * (b * b));
	}
	return tmp;
}

Julia

function code(a, b)
	t_0 = Float64(fma(fma(0.16666666666666666, b, 0.5), b, 1.0) * b)
	tmp = 0.0
	if (b <= -8.6)
		tmp = Float64(Float64(a - -1.0) / Float64(a + 1.0));
	elseif (b <= 2e+51)
		tmp = Float64(Float64(a - -1.0) / Float64(Float64(fma(a, a, -1.0) / Float64(-1.0 + a)) + 1.0));
	elseif (b <= 1.02e+103)
		tmp = Float64(1.0 / Float64(Float64(Float64(t_0 * t_0) - 4.0) / Float64(t_0 - 2.0)));
	else
		tmp = Float64(1.0 / Float64(fma(0.16666666666666666, b, 0.5) * Float64(b * b)));
	end
	return tmp
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * b + 1.0), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[b, -8.6], N[(N[(a - -1.0), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2e+51], N[(N[(a - -1.0), $MachinePrecision] / N[(N[(N[(a * a + -1.0), $MachinePrecision] / N[(-1.0 + a), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.02e+103], N[(1.0 / N[(N[(N[(t$95$0 * t$95$0), $MachinePrecision] - 4.0), $MachinePrecision] / N[(t$95$0 - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -8.59999999999999964

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 18.8%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 18.8%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 18.8%

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

   12. Taylor expanded in a around inf

       \[\leadsto \frac{a - -1}{a + 1} \]
   13. Step-by-step derivation

   14. Applied rewrites 100.0%

       \[\leadsto \frac{a - -1}{a + 1} \]

   if -8.59999999999999964 < b < 2e51

   1. Initial program 99.3%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 96.2%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 95.5%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 63.7%

       \[\leadsto \frac{\color{blue}{a - -1}}{\left(a - -1\right) + 1} \]
   12. Step-by-step derivation

   13. Applied rewrites 83.3%

       \[\leadsto \frac{a - -1}{\frac{\mathsf{fma}\left(a, a, -1\right)}{\color{blue}{-1 + a}} + 1} \]

   if 2e51 < b < 1.01999999999999991e103

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 6.8%

      \[\leadsto \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), \color{blue}{b}, 2\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto \frac{1}{\frac{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right) \cdot b\right) \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right) \cdot b\right) - 4}{\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right) \cdot b - \color{blue}{2}}} \]

   if 1.01999999999999991e103 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 100.0%

      \[\leadsto \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), \color{blue}{b}, 2\right)} \]

   9. Taylor expanded in b around inf

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

   11. Applied rewrites 100.0%

       \[\leadsto \frac{1}{\mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot \left(b \cdot \color{blue}{b}\right)} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 10: 83.5% accurate, 3.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot b\\ \mathbf{if}\;b \leq -8.6:\\ \;\;\;\;\frac{a - -1}{a + 1}\\ \mathbf{elif}\;b \leq 2.8 \cdot 10^{+77}:\\ \;\;\;\;\frac{a - -1}{\frac{\mathsf{fma}\left(a, a, -1\right)}{-1 + a} + 1}\\ \mathbf{elif}\;b \leq 2 \cdot 10^{+154}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(\frac{t\_0 \cdot t\_0 - 1}{t\_0 - 1}, b, 2\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, b, 1\right), b, 2\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* (fma 0.16666666666666666 b 0.5) b)))
   (if (<= b -8.6)
     (/ (- a -1.0) (+ a 1.0))
     (if (<= b 2.8e+77)
       (/ (- a -1.0) (+ (/ (fma a a -1.0) (+ -1.0 a)) 1.0))
       (if (<= b 2e+154)
         (/ 1.0 (fma (/ (- (* t_0 t_0) 1.0) (- t_0 1.0)) b 2.0))
         (/ 1.0 (fma (fma 0.5 b 1.0) b 2.0)))))))

C

double code(double a, double b) {
	double t_0 = fma(0.16666666666666666, b, 0.5) * b;
	double tmp;
	if (b <= -8.6) {
		tmp = (a - -1.0) / (a + 1.0);
	} else if (b <= 2.8e+77) {
		tmp = (a - -1.0) / ((fma(a, a, -1.0) / (-1.0 + a)) + 1.0);
	} else if (b <= 2e+154) {
		tmp = 1.0 / fma((((t_0 * t_0) - 1.0) / (t_0 - 1.0)), b, 2.0);
	} else {
		tmp = 1.0 / fma(fma(0.5, b, 1.0), b, 2.0);
	}
	return tmp;
}

Julia

function code(a, b)
	t_0 = Float64(fma(0.16666666666666666, b, 0.5) * b)
	tmp = 0.0
	if (b <= -8.6)
		tmp = Float64(Float64(a - -1.0) / Float64(a + 1.0));
	elseif (b <= 2.8e+77)
		tmp = Float64(Float64(a - -1.0) / Float64(Float64(fma(a, a, -1.0) / Float64(-1.0 + a)) + 1.0));
	elseif (b <= 2e+154)
		tmp = Float64(1.0 / fma(Float64(Float64(Float64(t_0 * t_0) - 1.0) / Float64(t_0 - 1.0)), b, 2.0));
	else
		tmp = Float64(1.0 / fma(fma(0.5, b, 1.0), b, 2.0));
	end
	return tmp
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[b, -8.6], N[(N[(a - -1.0), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.8e+77], N[(N[(a - -1.0), $MachinePrecision] / N[(N[(N[(a * a + -1.0), $MachinePrecision] / N[(-1.0 + a), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2e+154], N[(1.0 / N[(N[(N[(N[(t$95$0 * t$95$0), $MachinePrecision] - 1.0), $MachinePrecision] / N[(t$95$0 - 1.0), $MachinePrecision]), $MachinePrecision] * b + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(0.5 * b + 1.0), $MachinePrecision] * b + 2.0), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -8.59999999999999964

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 18.8%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 18.8%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 18.8%

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

   12. Taylor expanded in a around inf

       \[\leadsto \frac{a - -1}{a + 1} \]
   13. Step-by-step derivation

   14. Applied rewrites 100.0%

       \[\leadsto \frac{a - -1}{a + 1} \]

   if -8.59999999999999964 < b < 2.8e77

   1. Initial program 99.4%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 94.5%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 93.9%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 61.4%

       \[\leadsto \frac{\color{blue}{a - -1}}{\left(a - -1\right) + 1} \]
   12. Step-by-step derivation

   13. Applied rewrites 80.9%

       \[\leadsto \frac{a - -1}{\frac{\mathsf{fma}\left(a, a, -1\right)}{\color{blue}{-1 + a}} + 1} \]

   if 2.8e77 < b < 2.00000000000000007e154

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 64.8%

      \[\leadsto \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), \color{blue}{b}, 2\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto \frac{1}{\mathsf{fma}\left(\frac{\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot b\right) \cdot \left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot b\right) - 1}{\mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot b - 1}, b, 2\right)} \]

   if 2.00000000000000007e154 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 100.0%

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

Alternative 11: 81.5% accurate, 6.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -8.6:\\ \;\;\;\;\frac{a - -1}{a + 1}\\ \mathbf{elif}\;b \leq 3.2 \cdot 10^{+102}:\\ \;\;\;\;\frac{a - -1}{\frac{\mathsf{fma}\left(a, a, -1\right)}{-1 + a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot \left(b \cdot b\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b -8.6)
   (/ (- a -1.0) (+ a 1.0))
   (if (<= b 3.2e+102)
     (/ (- a -1.0) (+ (/ (fma a a -1.0) (+ -1.0 a)) 1.0))
     (/ 1.0 (* (fma 0.16666666666666666 b 0.5) (* b b))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= -8.6) {
		tmp = (a - -1.0) / (a + 1.0);
	} else if (b <= 3.2e+102) {
		tmp = (a - -1.0) / ((fma(a, a, -1.0) / (-1.0 + a)) + 1.0);
	} else {
		tmp = 1.0 / (fma(0.16666666666666666, b, 0.5) * (b * b));
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (b <= -8.6)
		tmp = Float64(Float64(a - -1.0) / Float64(a + 1.0));
	elseif (b <= 3.2e+102)
		tmp = Float64(Float64(a - -1.0) / Float64(Float64(fma(a, a, -1.0) / Float64(-1.0 + a)) + 1.0));
	else
		tmp = Float64(1.0 / Float64(fma(0.16666666666666666, b, 0.5) * Float64(b * b)));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[b, -8.6], N[(N[(a - -1.0), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.2e+102], N[(N[(a - -1.0), $MachinePrecision] / N[(N[(N[(a * a + -1.0), $MachinePrecision] / N[(-1.0 + a), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -8.59999999999999964

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 18.8%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 18.8%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 18.8%

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

   12. Taylor expanded in a around inf

       \[\leadsto \frac{a - -1}{a + 1} \]
   13. Step-by-step derivation

   14. Applied rewrites 100.0%

       \[\leadsto \frac{a - -1}{a + 1} \]

   if -8.59999999999999964 < b < 3.1999999999999999e102

   1. Initial program 99.4%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 92.4%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 91.9%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 58.6%

       \[\leadsto \frac{\color{blue}{a - -1}}{\left(a - -1\right) + 1} \]
   12. Step-by-step derivation

   13. Applied rewrites 78.9%

       \[\leadsto \frac{a - -1}{\frac{\mathsf{fma}\left(a, a, -1\right)}{\color{blue}{-1 + a}} + 1} \]

   if 3.1999999999999999e102 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 100.0%

      \[\leadsto \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), \color{blue}{b}, 2\right)} \]

   9. Taylor expanded in b around inf

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

   11. Applied rewrites 100.0%

       \[\leadsto \frac{1}{\mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot \left(b \cdot \color{blue}{b}\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 12: 71.6% accurate, 7.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -0.96:\\ \;\;\;\;\frac{a - -1}{a + 1}\\ \mathbf{elif}\;b \leq 4.6 \cdot 10^{+26}:\\ \;\;\;\;\frac{1}{\left(a - -1\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot \left(b \cdot b\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b -0.96)
   (/ (- a -1.0) (+ a 1.0))
   (if (<= b 4.6e+26)
     (/ 1.0 (+ (- a -1.0) 1.0))
     (/ 1.0 (* (fma 0.16666666666666666 b 0.5) (* b b))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= -0.96) {
		tmp = (a - -1.0) / (a + 1.0);
	} else if (b <= 4.6e+26) {
		tmp = 1.0 / ((a - -1.0) + 1.0);
	} else {
		tmp = 1.0 / (fma(0.16666666666666666, b, 0.5) * (b * b));
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (b <= -0.96)
		tmp = Float64(Float64(a - -1.0) / Float64(a + 1.0));
	elseif (b <= 4.6e+26)
		tmp = Float64(1.0 / Float64(Float64(a - -1.0) + 1.0));
	else
		tmp = Float64(1.0 / Float64(fma(0.16666666666666666, b, 0.5) * Float64(b * b)));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[b, -0.96], N[(N[(a - -1.0), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.6e+26], N[(1.0 / N[(N[(a - -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -0.95999999999999996

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 18.8%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 18.8%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 18.8%

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

   12. Taylor expanded in a around inf

       \[\leadsto \frac{a - -1}{a + 1} \]
   13. Step-by-step derivation

   14. Applied rewrites 100.0%

       \[\leadsto \frac{a - -1}{a + 1} \]

   if -0.95999999999999996 < b < 4.6000000000000001e26

   1. Initial program 99.3%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
   4. Step-by-step derivation

   5. Applied rewrites 97.4%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
   7. Step-by-step derivation

   8. Applied rewrites 96.7%

      \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 65.3%

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

   if 4.6000000000000001e26 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 75.1%

      \[\leadsto \frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), \color{blue}{b}, 2\right)} \]

   9. Taylor expanded in b around inf

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

   11. Applied rewrites 75.1%

       \[\leadsto \frac{1}{\mathsf{fma}\left(0.16666666666666666, b, 0.5\right) \cdot \left(b \cdot \color{blue}{b}\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 13: 40.0% accurate, 17.5× speedup

Math

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

FPCore

(FPCore (a b) :precision binary64 (/ 1.0 (+ (- a -1.0) 1.0)))

C

double code(double a, double b) {
	return 1.0 / ((a - -1.0) + 1.0);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = 1.0d0 / ((a - (-1.0d0)) + 1.0d0)
end function

Java

public static double code(double a, double b) {
	return 1.0 / ((a - -1.0) + 1.0);
}

Python

def code(a, b):
	return 1.0 / ((a - -1.0) + 1.0)

Julia

function code(a, b)
	return Float64(1.0 / Float64(Float64(a - -1.0) + 1.0))
end

MATLAB

function tmp = code(a, b)
	tmp = 1.0 / ((a - -1.0) + 1.0);
end

Wolfram

code[a_, b_] := N[(1.0 / N[(N[(a - -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Add Preprocessing

3. Taylor expanded in b around 0

   \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]
4. Step-by-step derivation

5. Applied rewrites 69.6%

   \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

6. Taylor expanded in a around 0

   \[\leadsto \frac{e^{a}}{\color{blue}{\left(1 + a\right)} + 1} \]
7. Step-by-step derivation

8. Applied rewrites 69.2%

   \[\leadsto \frac{e^{a}}{\color{blue}{\left(a - -1\right)} + 1} \]

9. Taylor expanded in a around 0

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

11. Applied rewrites 42.3%

    \[\leadsto \frac{\color{blue}{1}}{\left(a - -1\right) + 1} \]
12. Add Preprocessing

Alternative 14: 39.5% accurate, 315.0× speedup

Math

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

FPCore

(FPCore (a b) :precision binary64 0.5)

C

double code(double a, double b) {
	return 0.5;
}

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(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = 0.5d0
end function

Java

public static double code(double a, double b) {
	return 0.5;
}

Python

def code(a, b):
	return 0.5

Julia

function code(a, b)
	return 0.5
end

MATLAB

function tmp = code(a, b)
	tmp = 0.5;
end

Wolfram

code[a_, b_] := 0.5

Derivation

1. Initial program 99.6%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
4. Step-by-step derivation

5. Applied rewrites 81.4%

   \[\leadsto \color{blue}{\frac{1}{e^{b} - -1}} \]

6. Taylor expanded in b around 0

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

8. Applied rewrites 41.6%

   \[\leadsto 0.5 \]
9. Add Preprocessing

Developer Target 1: 100.0% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \frac{1}{1 + e^{b - a}} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (/ 1.0 (+ 1.0 (exp (- b a)))))

C

double code(double a, double b) {
	return 1.0 / (1.0 + exp((b - a)));
}

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(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = 1.0d0 / (1.0d0 + exp((b - a)))
end function

Java

public static double code(double a, double b) {
	return 1.0 / (1.0 + Math.exp((b - a)));
}

Python

def code(a, b):
	return 1.0 / (1.0 + math.exp((b - a)))

Julia

function code(a, b)
	return Float64(1.0 / Float64(1.0 + exp(Float64(b - a))))
end

MATLAB

function tmp = code(a, b)
	tmp = 1.0 / (1.0 + exp((b - a)));
end

Wolfram

code[a_, b_] := N[(1.0 / N[(1.0 + N[Exp[N[(b - a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2025026 
(FPCore (a b)
  :name "Quotient of sum of exps"
  :precision binary64

  :alt
  (! :herbie-platform default (/ 1 (+ 1 (exp (- b a)))))

  (/ (exp a) (+ (exp a) (exp b))))