Quotient of sum of exps

Percentage Accurate: 98.9% → 100.0%

Time: 6.7s

Alternatives: 12

Speedup: 2.9×

• could not determine a ground truth

  1. a = -2.00000000000000007e154
  2. b = -2.00000000000000007e154

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

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = exp(a) / (exp(a) + exp(b))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(a, b)
    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: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{-\mathsf{log1p}\left(e^{b - a}\right)} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (exp (- (log1p (exp (- b a))))))

C

double code(double a, double b) {
	return exp(-log1p(exp((b - a))));
}

Java

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

Python

def code(a, b):
	return math.exp(-math.log1p(math.exp((b - a))))

Julia

function code(a, b)
	return exp(Float64(-log1p(exp(Float64(b - a)))))
end

Wolfram

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

Derivation

1. Initial program 98.8%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Step-by-step derivation

   1. *-lft-identity 98.8%

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

   2. associate-*l/ 98.8%

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

   3. associate-/r/ 98.8%

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

   4. remove-double-neg 98.8%

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

   5. unsub-neg 98.8%

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

   6. div-sub 73.4%

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

   7. *-lft-identity 73.4%

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

   8. associate-*l/ 73.4%

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

   9. lft-mult-inverse 99.2%

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

   10. sub-neg 99.2%

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

   11. distribute-frac-neg 99.2%

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

   12. remove-double-neg 99.2%

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

   13. div-exp 100.0%

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

3. Simplified 100.0%

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

   1. add-exp-log 100.0%

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

   2. log-rec 100.0%

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

   3. log1p-define 100.0%

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

6. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{e^{-\mathsf{log1p}\left(e^{b - a}\right)}} \]
7. Add Preprocessing

Alternative 2: 98.5% accurate, 2.7× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-7.6d-7)) then
        tmp = 1.0d0 / (1.0d0 + exp(-a))
    else
        tmp = 1.0d0 / (1.0d0 + exp(b))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -7.60000000000000029e-7

   1. Initial program 97.1%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 97.1%

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

      2. associate-*l/ 97.1%

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

      3. associate-/r/ 97.1%

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

      4. remove-double-neg 97.1%

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

      5. unsub-neg 97.1%

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

      6. div-sub 4.3%

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

      7. *-lft-identity 4.3%

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

      8. associate-*l/ 4.3%

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

      9. lft-mult-inverse 97.1%

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

      10. sub-neg 97.1%

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

      11. distribute-frac-neg 97.1%

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

      12. remove-double-neg 97.1%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around 0 97.4%

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

   if -7.60000000000000029e-7 < a

   1. Initial program 99.4%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 99.4%

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

      2. associate-*l/ 99.4%

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

      3. associate-/r/ 99.4%

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

      4. remove-double-neg 99.4%

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

      5. unsub-neg 99.4%

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

      6. div-sub 99.4%

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

      7. *-lft-identity 99.4%

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

      8. associate-*l/ 99.4%

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

      9. lft-mult-inverse 100.0%

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

      10. sub-neg 100.0%

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

      11. distribute-frac-neg 100.0%

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

      12. remove-double-neg 100.0%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 99.1%

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

Alternative 3: 92.8% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.45 \cdot 10^{+95}:\\ \;\;\;\;\frac{1}{2 + a \cdot \left(a \cdot \left(0.5 + a \cdot -0.16666666666666666\right) + -1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{1 + e^{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -1.45e+95)
   (/ 1.0 (+ 2.0 (* a (+ (* a (+ 0.5 (* a -0.16666666666666666))) -1.0))))
   (/ 1.0 (+ 1.0 (exp b)))))

C

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

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-1.45d+95)) then
        tmp = 1.0d0 / (2.0d0 + (a * ((a * (0.5d0 + (a * (-0.16666666666666666d0)))) + (-1.0d0))))
    else
        tmp = 1.0d0 / (1.0d0 + exp(b))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (a <= -1.45e+95) {
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	} else {
		tmp = 1.0 / (1.0 + Math.exp(b));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if a <= -1.45e+95:
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)))
	else:
		tmp = 1.0 / (1.0 + math.exp(b))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -1.45e+95)
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	else
		tmp = 1.0 / (1.0 + exp(b));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.45000000000000007e95

   1. Initial program 97.4%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 97.4%

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

      2. associate-*l/ 97.4%

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

      3. associate-/r/ 97.4%

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

      4. remove-double-neg 97.4%

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

      5. unsub-neg 97.4%

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

      6. div-sub 0.0%

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

      7. *-lft-identity 0.0%

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

      8. associate-*l/ 0.0%

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

      9. lft-mult-inverse 97.4%

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

      10. sub-neg 97.4%

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

      11. distribute-frac-neg 97.4%

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

      12. remove-double-neg 97.4%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around 0 100.0%

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

   6. Taylor expanded in a around 0 95.4%

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

   if -1.45000000000000007e95 < a

   1. Initial program 99.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 99.0%

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

      2. associate-*l/ 99.0%

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

      3. associate-/r/ 99.0%

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

      4. remove-double-neg 99.0%

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

      5. unsub-neg 99.0%

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

      6. div-sub 86.6%

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

      7. *-lft-identity 86.6%

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

      8. associate-*l/ 86.6%

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

      9. lft-mult-inverse 99.5%

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

      10. sub-neg 99.5%

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

      11. distribute-frac-neg 99.5%

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

      12. remove-double-neg 99.5%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 91.5%

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

4. Final simplification 92.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.45 \cdot 10^{+95}:\\ \;\;\;\;\frac{1}{2 + a \cdot \left(a \cdot \left(0.5 + a \cdot -0.16666666666666666\right) + -1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{1 + e^{b}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 85.0% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -10.5:\\ \;\;\;\;1 + e^{b}\\ \mathbf{elif}\;b \leq 6.2 \cdot 10^{+45}:\\ \;\;\;\;\frac{1}{2 + a \cdot \left(a \cdot \left(0.5 + a \cdot -0.16666666666666666\right) + -1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2 + b \cdot \left(1 + b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b -10.5)
   (+ 1.0 (exp b))
   (if (<= b 6.2e+45)
     (/ 1.0 (+ 2.0 (* a (+ (* a (+ 0.5 (* a -0.16666666666666666))) -1.0))))
     (/ 1.0 (+ 2.0 (* b (+ 1.0 (* b (+ 0.5 (* b 0.16666666666666666))))))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= -10.5) {
		tmp = 1.0 + exp(b);
	} else if (b <= 6.2e+45) {
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 + (b * 0.16666666666666666))))));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= (-10.5d0)) then
        tmp = 1.0d0 + exp(b)
    else if (b <= 6.2d+45) then
        tmp = 1.0d0 / (2.0d0 + (a * ((a * (0.5d0 + (a * (-0.16666666666666666d0)))) + (-1.0d0))))
    else
        tmp = 1.0d0 / (2.0d0 + (b * (1.0d0 + (b * (0.5d0 + (b * 0.16666666666666666d0))))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= -10.5) {
		tmp = 1.0 + Math.exp(b);
	} else if (b <= 6.2e+45) {
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 + (b * 0.16666666666666666))))));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= -10.5:
		tmp = 1.0 + math.exp(b)
	elif b <= 6.2e+45:
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)))
	else:
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 + (b * 0.16666666666666666))))))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= -10.5)
		tmp = Float64(1.0 + exp(b));
	elseif (b <= 6.2e+45)
		tmp = Float64(1.0 / Float64(2.0 + Float64(a * Float64(Float64(a * Float64(0.5 + Float64(a * -0.16666666666666666))) + -1.0))));
	else
		tmp = Float64(1.0 / Float64(2.0 + Float64(b * Float64(1.0 + Float64(b * Float64(0.5 + Float64(b * 0.16666666666666666)))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= -10.5)
		tmp = 1.0 + exp(b);
	elseif (b <= 6.2e+45)
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	else
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 + (b * 0.16666666666666666))))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -10.5

   1. Initial program 93.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 93.0%

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

      2. associate-*l/ 93.0%

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

      3. associate-/r/ 93.0%

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

      4. remove-double-neg 93.0%

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

      5. unsub-neg 93.0%

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

      6. div-sub 93.0%

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

      7. *-lft-identity 93.0%

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

      8. associate-*l/ 93.0%

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

      9. lft-mult-inverse 95.3%

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

      10. sub-neg 95.3%

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

      11. distribute-frac-neg 95.3%

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

      12. remove-double-neg 95.3%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

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

      1. add-exp-log 100.0%

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

      2. log-rec 100.0%

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

      3. log1p-define 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in a around 0 97.7%

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

      1. log1p-define 97.7%

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

   9. Simplified 97.7%

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

       1. add-sqr-sqrt 95.4%

          \[\leadsto e^{\color{blue}{\sqrt{-\mathsf{log1p}\left(e^{b}\right)} \cdot \sqrt{-\mathsf{log1p}\left(e^{b}\right)}}} \]

       2. sqrt-unprod 96.5%

          \[\leadsto e^{\color{blue}{\sqrt{\left(-\mathsf{log1p}\left(e^{b}\right)\right) \cdot \left(-\mathsf{log1p}\left(e^{b}\right)\right)}}} \]

       3. sqr-neg 96.5%

          \[\leadsto e^{\sqrt{\color{blue}{\mathsf{log1p}\left(e^{b}\right) \cdot \mathsf{log1p}\left(e^{b}\right)}}} \]

       4. sqrt-unprod 96.5%

          \[\leadsto e^{\color{blue}{\sqrt{\mathsf{log1p}\left(e^{b}\right)} \cdot \sqrt{\mathsf{log1p}\left(e^{b}\right)}}} \]

       5. add-sqr-sqrt 96.5%

          \[\leadsto e^{\color{blue}{\mathsf{log1p}\left(e^{b}\right)}} \]

       6. log1p-undefine 96.5%

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

       7. rem-exp-log 96.5%

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

       8. +-commutative 96.5%

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

   11. Applied egg-rr 96.5%

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

   if -10.5 < b < 6.19999999999999975e45

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 100.0%

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

      2. associate-*l/ 100.0%

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

      3. associate-/r/ 99.9%

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

      4. remove-double-neg 99.9%

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

      5. unsub-neg 99.9%

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

      6. div-sub 67.1%

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

      7. *-lft-identity 67.1%

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

      8. associate-*l/ 67.1%

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

      9. lft-mult-inverse 100.0%

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

      10. sub-neg 100.0%

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

      11. distribute-frac-neg 100.0%

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

      12. remove-double-neg 100.0%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around 0 95.7%

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

   6. Taylor expanded in a around 0 81.5%

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

   if 6.19999999999999975e45 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 100.0%

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

      2. associate-*l/ 100.0%

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

      3. associate-/r/ 100.0%

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

      4. remove-double-neg 100.0%

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

      5. unsub-neg 100.0%

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

      6. div-sub 74.3%

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

      7. *-lft-identity 74.3%

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

      8. associate-*l/ 74.3%

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

      9. lft-mult-inverse 100.0%

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

      10. sub-neg 100.0%

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

      11. distribute-frac-neg 100.0%

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

      12. remove-double-neg 100.0%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 100.0%

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

   6. Taylor expanded in b around 0 85.2%

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

      1. *-commutative 85.2%

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

   8. Simplified 85.2%

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

4. Final simplification 85.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -10.5:\\ \;\;\;\;1 + e^{b}\\ \mathbf{elif}\;b \leq 6.2 \cdot 10^{+45}:\\ \;\;\;\;\frac{1}{2 + a \cdot \left(a \cdot \left(0.5 + a \cdot -0.16666666666666666\right) + -1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2 + b \cdot \left(1 + b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 100.0% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.8%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Step-by-step derivation

   1. *-lft-identity 98.8%

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

   2. associate-*l/ 98.8%

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

   3. associate-/r/ 98.8%

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

   4. remove-double-neg 98.8%

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

   5. unsub-neg 98.8%

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

   6. div-sub 73.4%

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

   7. *-lft-identity 73.4%

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

   8. associate-*l/ 73.4%

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

   9. lft-mult-inverse 99.2%

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

   10. sub-neg 99.2%

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

   11. distribute-frac-neg 99.2%

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

   12. remove-double-neg 99.2%

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

   13. div-exp 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
4. Add Preprocessing

5. Final simplification 100.0%

   \[\leadsto \frac{1}{e^{b - a} + 1} \]
6. Add Preprocessing

Alternative 6: 69.6% accurate, 15.2× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 5.5e+45)
   (/ 1.0 (+ 2.0 (* a (+ (* a (+ 0.5 (* a -0.16666666666666666))) -1.0))))
   (/ 1.0 (+ 2.0 (* b (+ 1.0 (* b (+ 0.5 (* b 0.16666666666666666)))))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 5.5e+45) {
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 + (b * 0.16666666666666666))))));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 5.5d+45) then
        tmp = 1.0d0 / (2.0d0 + (a * ((a * (0.5d0 + (a * (-0.16666666666666666d0)))) + (-1.0d0))))
    else
        tmp = 1.0d0 / (2.0d0 + (b * (1.0d0 + (b * (0.5d0 + (b * 0.16666666666666666d0))))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 5.5e+45) {
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 + (b * 0.16666666666666666))))));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 5.5e+45:
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)))
	else:
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 + (b * 0.16666666666666666))))))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 5.5e+45)
		tmp = Float64(1.0 / Float64(2.0 + Float64(a * Float64(Float64(a * Float64(0.5 + Float64(a * -0.16666666666666666))) + -1.0))));
	else
		tmp = Float64(1.0 / Float64(2.0 + Float64(b * Float64(1.0 + Float64(b * Float64(0.5 + Float64(b * 0.16666666666666666)))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 5.5e+45)
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	else
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 + (b * 0.16666666666666666))))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 5.5000000000000001e45

   1. Initial program 98.3%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 98.3%

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

      2. associate-*l/ 98.3%

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

      3. associate-/r/ 98.3%

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

      4. remove-double-neg 98.3%

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

      5. unsub-neg 98.3%

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

      6. div-sub 73.1%

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

      7. *-lft-identity 73.1%

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

      8. associate-*l/ 73.1%

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

      9. lft-mult-inverse 98.9%

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

      10. sub-neg 98.9%

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

      11. distribute-frac-neg 98.9%

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

      12. remove-double-neg 98.9%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around 0 78.7%

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

   6. Taylor expanded in a around 0 67.3%

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

   if 5.5000000000000001e45 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 100.0%

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

      2. associate-*l/ 100.0%

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

      3. associate-/r/ 100.0%

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

      4. remove-double-neg 100.0%

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

      5. unsub-neg 100.0%

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

      6. div-sub 74.3%

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

      7. *-lft-identity 74.3%

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

      8. associate-*l/ 74.3%

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

      9. lft-mult-inverse 100.0%

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

      10. sub-neg 100.0%

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

      11. distribute-frac-neg 100.0%

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

      12. remove-double-neg 100.0%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 100.0%

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

   6. Taylor expanded in b around 0 85.2%

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

      1. *-commutative 85.2%

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

   8. Simplified 85.2%

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

4. Final simplification 72.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 5.5 \cdot 10^{+45}:\\ \;\;\;\;\frac{1}{2 + a \cdot \left(a \cdot \left(0.5 + a \cdot -0.16666666666666666\right) + -1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2 + b \cdot \left(1 + b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 66.8% accurate, 15.2× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 1.1e+104)
   (/ 1.0 (+ 2.0 (* a (+ (* a (+ 0.5 (* a -0.16666666666666666))) -1.0))))
   (/ 1.0 (+ 2.0 (* b (+ 1.0 (* b 0.5)))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 1.1e+104) {
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * 0.5))));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 1.1d+104) then
        tmp = 1.0d0 / (2.0d0 + (a * ((a * (0.5d0 + (a * (-0.16666666666666666d0)))) + (-1.0d0))))
    else
        tmp = 1.0d0 / (2.0d0 + (b * (1.0d0 + (b * 0.5d0))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 1.1e+104) {
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * 0.5))));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 1.1e+104:
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)))
	else:
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * 0.5))))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 1.1e+104)
		tmp = Float64(1.0 / Float64(2.0 + Float64(a * Float64(Float64(a * Float64(0.5 + Float64(a * -0.16666666666666666))) + -1.0))));
	else
		tmp = Float64(1.0 / Float64(2.0 + Float64(b * Float64(1.0 + Float64(b * 0.5)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 1.1e+104)
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	else
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * 0.5))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.1e104

   1. Initial program 98.4%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 98.4%

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

      2. associate-*l/ 98.4%

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

      3. associate-/r/ 98.4%

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

      4. remove-double-neg 98.4%

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

      5. unsub-neg 98.4%

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

      6. div-sub 72.7%

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

      7. *-lft-identity 72.7%

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

      8. associate-*l/ 72.7%

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

      9. lft-mult-inverse 99.0%

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

      10. sub-neg 99.0%

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

      11. distribute-frac-neg 99.0%

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

      12. remove-double-neg 99.0%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around 0 76.1%

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

   6. Taylor expanded in a around 0 63.9%

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

   if 1.1e104 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 100.0%

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

      2. associate-*l/ 100.0%

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

      3. associate-/r/ 100.0%

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

      4. remove-double-neg 100.0%

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

      5. unsub-neg 100.0%

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

      6. div-sub 75.9%

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

      7. *-lft-identity 75.9%

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

      8. associate-*l/ 75.9%

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

      9. lft-mult-inverse 100.0%

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

      10. sub-neg 100.0%

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

      11. distribute-frac-neg 100.0%

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

      12. remove-double-neg 100.0%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 100.0%

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

   6. Taylor expanded in b around 0 79.2%

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

      1. *-commutative 79.2%

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

   8. Simplified 79.2%

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

4. Final simplification 67.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 1.1 \cdot 10^{+104}:\\ \;\;\;\;\frac{1}{2 + a \cdot \left(a \cdot \left(0.5 + a \cdot -0.16666666666666666\right) + -1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2 + b \cdot \left(1 + b \cdot 0.5\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 63.3% accurate, 19.0× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 1.15e+104)
   (/ 1.0 (+ 2.0 (* a (+ (* a 0.5) -1.0))))
   (/ 1.0 (+ 2.0 (* b (+ 1.0 (* b 0.5)))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 1.15e+104) {
		tmp = 1.0 / (2.0 + (a * ((a * 0.5) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * 0.5))));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 1.15d+104) then
        tmp = 1.0d0 / (2.0d0 + (a * ((a * 0.5d0) + (-1.0d0))))
    else
        tmp = 1.0d0 / (2.0d0 + (b * (1.0d0 + (b * 0.5d0))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 1.15e+104) {
		tmp = 1.0 / (2.0 + (a * ((a * 0.5) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * 0.5))));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 1.15e+104:
		tmp = 1.0 / (2.0 + (a * ((a * 0.5) + -1.0)))
	else:
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * 0.5))))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 1.15e+104)
		tmp = Float64(1.0 / Float64(2.0 + Float64(a * Float64(Float64(a * 0.5) + -1.0))));
	else
		tmp = Float64(1.0 / Float64(2.0 + Float64(b * Float64(1.0 + Float64(b * 0.5)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 1.15e+104)
		tmp = 1.0 / (2.0 + (a * ((a * 0.5) + -1.0)));
	else
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * 0.5))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.14999999999999992e104

   1. Initial program 98.4%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 98.4%

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

      2. associate-*l/ 98.4%

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

      3. associate-/r/ 98.4%

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

      4. remove-double-neg 98.4%

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

      5. unsub-neg 98.4%

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

      6. div-sub 72.7%

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

      7. *-lft-identity 72.7%

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

      8. associate-*l/ 72.7%

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

      9. lft-mult-inverse 99.0%

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

      10. sub-neg 99.0%

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

      11. distribute-frac-neg 99.0%

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

      12. remove-double-neg 99.0%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around 0 76.1%

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

   6. Taylor expanded in a around 0 59.6%

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

   if 1.14999999999999992e104 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Step-by-step derivation

      1. *-lft-identity 100.0%

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

      2. associate-*l/ 100.0%

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

      3. associate-/r/ 100.0%

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

      4. remove-double-neg 100.0%

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

      5. unsub-neg 100.0%

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

      6. div-sub 75.9%

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

      7. *-lft-identity 75.9%

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

      8. associate-*l/ 75.9%

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

      9. lft-mult-inverse 100.0%

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

      10. sub-neg 100.0%

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

      11. distribute-frac-neg 100.0%

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

      12. remove-double-neg 100.0%

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

      13. div-exp 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 100.0%

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

   6. Taylor expanded in b around 0 79.2%

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

      1. *-commutative 79.2%

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

   8. Simplified 79.2%

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

4. Final simplification 64.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 1.15 \cdot 10^{+104}:\\ \;\;\;\;\frac{1}{2 + a \cdot \left(a \cdot 0.5 + -1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2 + b \cdot \left(1 + b \cdot 0.5\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 52.9% accurate, 27.7× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = 1.0d0 / (2.0d0 + (a * ((a * 0.5d0) + (-1.0d0))))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.8%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Step-by-step derivation

   1. *-lft-identity 98.8%

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

   2. associate-*l/ 98.8%

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

   3. associate-/r/ 98.8%

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

   4. remove-double-neg 98.8%

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

   5. unsub-neg 98.8%

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

   6. div-sub 73.4%

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

   7. *-lft-identity 73.4%

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

   8. associate-*l/ 73.4%

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

   9. lft-mult-inverse 99.2%

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

   10. sub-neg 99.2%

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

   11. distribute-frac-neg 99.2%

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

   12. remove-double-neg 99.2%

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

   13. div-exp 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
4. Add Preprocessing

5. Taylor expanded in b around 0 64.8%

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

6. Taylor expanded in a around 0 49.1%

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

7. Final simplification 49.1%

   \[\leadsto \frac{1}{2 + a \cdot \left(a \cdot 0.5 + -1\right)} \]
8. Add Preprocessing

Alternative 10: 40.2% accurate, 61.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{2 - a} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.8%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Step-by-step derivation

   1. *-lft-identity 98.8%

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

   2. associate-*l/ 98.8%

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

   3. associate-/r/ 98.8%

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

   4. remove-double-neg 98.8%

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

   5. unsub-neg 98.8%

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

   6. div-sub 73.4%

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

   7. *-lft-identity 73.4%

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

   8. associate-*l/ 73.4%

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

   9. lft-mult-inverse 99.2%

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

   10. sub-neg 99.2%

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

   11. distribute-frac-neg 99.2%

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

   12. remove-double-neg 99.2%

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

   13. div-exp 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
4. Add Preprocessing

5. Taylor expanded in b around 0 64.8%

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

6. Taylor expanded in a around 0 39.2%

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

   1. neg-mul-1 39.2%

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

   2. unsub-neg 39.2%

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

8. Simplified 39.2%

   \[\leadsto \frac{1}{\color{blue}{2 - a}} \]
9. Add Preprocessing

Alternative 11: 39.5% accurate, 61.0× speedup

Math

\[\begin{array}{l} \\ 0.5 + a \cdot 0.25 \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (+ 0.5 (* a 0.25)))

C

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

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = 0.5d0 + (a * 0.25d0)
end function

Java

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

Python

def code(a, b):
	return 0.5 + (a * 0.25)

Julia

function code(a, b)
	return Float64(0.5 + Float64(a * 0.25))
end

MATLAB

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

Wolfram

code[a_, b_] := N[(0.5 + N[(a * 0.25), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 98.8%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Step-by-step derivation

   1. *-lft-identity 98.8%

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

   2. associate-*l/ 98.8%

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

   3. associate-/r/ 98.8%

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

   4. remove-double-neg 98.8%

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

   5. unsub-neg 98.8%

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

   6. div-sub 73.4%

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

   7. *-lft-identity 73.4%

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

   8. associate-*l/ 73.4%

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

   9. lft-mult-inverse 99.2%

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

   10. sub-neg 99.2%

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

   11. distribute-frac-neg 99.2%

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

   12. remove-double-neg 99.2%

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

   13. div-exp 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
4. Add Preprocessing

5. Taylor expanded in b around 0 64.8%

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

6. Taylor expanded in a around 0 38.7%

   \[\leadsto \color{blue}{0.5 + 0.25 \cdot a} \]
7. Step-by-step derivation

   1. *-commutative 38.7%

      \[\leadsto 0.5 + \color{blue}{a \cdot 0.25} \]

8. Simplified 38.7%

   \[\leadsto \color{blue}{0.5 + a \cdot 0.25} \]
9. Add Preprocessing

Alternative 12: 39.4% accurate, 305.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

real(8) function code(a, b)
    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.8%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Step-by-step derivation

   1. *-lft-identity 98.8%

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

   2. associate-*l/ 98.8%

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

   3. associate-/r/ 98.8%

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

   4. remove-double-neg 98.8%

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

   5. unsub-neg 98.8%

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

   6. div-sub 73.4%

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

   7. *-lft-identity 73.4%

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

   8. associate-*l/ 73.4%

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

   9. lft-mult-inverse 99.2%

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

   10. sub-neg 99.2%

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

   11. distribute-frac-neg 99.2%

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

   12. remove-double-neg 99.2%

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

   13. div-exp 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1}{1 + e^{b - a}}} \]
4. Add Preprocessing

5. Taylor expanded in a around 0 81.8%

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

6. Taylor expanded in b around 0 38.5%

   \[\leadsto \color{blue}{0.5} \]
7. Add Preprocessing

Developer target: 100.0% accurate, 2.9× 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

real(8) function code(a, b)
    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 2024106 
(FPCore (a b)
  :name "Quotient of sum of exps"
  :precision binary64

  :alt
  (/ 1.0 (+ 1.0 (exp (- b a))))

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