Quotient of sum of exps

Percentage Accurate: 99.0% → 99.9%

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: 99.0% 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: 99.9% accurate, 2.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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 68.3%

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

   7. *-lft-identity 68.3%

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

   8. associate-*l/ 68.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. Step-by-step derivation

   1. *-un-lft-identity 100.0%

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

   2. exp-prod 100.0%

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

   3. expm1-log1p-u 76.9%

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

   4. expm1-undefine 76.9%

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

   5. pow-sub 76.9%

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

6. Applied egg-rr 76.9%

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

   1. exp-1-e 76.9%

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

   2. log1p-undefine 76.9%

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

   3. rem-exp-log 100.0%

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

   4. unpow1 100.0%

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

   5. exp-1-e 100.0%

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

8. Simplified 100.0%

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

Alternative 2: 98.4% accurate, 2.7× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (a <= -190.0) {
		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 <= (-190.0d0)) 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 <= -190.0) {
		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 <= -190.0:
		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 <= -190.0)
		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 <= -190.0)
		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, -190.0], 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 < -190

   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 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 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 100.0%

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

   if -190 < a

   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 100.0%

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

      7. *-lft-identity 100.0%

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

      8. associate-*l/ 100.0%

         \[\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.0%

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

Alternative 3: 93.1% accurate, 2.8× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -5.7e+91) (/ -6.0 (pow a 3.0)) (/ 1.0 (+ 1.0 (exp b)))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -5.7e+91) {
		tmp = -6.0 / pow(a, 3.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 <= (-5.7d+91)) then
        tmp = (-6.0d0) / (a ** 3.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 <= -5.7e+91) {
		tmp = -6.0 / Math.pow(a, 3.0);
	} else {
		tmp = 1.0 / (1.0 + Math.exp(b));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if a <= -5.7e+91:
		tmp = -6.0 / math.pow(a, 3.0)
	else:
		tmp = 1.0 / (1.0 + math.exp(b))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -5.7e+91)
		tmp = Float64(-6.0 / (a ^ 3.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 <= -5.7e+91)
		tmp = -6.0 / (a ^ 3.0);
	else
		tmp = 1.0 / (1.0 + exp(b));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[a, -5.7e+91], N[(-6.0 / N[Power[a, 3.0], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(1.0 + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -5.69999999999999964e91

   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 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 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 100.0%

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

   6. Taylor expanded in a around 0 94.2%

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

   7. Taylor expanded in a around inf 95.5%

      \[\leadsto \color{blue}{\frac{-6}{{a}^{3}}} \]

   if -5.69999999999999964e91 < a

   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 89.7%

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

      7. *-lft-identity 89.7%

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

      8. associate-*l/ 89.7%

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

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

Alternative 4: 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]

Derivation

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 68.3%

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

   7. *-lft-identity 68.3%

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

   8. associate-*l/ 68.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. Add Preprocessing

Alternative 5: 71.6% accurate, 15.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 1.02 \cdot 10^{+103}:\\ \;\;\;\;\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 1.02e+103)
   (/ 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 <= 1.02e+103) {
		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 <= 1.02d+103) 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 <= 1.02e+103) {
		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 <= 1.02e+103:
		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 <= 1.02e+103)
		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 <= 1.02e+103)
		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, 1.02e+103], 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 < 1.01999999999999991e103

   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 73.5%

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

      7. *-lft-identity 73.5%

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

      8. associate-*l/ 73.5%

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

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

   6. Taylor expanded in a around 0 60.4%

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

   if 1.01999999999999991e103 < 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 45.8%

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

      7. *-lft-identity 45.8%

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

      8. associate-*l/ 45.8%

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

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

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

   8. Simplified 100.0%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 1.02 \cdot 10^{+103}:\\ \;\;\;\;\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 6: 68.2% accurate, 15.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 3.4 \cdot 10^{+153}:\\ \;\;\;\;\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(b \cdot 0.5\right)}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (b <= 3.4e+153) {
		tmp = 1.0 / (2.0 + (a * ((a * (0.5 + (a * -0.16666666666666666))) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (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 <= 3.4d+153) then
        tmp = 1.0d0 / (2.0d0 + (a * ((a * (0.5d0 + (a * (-0.16666666666666666d0)))) + (-1.0d0))))
    else
        tmp = 1.0d0 / (2.0d0 + (b * (b * 0.5d0)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 3.4e+153)
		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(b * 0.5))));
	end
	return tmp
end

MATLAB

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

Wolfram

code[a_, b_] := If[LessEqual[b, 3.4e+153], 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[(b * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 3.3999999999999997e153

   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 72.1%

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

      7. *-lft-identity 72.1%

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

      8. associate-*l/ 72.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 68.5%

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

   6. Taylor expanded in a around 0 59.3%

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

   if 3.3999999999999997e153 < 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 45.9%

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

      7. *-lft-identity 45.9%

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

      8. associate-*l/ 45.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 100.0%

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

   7. Taylor expanded in b around inf 100.0%

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

4. Final simplification 65.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 3.4 \cdot 10^{+153}:\\ \;\;\;\;\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(b \cdot 0.5\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 68.0% accurate, 16.9× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (b <= 1.8e+154) {
		tmp = 1.0 / (2.0 + (a * ((a * (a * -0.16666666666666666)) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (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.8d+154) then
        tmp = 1.0d0 / (2.0d0 + (a * ((a * (a * (-0.16666666666666666d0))) + (-1.0d0))))
    else
        tmp = 1.0d0 / (2.0d0 + (b * (b * 0.5d0)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.8e154

   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 72.1%

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

      7. *-lft-identity 72.1%

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

      8. associate-*l/ 72.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 68.5%

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

   6. Taylor expanded in a around 0 59.3%

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

   7. Taylor expanded in a around inf 59.2%

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

      1. *-commutative 59.2%

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

   9. Simplified 59.2%

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

   if 1.8e154 < 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 45.9%

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

      7. *-lft-identity 45.9%

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

      8. associate-*l/ 45.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 100.0%

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

   7. Taylor expanded in b around inf 100.0%

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

4. Final simplification 65.1%

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

Alternative 8: 64.8% accurate, 19.0× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (b <= 1.8e+154) {
		tmp = 1.0 / (2.0 + (a * ((a * 0.5) + -1.0)));
	} else {
		tmp = 1.0 / (2.0 + (b * (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.8d+154) then
        tmp = 1.0d0 / (2.0d0 + (a * ((a * 0.5d0) + (-1.0d0))))
    else
        tmp = 1.0d0 / (2.0d0 + (b * (b * 0.5d0)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 1.8e+154)
		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(b * 0.5))));
	end
	return tmp
end

MATLAB

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

Wolfram

code[a_, b_] := If[LessEqual[b, 1.8e+154], 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[(b * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 1.8e154

   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 72.1%

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

      7. *-lft-identity 72.1%

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

      8. associate-*l/ 72.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 68.5%

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

   6. Taylor expanded in a around 0 56.2%

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

   if 1.8e154 < 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 45.9%

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

      7. *-lft-identity 45.9%

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

      8. associate-*l/ 45.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 100.0%

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

   7. Taylor expanded in b around inf 100.0%

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

4. Final simplification 62.5%

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

Alternative 9: 61.4% accurate, 21.8× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (a <= -8.5e+143) {
		tmp = (-2.0 / a) / a;
	} else {
		tmp = 1.0 / (2.0 + (b * (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 (a <= (-8.5d+143)) then
        tmp = ((-2.0d0) / a) / a
    else
        tmp = 1.0d0 / (2.0d0 + (b * (b * 0.5d0)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -8.4999999999999998e143

   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 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 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 100.0%

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

   6. Taylor expanded in a around 0 7.3%

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

      1. neg-mul-1 7.3%

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

      2. unsub-neg 7.3%

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

   8. Simplified 7.3%

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

   9. Taylor expanded in a around inf 7.3%

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

       1. associate-*r/ 7.3%

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

       2. neg-mul-1 7.3%

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

       3. distribute-neg-in 7.3%

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

       4. metadata-eval 7.3%

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

       5. associate-*r/ 7.3%

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

       6. metadata-eval 7.3%

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

       7. distribute-neg-frac 7.3%

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

       8. metadata-eval 7.3%

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

   11. Simplified 7.3%

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

   12. Taylor expanded in a around 0 91.5%

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

   if -8.4999999999999998e143 < a

   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 84.5%

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

      7. *-lft-identity 84.5%

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

      8. associate-*l/ 84.5%

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

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

   6. Taylor expanded in b around 0 51.7%

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

   7. Taylor expanded in b around inf 51.4%

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

4. Final simplification 59.1%

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

Alternative 10: 53.0% accurate, 30.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.9:\\ \;\;\;\;\frac{\frac{-2}{a}}{a}\\ \mathbf{else}:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -2.9) (/ (/ -2.0 a) a) (+ 0.5 (* a 0.25))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -2.9) {
		tmp = (-2.0 / a) / a;
	} else {
		tmp = 0.5 + (a * 0.25);
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(a, b):
	tmp = 0
	if a <= -2.9:
		tmp = (-2.0 / a) / a
	else:
		tmp = 0.5 + (a * 0.25)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -2.9)
		tmp = Float64(Float64(-2.0 / a) / a);
	else
		tmp = Float64(0.5 + Float64(a * 0.25));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -2.9)
		tmp = (-2.0 / a) / a;
	else
		tmp = 0.5 + (a * 0.25);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -2.89999999999999991

   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 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 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 100.0%

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

   6. Taylor expanded in a around 0 5.9%

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

      1. neg-mul-1 5.9%

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

      2. unsub-neg 5.9%

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

   8. Simplified 5.9%

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

   9. Taylor expanded in a around inf 5.9%

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

       1. associate-*r/ 5.9%

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

       2. neg-mul-1 5.9%

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

       3. distribute-neg-in 5.9%

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

       4. metadata-eval 5.9%

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

       5. associate-*r/ 5.9%

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

       6. metadata-eval 5.9%

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

       7. distribute-neg-frac 5.9%

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

       8. metadata-eval 5.9%

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

   11. Simplified 5.9%

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

   12. Taylor expanded in a around 0 57.2%

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

   if -2.89999999999999991 < a

   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 100.0%

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

      7. *-lft-identity 100.0%

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

      8. associate-*l/ 100.0%

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

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

   6. Taylor expanded in a around 0 50.4%

      \[\leadsto \color{blue}{0.5 + 0.25 \cdot a} \]
3. Recombined 2 regimes into one program.

4. Final simplification 52.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -2.9:\\ \;\;\;\;\frac{\frac{-2}{a}}{a}\\ \mathbf{else}:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 40.9% 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 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 68.3%

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

   7. *-lft-identity 68.3%

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

   8. associate-*l/ 68.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 b around 0 66.6%

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

6. Taylor expanded in a around 0 36.2%

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

   1. neg-mul-1 36.2%

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

   2. unsub-neg 36.2%

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

8. Simplified 36.2%

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

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

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

   7. *-lft-identity 68.3%

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

   8. associate-*l/ 68.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 80.8%

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

6. Taylor expanded in b around 0 35.3%

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

Developer Target 1: 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 2024129 
(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))))