Quotient of sum of exps

Percentage Accurate: 98.8% → 98.6%

Time: 3.9s

Alternatives: 12

Speedup: 1.0×

• could not determine a ground truth

  1. a = 1.525044569730835e+57
  2. b = 0.005747809744694609

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.8% 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.6% accurate, 2.5× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (a <= -2900000000.0) {
		tmp = exp(a) / ((1.0 + a) + 1.0);
	} else {
		tmp = (1.0 + a) / ((a - -1.0) + exp(b));
	}
	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 <= (-2900000000.0d0)) then
        tmp = exp(a) / ((1.0d0 + a) + 1.0d0)
    else
        tmp = (1.0d0 + a) / ((a - (-1.0d0)) + exp(b))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -2.9e9

   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

      1. lower-+.f64 100.0

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

   8. Applied rewrites 100.0%

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

   if -2.9e9 < a

   1. Initial program 97.9%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 97.4

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

   5. Applied rewrites 97.4%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 99.7

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

   8. Applied rewrites 99.7%

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

Alternative 2: 76.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{e^{a}}{e^{a} + e^{b}}\\ t_1 := \left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), b, 1\right)\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;\frac{a}{t\_1}\\ \mathbf{elif}\;t\_0 \leq 0.6:\\ \;\;\;\;\frac{1 + a}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + a}{a + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (/ (exp a) (+ (exp a) (exp b))))
        (t_1
         (+
          (- a -1.0)
          (fma (fma (fma 0.16666666666666666 b 0.5) b 1.0) b 1.0))))
   (if (<= t_0 0.0)
     (/ a t_1)
     (if (<= t_0 0.6) (/ (+ 1.0 a) t_1) (/ (+ 1.0 a) (+ a 1.0))))))

C

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

Julia

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

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(a - -1.0), $MachinePrecision] + N[(N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * b + 1.0), $MachinePrecision] * b + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(a / t$95$1), $MachinePrecision], If[LessEqual[t$95$0, 0.6], N[(N[(1.0 + a), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(1.0 + a), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 70.5

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

   8. Applied rewrites 70.5%

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

   9. Taylor expanded in b around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

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

       4. +-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right) + 1, b, 1\right)} \]

       5. *-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\left(\frac{1}{2} + \frac{1}{6} \cdot b\right) \cdot b + 1, b, 1\right)} \]

       6. lower-fma.f64 N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot b, b, 1\right), b, 1\right)} \]

       7. +-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6} \cdot b + \frac{1}{2}, b, 1\right), b, 1\right)} \]

       8. lower-fma.f64 46.4

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

   11. Applied rewrites 46.4%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 51.3%

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

   if 0.0 < (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b))) < 0.599999999999999978

   1. Initial program 99.9%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 99.9

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

   8. Applied rewrites 99.9%

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

   9. Taylor expanded in b around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

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

       4. +-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right) + 1, b, 1\right)} \]

       5. *-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\left(\frac{1}{2} + \frac{1}{6} \cdot b\right) \cdot b + 1, b, 1\right)} \]

       6. lower-fma.f64 N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot b, b, 1\right), b, 1\right)} \]

       7. +-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6} \cdot b + \frac{1}{2}, b, 1\right), b, 1\right)} \]

       8. lower-fma.f64 99.9

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

   11. Applied rewrites 99.9%

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

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

   1. Initial program 92.6%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 90.9

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

   5. Applied rewrites 90.9%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 99.2

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

   8. Applied rewrites 99.2%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 20.8%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 96.7%

       \[\leadsto \frac{1 + a}{a + 1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 77.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0:\\ \;\;\;\;\frac{a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), b, 1\right)}\\ \mathbf{elif}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.6:\\ \;\;\;\;\frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), b, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + a}{a + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 76.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{e^{a}}{e^{a} + e^{b}}\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;\frac{a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), b, 1\right)}\\ \mathbf{elif}\;t\_0 \leq 0.8397875060102299:\\ \;\;\;\;\mathsf{fma}\left(a, 0.25, \mathsf{fma}\left(0.25, -b, 0.5\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + a}{a + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (/ (exp a) (+ (exp a) (exp b)))))
   (if (<= t_0 0.0)
     (/
      a
      (+ (- a -1.0) (fma (fma (fma 0.16666666666666666 b 0.5) b 1.0) b 1.0)))
     (if (<= t_0 0.8397875060102299)
       (fma a 0.25 (fma 0.25 (- b) 0.5))
       (/ (+ 1.0 a) (+ a 1.0))))))

C

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

Julia

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

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(a / N[(N[(a - -1.0), $MachinePrecision] + N[(N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * b + 1.0), $MachinePrecision] * b + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.8397875060102299], N[(a * 0.25 + N[(0.25 * (-b) + 0.5), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + a), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 70.5

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

   8. Applied rewrites 70.5%

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

   9. Taylor expanded in b around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

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

       4. +-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right) + 1, b, 1\right)} \]

       5. *-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\left(\frac{1}{2} + \frac{1}{6} \cdot b\right) \cdot b + 1, b, 1\right)} \]

       6. lower-fma.f64 N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot b, b, 1\right), b, 1\right)} \]

       7. +-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6} \cdot b + \frac{1}{2}, b, 1\right), b, 1\right)} \]

       8. lower-fma.f64 46.4

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

   11. Applied rewrites 46.4%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 51.3%

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

   if 0.0 < (/.f64 (exp.f64 a) (+.f64 (exp.f64 a) (exp.f64 b))) < 0.839787506010229889

   1. Initial program 99.9%

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

   3. Taylor expanded in b around 0

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

      1. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{b \cdot e^{a}}{{\left(1 + e^{a}\right)}^{2}}\right)\right) + \frac{\color{blue}{e^{a}}}{1 + e^{a}} \]

      2. associate-/l* N/A

         \[\leadsto \left(\mathsf{neg}\left(b \cdot \frac{e^{a}}{{\left(1 + e^{a}\right)}^{2}}\right)\right) + \frac{e^{\color{blue}{a}}}{1 + e^{a}} \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \left(\mathsf{neg}\left(b\right)\right) \cdot \frac{e^{a}}{{\left(1 + e^{a}\right)}^{2}} + \frac{\color{blue}{e^{a}}}{1 + e^{a}} \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(b\right), \color{blue}{\frac{e^{a}}{{\left(1 + e^{a}\right)}^{2}}}, \frac{e^{a}}{1 + e^{a}}\right) \]

      5. lower-neg.f64 N/A

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

      6. pow-to-exp N/A

         \[\leadsto \mathsf{fma}\left(-b, \frac{e^{a}}{e^{\log \left(1 + e^{a}\right) \cdot 2}}, \frac{e^{a}}{1 + e^{a}}\right) \]

      7. div-exp N/A

         \[\leadsto \mathsf{fma}\left(-b, e^{a - \log \left(1 + e^{a}\right) \cdot 2}, \frac{e^{a}}{1 + e^{a}}\right) \]

      8. lower-exp.f64 N/A

         \[\leadsto \mathsf{fma}\left(-b, e^{a - \log \left(1 + e^{a}\right) \cdot 2}, \frac{e^{a}}{1 + e^{a}}\right) \]

      9. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-b, e^{a - \log \left(1 + e^{a}\right) \cdot 2}, \frac{e^{a}}{1 + e^{a}}\right) \]

      10. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-b, e^{a - \log \left(1 + e^{a}\right) \cdot 2}, \frac{e^{a}}{1 + e^{a}}\right) \]

      11. lower-log1p.f64 N/A

          \[\leadsto \mathsf{fma}\left(-b, e^{a - \mathsf{log1p}\left(e^{a}\right) \cdot 2}, \frac{e^{a}}{1 + e^{a}}\right) \]

      12. lift-exp.f64 N/A

          \[\leadsto \mathsf{fma}\left(-b, e^{a - \mathsf{log1p}\left(e^{a}\right) \cdot 2}, \frac{e^{a}}{1 + e^{a}}\right) \]

   5. Applied rewrites 98.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-b, e^{a - \mathsf{log1p}\left(e^{a}\right) \cdot 2}, \frac{e^{a}}{e^{a} - -1}\right)} \]

   6. Taylor expanded in a around 0

      \[\leadsto \frac{1}{2} + \color{blue}{\left(-1 \cdot \left(b \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right) + \frac{1}{4} \cdot a\right)} \]
   7. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \left(-1 \cdot \left(b \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right) + \frac{1}{4} \cdot a\right) + \frac{1}{2} \]

      2. lower-+.f64 N/A

         \[\leadsto \left(-1 \cdot \left(b \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right) + \frac{1}{4} \cdot a\right) + \frac{1}{2} \]

      3. +-commutative N/A

         \[\leadsto \left(\frac{1}{4} \cdot a + -1 \cdot \left(b \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right)\right) + \frac{1}{2} \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{4}, a, -1 \cdot \left(b \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right)\right) + \frac{1}{2} \]

      5. associate-*r* N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{4}, a, \left(-1 \cdot b\right) \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right) + \frac{1}{2} \]

      6. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{4}, a, \left(\mathsf{neg}\left(b\right)\right) \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right) + \frac{1}{2} \]

      7. distribute-lft-neg-in N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{4}, a, \left(\mathsf{neg}\left(b\right)\right) \cdot e^{\left(\mathsf{neg}\left(2\right)\right) \cdot \log 2}\right) + \frac{1}{2} \]

      8. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{4}, a, \left(\mathsf{neg}\left(b\right)\right) \cdot e^{-2 \cdot \log 2}\right) + \frac{1}{2} \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{4}, a, \left(\mathsf{neg}\left(b\right)\right) \cdot e^{\log 2 \cdot -2}\right) + \frac{1}{2} \]

      10. pow-to-exp N/A

          \[\leadsto \mathsf{fma}\left(\frac{1}{4}, a, \left(\mathsf{neg}\left(b\right)\right) \cdot {2}^{-2}\right) + \frac{1}{2} \]

      11. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(\frac{1}{4}, a, \left(\mathsf{neg}\left(b\right)\right) \cdot \frac{1}{4}\right) + \frac{1}{2} \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{1}{4}, a, \left(\mathsf{neg}\left(b\right)\right) \cdot \frac{1}{4}\right) + \frac{1}{2} \]

      13. lift-neg.f64 98.8

          \[\leadsto \mathsf{fma}\left(0.25, a, \left(-b\right) \cdot 0.25\right) + 0.5 \]

   8. Applied rewrites 98.8%

      \[\leadsto \mathsf{fma}\left(0.25, a, \left(-b\right) \cdot 0.25\right) + \color{blue}{0.5} \]
   9. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. lift-neg.f64 N/A

         \[\leadsto \left(\frac{1}{4} \cdot a + \left(\mathsf{neg}\left(b\right)\right) \cdot \frac{1}{4}\right) + \frac{1}{2} \]

      4. lift-*.f64 N/A

         \[\leadsto \left(\frac{1}{4} \cdot a + \left(\mathsf{neg}\left(b\right)\right) \cdot \frac{1}{4}\right) + \frac{1}{2} \]

      5. associate-+l+ N/A

         \[\leadsto \frac{1}{4} \cdot a + \left(\left(\mathsf{neg}\left(b\right)\right) \cdot \frac{1}{4} + \color{blue}{\frac{1}{2}}\right) \]

      6. *-commutative N/A

         \[\leadsto a \cdot \frac{1}{4} + \left(\left(\mathsf{neg}\left(b\right)\right) \cdot \frac{1}{4} + \frac{1}{2}\right) \]

      7. mul-1-neg N/A

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

      8. metadata-eval N/A

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

      9. metadata-eval N/A

         \[\leadsto a \cdot \frac{1}{4} + \left(\left(-1 \cdot b\right) \cdot \frac{1}{{2}^{2}} + \frac{1}{2}\right) \]

      10. pow-to-exp N/A

          \[\leadsto a \cdot \frac{1}{4} + \left(\left(-1 \cdot b\right) \cdot \frac{1}{e^{\log 2 \cdot 2}} + \frac{1}{2}\right) \]

      11. *-commutative N/A

          \[\leadsto a \cdot \frac{1}{4} + \left(\left(-1 \cdot b\right) \cdot \frac{1}{e^{2 \cdot \log 2}} + \frac{1}{2}\right) \]

      12. exp-neg N/A

          \[\leadsto a \cdot \frac{1}{4} + \left(\left(-1 \cdot b\right) \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)} + \frac{1}{2}\right) \]

      13. associate-*r* N/A

          \[\leadsto a \cdot \frac{1}{4} + \left(-1 \cdot \left(b \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right) + \frac{1}{2}\right) \]

      14. +-commutative N/A

          \[\leadsto a \cdot \frac{1}{4} + \left(\frac{1}{2} + -1 \cdot \color{blue}{\left(b \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right)}\right) \]

      15. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(a, \frac{1}{4}, \frac{1}{2} + -1 \cdot \left(b \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right)\right) \]

      16. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(a, \frac{1}{4}, -1 \cdot \left(b \cdot e^{\mathsf{neg}\left(2 \cdot \log 2\right)}\right) + \frac{1}{2}\right) \]

   10. Applied rewrites 98.8%

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

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

   1. Initial program 92.5%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 90.8

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

   5. Applied rewrites 90.8%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 99.2

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

   8. Applied rewrites 99.2%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 20.8%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 98.2%

       \[\leadsto \frac{1 + a}{a + 1} \]
3. Recombined 3 regimes into one program.

4. Final simplification 77.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0:\\ \;\;\;\;\frac{a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), b, 1\right)}\\ \mathbf{elif}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.8397875060102299:\\ \;\;\;\;\mathsf{fma}\left(a, 0.25, \mathsf{fma}\left(0.25, -b, 0.5\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + a}{a + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 73.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.6:\\ \;\;\;\;\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{1 + a}{a + 1}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(exp(a) / Float64(exp(a) + exp(b))) <= 0.6)
		tmp = Float64(1.0 / fma(fma(fma(0.16666666666666666, b, 0.5), b, 1.0), b, 2.0));
	else
		tmp = Float64(Float64(1.0 + a) / 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.6], N[(1.0 / N[(N[(N[(0.16666666666666666 * b + 0.5), $MachinePrecision] * b + 1.0), $MachinePrecision] * b + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + a), $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.599999999999999978

   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

      1. inv-pow N/A

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

      2. lower-pow.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto {\left(e^{b} + 1\right)}^{-1} \]

      4. metadata-eval N/A

         \[\leadsto {\left(e^{b} + 1 \cdot 1\right)}^{-1} \]

      5. fp-cancel-sign-sub-inv N/A

         \[\leadsto {\left(e^{b} - \left(\mathsf{neg}\left(1\right)\right) \cdot 1\right)}^{-1} \]

      6. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1 \cdot 1\right)}^{-1} \]

      7. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      8. lower--.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      9. lift-exp.f64 82.7

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

   5. Applied rewrites 82.7%

      \[\leadsto \color{blue}{{\left(e^{b} - -1\right)}^{-1}} \]
   6. Step-by-step derivation

      1. lift-pow.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      3. lift-exp.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      4. unpow-1 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-exp.f64 N/A

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

      7. lift--.f64 82.7

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

   7. Applied rewrites 82.7%

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

   8. 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)}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-fma.f64 N/A

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

      8. lift-fma.f64 69.1

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

   10. Applied rewrites 69.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)} \]

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

   1. Initial program 92.6%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 90.9

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

   5. Applied rewrites 90.9%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 99.2

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

   8. Applied rewrites 99.2%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 20.8%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 96.7%

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

4. Final simplification 74.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.6:\\ \;\;\;\;\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{1 + a}{a + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 69.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(exp(a) / Float64(exp(a) + exp(b))) <= 0.6)
		tmp = Float64(1.0 / fma(fma(0.5, b, 1.0), b, 2.0));
	else
		tmp = Float64(Float64(1.0 + a) / 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.6], N[(1.0 / N[(N[(0.5 * b + 1.0), $MachinePrecision] * b + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + a), $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.599999999999999978

   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

      1. inv-pow N/A

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

      2. lower-pow.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto {\left(e^{b} + 1\right)}^{-1} \]

      4. metadata-eval N/A

         \[\leadsto {\left(e^{b} + 1 \cdot 1\right)}^{-1} \]

      5. fp-cancel-sign-sub-inv N/A

         \[\leadsto {\left(e^{b} - \left(\mathsf{neg}\left(1\right)\right) \cdot 1\right)}^{-1} \]

      6. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1 \cdot 1\right)}^{-1} \]

      7. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      8. lower--.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      9. lift-exp.f64 82.7

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

   5. Applied rewrites 82.7%

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

   6. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 60.3

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

   8. Applied rewrites 60.3%

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

      1. lift-pow.f64 N/A

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

      2. unpow-1 N/A

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

      3. lower-/.f64 60.3

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

   10. Applied rewrites 60.3%

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

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

   1. Initial program 92.6%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 90.9

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

   5. Applied rewrites 90.9%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 99.2

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

   8. Applied rewrites 99.2%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 20.8%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 96.7%

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

4. Final simplification 68.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.6:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, b, 1\right), b, 2\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + a}{a + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 56.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (/ (exp a) (+ (exp a) (exp b))) 0.6)
   (/ 1.0 (+ 2.0 b))
   (/ (+ 1.0 a) (+ a 1.0))))

C

double code(double a, double b) {
	double tmp;
	if ((exp(a) / (exp(a) + exp(b))) <= 0.6) {
		tmp = 1.0 / (2.0 + b);
	} else {
		tmp = (1.0 + a) / (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.6d0) then
        tmp = 1.0d0 / (2.0d0 + b)
    else
        tmp = (1.0d0 + a) / (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.6) {
		tmp = 1.0 / (2.0 + b);
	} else {
		tmp = (1.0 + a) / (a + 1.0);
	}
	return tmp;
}

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(exp(a) / Float64(exp(a) + exp(b))) <= 0.6)
		tmp = Float64(1.0 / Float64(2.0 + b));
	else
		tmp = Float64(Float64(1.0 + a) / 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.6)
		tmp = 1.0 / (2.0 + b);
	else
		tmp = (1.0 + a) / (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.6], N[(1.0 / N[(2.0 + b), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + a), $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.599999999999999978

   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

      1. inv-pow N/A

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

      2. lower-pow.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto {\left(e^{b} + 1\right)}^{-1} \]

      4. metadata-eval N/A

         \[\leadsto {\left(e^{b} + 1 \cdot 1\right)}^{-1} \]

      5. fp-cancel-sign-sub-inv N/A

         \[\leadsto {\left(e^{b} - \left(\mathsf{neg}\left(1\right)\right) \cdot 1\right)}^{-1} \]

      6. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1 \cdot 1\right)}^{-1} \]

      7. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      8. lower--.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      9. lift-exp.f64 82.7

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

   5. Applied rewrites 82.7%

      \[\leadsto \color{blue}{{\left(e^{b} - -1\right)}^{-1}} \]
   6. Step-by-step derivation

      1. lift-pow.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      3. lift-exp.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      4. unpow-1 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-exp.f64 N/A

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

      7. lift--.f64 82.7

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

   7. Applied rewrites 82.7%

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

   8. Taylor expanded in b around 0

      \[\leadsto \frac{1}{2 + \color{blue}{b}} \]
   9. Step-by-step derivation

      1. lower-+.f64 44.9

         \[\leadsto \frac{1}{2 + b} \]

   10. Applied rewrites 44.9%

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

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

   1. Initial program 92.6%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 90.9

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

   5. Applied rewrites 90.9%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 99.2

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

   8. Applied rewrites 99.2%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 20.8%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 96.7%

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

4. Final simplification 55.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{e^{a}}{e^{a} + e^{b}} \leq 0.6:\\ \;\;\;\;\frac{1}{2 + b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + a}{a + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 98.8% 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 98.4%

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

Alternative 8: 98.2% accurate, 2.5× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (a <= -2900000000.0) {
		tmp = exp(a) / ((1.0 + 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 <= (-2900000000.0d0)) then
        tmp = exp(a) / ((1.0d0 + 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 <= -2900000000.0) {
		tmp = Math.exp(a) / ((1.0 + a) + 1.0);
	} else {
		tmp = 1.0 / (Math.exp(b) - -1.0);
	}
	return tmp;
}

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -2900000000.0)
		tmp = Float64(exp(a) / Float64(Float64(1.0 + 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 <= -2900000000.0)
		tmp = exp(a) / ((1.0 + a) + 1.0);
	else
		tmp = 1.0 / (exp(b) - -1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[a, -2900000000.0], N[(N[Exp[a], $MachinePrecision] / N[(N[(1.0 + 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 < -2.9e9

   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

      1. lower-+.f64 100.0

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

   8. Applied rewrites 100.0%

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

   if -2.9e9 < a

   1. Initial program 97.9%

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

      1. inv-pow N/A

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

      2. lower-pow.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto {\left(e^{b} + 1\right)}^{-1} \]

      4. metadata-eval N/A

         \[\leadsto {\left(e^{b} + 1 \cdot 1\right)}^{-1} \]

      5. fp-cancel-sign-sub-inv N/A

         \[\leadsto {\left(e^{b} - \left(\mathsf{neg}\left(1\right)\right) \cdot 1\right)}^{-1} \]

      6. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1 \cdot 1\right)}^{-1} \]

      7. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      8. lower--.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      9. lift-exp.f64 99.0

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{{\left(e^{b} - -1\right)}^{-1}} \]
   6. Step-by-step derivation

      1. lift-pow.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      3. lift-exp.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      4. unpow-1 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-exp.f64 N/A

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

      7. lift--.f64 99.0

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

   7. Applied rewrites 99.0%

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

Alternative 9: 90.1% accurate, 2.6× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -1.32e+154)
   (/ (+ 1.0 a) (+ (/ (- (* a a) 1.0) (- a 1.0)) 1.0))
   (/ 1.0 (- (exp b) -1.0))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -1.32e+154) {
		tmp = (1.0 + a) / ((((a * a) - 1.0) / (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 <= (-1.32d+154)) then
        tmp = (1.0d0 + a) / ((((a * a) - 1.0d0) / (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 <= -1.32e+154) {
		tmp = (1.0 + a) / ((((a * a) - 1.0) / (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 <= -1.32e+154:
		tmp = (1.0 + a) / ((((a * a) - 1.0) / (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 <= -1.32e+154)
		tmp = Float64(Float64(1.0 + a) / Float64(Float64(Float64(Float64(a * a) - 1.0) / Float64(a - 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 <= -1.32e+154)
		tmp = (1.0 + a) / ((((a * a) - 1.0) / (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, -1.32e+154], N[(N[(1.0 + a), $MachinePrecision] / N[(N[(N[(N[(a * a), $MachinePrecision] - 1.0), $MachinePrecision] / N[(a - 1.0), $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 < -1.31999999999999998e154

   1. Initial program 100.0%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 36.3

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

   8. Applied rewrites 36.3%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 3.1%

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

       1. lift--.f64 N/A

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

       2. flip-- N/A

          \[\leadsto \frac{1 + a}{\frac{a \cdot a - -1 \cdot -1}{\color{blue}{a + -1}} + 1} \]

       3. lower-/.f64 N/A

          \[\leadsto \frac{1 + a}{\frac{a \cdot a - -1 \cdot -1}{\color{blue}{a + -1}} + 1} \]

       4. metadata-eval N/A

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

       5. lower--.f64 N/A

          \[\leadsto \frac{1 + a}{\frac{a \cdot a - 1}{\color{blue}{a} + -1} + 1} \]

       6. lower-*.f64 N/A

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

       7. lower-+.f64 100.0

          \[\leadsto \frac{1 + a}{\frac{a \cdot a - 1}{a + \color{blue}{-1}} + 1} \]

   13. Applied rewrites 100.0%

       \[\leadsto \frac{1 + a}{\frac{a \cdot a - 1}{\color{blue}{a + -1}} + 1} \]

   if -1.31999999999999998e154 < a

   1. Initial program 98.2%

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

      1. inv-pow N/A

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

      2. lower-pow.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto {\left(e^{b} + 1\right)}^{-1} \]

      4. metadata-eval N/A

         \[\leadsto {\left(e^{b} + 1 \cdot 1\right)}^{-1} \]

      5. fp-cancel-sign-sub-inv N/A

         \[\leadsto {\left(e^{b} - \left(\mathsf{neg}\left(1\right)\right) \cdot 1\right)}^{-1} \]

      6. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1 \cdot 1\right)}^{-1} \]

      7. metadata-eval N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      8. lower--.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      9. lift-exp.f64 93.9

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

   5. Applied rewrites 93.9%

      \[\leadsto \color{blue}{{\left(e^{b} - -1\right)}^{-1}} \]
   6. Step-by-step derivation

      1. lift-pow.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      3. lift-exp.f64 N/A

         \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

      4. unpow-1 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-exp.f64 N/A

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

      7. lift--.f64 93.9

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

   7. Applied rewrites 93.9%

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

4. Final simplification 94.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.32 \cdot 10^{+154}:\\ \;\;\;\;\frac{1 + a}{\frac{a \cdot a - 1}{a - 1} + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{e^{b} - -1}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 83.5% accurate, 6.1× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b -0.3)
   (/ (+ 1.0 a) (+ a 1.0))
   (if (<= b 1.2e+63)
     (/ (+ 1.0 a) (+ (/ (- (* a a) 1.0) (- a 1.0)) 1.0))
     (/
      a
      (+
       (- a -1.0)
       (fma (fma (fma 0.16666666666666666 b 0.5) b 1.0) b 1.0))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -0.299999999999999989

   1. Initial program 96.2%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 94.4

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

   5. Applied rewrites 94.4%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 100.0

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

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 20.5%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 98.5%

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

   if -0.299999999999999989 < b < 1.2e63

   1. Initial program 98.6%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 75.8

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

   8. Applied rewrites 75.8%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 62.3%

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

       1. lift--.f64 N/A

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

       2. flip-- N/A

          \[\leadsto \frac{1 + a}{\frac{a \cdot a - -1 \cdot -1}{\color{blue}{a + -1}} + 1} \]

       3. lower-/.f64 N/A

          \[\leadsto \frac{1 + a}{\frac{a \cdot a - -1 \cdot -1}{\color{blue}{a + -1}} + 1} \]

       4. metadata-eval N/A

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

       5. lower--.f64 N/A

          \[\leadsto \frac{1 + a}{\frac{a \cdot a - 1}{\color{blue}{a} + -1} + 1} \]

       6. lower-*.f64 N/A

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

       7. lower-+.f64 80.7

          \[\leadsto \frac{1 + a}{\frac{a \cdot a - 1}{a + \color{blue}{-1}} + 1} \]

   13. Applied rewrites 80.7%

       \[\leadsto \frac{1 + a}{\frac{a \cdot a - 1}{\color{blue}{a + -1}} + 1} \]

   if 1.2e63 < b

   1. Initial program 100.0%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. metadata-eval N/A

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

      6. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in a around 0

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

      1. lower-+.f64 100.0

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

   8. Applied rewrites 100.0%

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

   9. Taylor expanded in b around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

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

       4. +-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right) + 1, b, 1\right)} \]

       5. *-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\left(\frac{1}{2} + \frac{1}{6} \cdot b\right) \cdot b + 1, b, 1\right)} \]

       6. lower-fma.f64 N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot b, b, 1\right), b, 1\right)} \]

       7. +-commutative N/A

          \[\leadsto \frac{1 + a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6} \cdot b + \frac{1}{2}, b, 1\right), b, 1\right)} \]

       8. lower-fma.f64 83.3

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

   11. Applied rewrites 83.3%

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

   12. Taylor expanded in a around inf

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

   14. Applied rewrites 91.4%

       \[\leadsto \frac{a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), b, 1\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 86.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -0.3:\\ \;\;\;\;\frac{1 + a}{a + 1}\\ \mathbf{elif}\;b \leq 1.2 \cdot 10^{+63}:\\ \;\;\;\;\frac{1 + a}{\frac{a \cdot a - 1}{a - 1} + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{a}{\left(a - -1\right) + \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, b, 0.5\right), b, 1\right), b, 1\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 39.9% 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 98.4%

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

3. Taylor expanded in a around 0

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

   1. +-commutative N/A

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

   2. metadata-eval N/A

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

   3. fp-cancel-sign-sub-inv N/A

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

   4. metadata-eval N/A

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

   5. metadata-eval N/A

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

   6. lower--.f64 98.1

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

5. Applied rewrites 98.1%

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

6. Taylor expanded in a around 0

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

   1. lower-+.f64 86.6

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

8. Applied rewrites 86.6%

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

9. Taylor expanded in b around 0

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

11. Applied rewrites 39.5%

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

12. Taylor expanded in a around 0

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

14. Applied rewrites 39.2%

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

Alternative 12: 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 98.4%

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

   1. inv-pow N/A

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

   2. lower-pow.f64 N/A

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

   3. +-commutative N/A

      \[\leadsto {\left(e^{b} + 1\right)}^{-1} \]

   4. metadata-eval N/A

      \[\leadsto {\left(e^{b} + 1 \cdot 1\right)}^{-1} \]

   5. fp-cancel-sign-sub-inv N/A

      \[\leadsto {\left(e^{b} - \left(\mathsf{neg}\left(1\right)\right) \cdot 1\right)}^{-1} \]

   6. metadata-eval N/A

      \[\leadsto {\left(e^{b} - -1 \cdot 1\right)}^{-1} \]

   7. metadata-eval N/A

      \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

   8. lower--.f64 N/A

      \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

   9. lift-exp.f64 86.0

      \[\leadsto {\left(e^{b} - -1\right)}^{-1} \]

5. Applied rewrites 86.0%

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

6. Taylor expanded in b around 0

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

8. Applied rewrites 38.7%

   \[\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 2025051 
(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))))