symmetry log of sum of exp

Percentage Accurate: 54.3% → 98.2%

Time: 19.2s

Alternatives: 11

Speedup: 2.9×

• could not determine a ground truth

  1. a = -2.5186519056305503e+70
  2. b = -1.783037820881385e+46

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 54.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;e^{a} \leq 0:\\ \;\;\;\;\frac{b}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(e^{a}\right) + b \cdot 0.5\\ \end{array} \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
 :precision binary64
 (if (<= (exp a) 0.0) (/ b (+ (exp a) 1.0)) (+ (log1p (exp a)) (* b 0.5))))

C

assert(a < b);
double code(double a, double b) {
	double tmp;
	if (exp(a) <= 0.0) {
		tmp = b / (exp(a) + 1.0);
	} else {
		tmp = log1p(exp(a)) + (b * 0.5);
	}
	return tmp;
}

Java

assert a < b;
public static double code(double a, double b) {
	double tmp;
	if (Math.exp(a) <= 0.0) {
		tmp = b / (Math.exp(a) + 1.0);
	} else {
		tmp = Math.log1p(Math.exp(a)) + (b * 0.5);
	}
	return tmp;
}

Python

[a, b] = sort([a, b])
def code(a, b):
	tmp = 0
	if math.exp(a) <= 0.0:
		tmp = b / (math.exp(a) + 1.0)
	else:
		tmp = math.log1p(math.exp(a)) + (b * 0.5)
	return tmp

Julia

a, b = sort([a, b])
function code(a, b)
	tmp = 0.0
	if (exp(a) <= 0.0)
		tmp = Float64(b / Float64(exp(a) + 1.0));
	else
		tmp = Float64(log1p(exp(a)) + Float64(b * 0.5));
	end
	return tmp
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := If[LessEqual[N[Exp[a], $MachinePrecision], 0.0], N[(b / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Log[1 + N[Exp[a], $MachinePrecision]], $MachinePrecision] + N[(b * 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 a) < 0.0

   1. Initial program 5.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 100.0%

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

      1. log1p-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in b around inf 100.0%

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

   if 0.0 < (exp.f64 a)

   1. Initial program 68.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 65.6%

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

      1. log1p-def 65.6%

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

   4. Simplified 65.6%

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

   5. Taylor expanded in a around 0 65.6%

      \[\leadsto \mathsf{log1p}\left(e^{a}\right) + \color{blue}{0.5 \cdot b} \]
3. Recombined 2 regimes into one program.

4. Final simplification 74.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{a} \leq 0:\\ \;\;\;\;\frac{b}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(e^{a}\right) + b \cdot 0.5\\ \end{array} \]

Alternative 2: 97.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;e^{a} \leq 4 \cdot 10^{-21}:\\ \;\;\;\;\frac{b}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\log \left(e^{a} + \left(b + 1\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
 :precision binary64
 (if (<= (exp a) 4e-21) (/ b (+ (exp a) 1.0)) (log (+ (exp a) (+ b 1.0)))))

C

assert(a < b);
double code(double a, double b) {
	double tmp;
	if (exp(a) <= 4e-21) {
		tmp = b / (exp(a) + 1.0);
	} else {
		tmp = log((exp(a) + (b + 1.0)));
	}
	return tmp;
}

Fortran

NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (exp(a) <= 4d-21) then
        tmp = b / (exp(a) + 1.0d0)
    else
        tmp = log((exp(a) + (b + 1.0d0)))
    end if
    code = tmp
end function

Java

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

Python

[a, b] = sort([a, b])
def code(a, b):
	tmp = 0
	if math.exp(a) <= 4e-21:
		tmp = b / (math.exp(a) + 1.0)
	else:
		tmp = math.log((math.exp(a) + (b + 1.0)))
	return tmp

Julia

a, b = sort([a, b])
function code(a, b)
	tmp = 0.0
	if (exp(a) <= 4e-21)
		tmp = Float64(b / Float64(exp(a) + 1.0));
	else
		tmp = log(Float64(exp(a) + Float64(b + 1.0)));
	end
	return tmp
end

MATLAB

a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
	tmp = 0.0;
	if (exp(a) <= 4e-21)
		tmp = b / (exp(a) + 1.0);
	else
		tmp = log((exp(a) + (b + 1.0)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := If[LessEqual[N[Exp[a], $MachinePrecision], 4e-21], N[(b / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[Log[N[(N[Exp[a], $MachinePrecision] + N[(b + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 a) < 3.99999999999999963e-21

   1. Initial program 5.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 100.0%

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

      1. log1p-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in b around inf 100.0%

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

   if 3.99999999999999963e-21 < (exp.f64 a)

   1. Initial program 68.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 64.6%

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

      1. associate-+r+ 64.6%

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

      2. +-commutative 64.6%

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

      3. associate-+l+ 64.6%

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

   4. Simplified 64.6%

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

4. Final simplification 73.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{a} \leq 4 \cdot 10^{-21}:\\ \;\;\;\;\frac{b}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\log \left(e^{a} + \left(b + 1\right)\right)\\ \end{array} \]

Alternative 3: 98.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \mathsf{log1p}\left(e^{a}\right) + \frac{b}{e^{a} + 1} \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b) :precision binary64 (+ (log1p (exp a)) (/ b (+ (exp a) 1.0))))

C

assert(a < b);
double code(double a, double b) {
	return log1p(exp(a)) + (b / (exp(a) + 1.0));
}

Java

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

Python

[a, b] = sort([a, b])
def code(a, b):
	return math.log1p(math.exp(a)) + (b / (math.exp(a) + 1.0))

Julia

a, b = sort([a, b])
function code(a, b)
	return Float64(log1p(exp(a)) + Float64(b / Float64(exp(a) + 1.0)))
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := N[(N[Log[1 + N[Exp[a], $MachinePrecision]], $MachinePrecision] + N[(b / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 53.3%

   \[\log \left(e^{a} + e^{b}\right) \]

2. Taylor expanded in b around 0 74.0%

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

   1. log1p-def 74.1%

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

4. Simplified 74.1%

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

5. Final simplification 74.1%

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

Alternative 4: 97.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;e^{a} \leq 0:\\ \;\;\;\;\frac{b}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(e^{a}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
 :precision binary64
 (if (<= (exp a) 0.0) (/ b (+ (exp a) 1.0)) (log1p (exp a))))

C

assert(a < b);
double code(double a, double b) {
	double tmp;
	if (exp(a) <= 0.0) {
		tmp = b / (exp(a) + 1.0);
	} else {
		tmp = log1p(exp(a));
	}
	return tmp;
}

Java

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

Python

[a, b] = sort([a, b])
def code(a, b):
	tmp = 0
	if math.exp(a) <= 0.0:
		tmp = b / (math.exp(a) + 1.0)
	else:
		tmp = math.log1p(math.exp(a))
	return tmp

Julia

a, b = sort([a, b])
function code(a, b)
	tmp = 0.0
	if (exp(a) <= 0.0)
		tmp = Float64(b / Float64(exp(a) + 1.0));
	else
		tmp = log1p(exp(a));
	end
	return tmp
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := If[LessEqual[N[Exp[a], $MachinePrecision], 0.0], N[(b / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[Log[1 + N[Exp[a], $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 a) < 0.0

   1. Initial program 5.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 100.0%

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

      1. log1p-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in b around inf 100.0%

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

   if 0.0 < (exp.f64 a)

   1. Initial program 68.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 65.4%

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

      1. log1p-def 65.4%

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

   4. Simplified 65.4%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(e^{a}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.9%

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

Alternative 5: 98.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \mathsf{log1p}\left(e^{a} + \mathsf{expm1}\left(b\right)\right) \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b) :precision binary64 (log1p (+ (exp a) (expm1 b))))

C

assert(a < b);
double code(double a, double b) {
	return log1p((exp(a) + expm1(b)));
}

Java

assert a < b;
public static double code(double a, double b) {
	return Math.log1p((Math.exp(a) + Math.expm1(b)));
}

Python

[a, b] = sort([a, b])
def code(a, b):
	return math.log1p((math.exp(a) + math.expm1(b)))

Julia

a, b = sort([a, b])
function code(a, b)
	return log1p(Float64(exp(a) + expm1(b)))
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := N[Log[1 + N[(N[Exp[a], $MachinePrecision] + N[(Exp[b] - 1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 53.3%

   \[\log \left(e^{a} + e^{b}\right) \]
2. Step-by-step derivation

   1. add-sqr-sqrt 52.1%

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

   2. log-prod 52.5%

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

3. Applied egg-rr 52.5%

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

   1. log-prod 52.1%

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

   2. rem-square-sqrt 53.3%

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

   3. log1p-expm1 53.3%

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

   4. expm1-def 53.3%

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

   5. rem-exp-log 53.3%

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

   6. associate--l+ 53.3%

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

   7. expm1-def 76.1%

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

5. Simplified 76.1%

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

6. Final simplification 76.1%

   \[\leadsto \mathsf{log1p}\left(e^{a} + \mathsf{expm1}\left(b\right)\right) \]

Alternative 6: 97.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;e^{a} \leq 4 \cdot 10^{-21}:\\ \;\;\;\;\frac{b}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 0.5 + \log \left(b + 2\right)\\ \end{array} \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
 :precision binary64
 (if (<= (exp a) 4e-21) (/ b (+ (exp a) 1.0)) (+ (* a 0.5) (log (+ b 2.0)))))

C

assert(a < b);
double code(double a, double b) {
	double tmp;
	if (exp(a) <= 4e-21) {
		tmp = b / (exp(a) + 1.0);
	} else {
		tmp = (a * 0.5) + log((b + 2.0));
	}
	return tmp;
}

Fortran

NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (exp(a) <= 4d-21) then
        tmp = b / (exp(a) + 1.0d0)
    else
        tmp = (a * 0.5d0) + log((b + 2.0d0))
    end if
    code = tmp
end function

Java

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

Python

[a, b] = sort([a, b])
def code(a, b):
	tmp = 0
	if math.exp(a) <= 4e-21:
		tmp = b / (math.exp(a) + 1.0)
	else:
		tmp = (a * 0.5) + math.log((b + 2.0))
	return tmp

Julia

a, b = sort([a, b])
function code(a, b)
	tmp = 0.0
	if (exp(a) <= 4e-21)
		tmp = Float64(b / Float64(exp(a) + 1.0));
	else
		tmp = Float64(Float64(a * 0.5) + log(Float64(b + 2.0)));
	end
	return tmp
end

MATLAB

a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
	tmp = 0.0;
	if (exp(a) <= 4e-21)
		tmp = b / (exp(a) + 1.0);
	else
		tmp = (a * 0.5) + log((b + 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := If[LessEqual[N[Exp[a], $MachinePrecision], 4e-21], N[(b / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(a * 0.5), $MachinePrecision] + N[Log[N[(b + 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 a) < 3.99999999999999963e-21

   1. Initial program 5.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 100.0%

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

      1. log1p-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in b around inf 100.0%

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

   if 3.99999999999999963e-21 < (exp.f64 a)

   1. Initial program 68.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 64.6%

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

      1. associate-+r+ 64.6%

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

      2. +-commutative 64.6%

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

      3. associate-+l+ 64.6%

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

   4. Simplified 64.6%

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

   5. Taylor expanded in a around 0 64.4%

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

   6. Taylor expanded in b around 0 64.4%

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

4. Final simplification 73.1%

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

Alternative 7: 97.2% accurate, 1.5× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;e^{a} \leq 4 \cdot 10^{-21}:\\ \;\;\;\;\frac{b}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\log \left(b + \left(a + 2\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
 :precision binary64
 (if (<= (exp a) 4e-21) (/ b (+ (exp a) 1.0)) (log (+ b (+ a 2.0)))))

C

assert(a < b);
double code(double a, double b) {
	double tmp;
	if (exp(a) <= 4e-21) {
		tmp = b / (exp(a) + 1.0);
	} else {
		tmp = log((b + (a + 2.0)));
	}
	return tmp;
}

Fortran

NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (exp(a) <= 4d-21) then
        tmp = b / (exp(a) + 1.0d0)
    else
        tmp = log((b + (a + 2.0d0)))
    end if
    code = tmp
end function

Java

assert a < b;
public static double code(double a, double b) {
	double tmp;
	if (Math.exp(a) <= 4e-21) {
		tmp = b / (Math.exp(a) + 1.0);
	} else {
		tmp = Math.log((b + (a + 2.0)));
	}
	return tmp;
}

Python

[a, b] = sort([a, b])
def code(a, b):
	tmp = 0
	if math.exp(a) <= 4e-21:
		tmp = b / (math.exp(a) + 1.0)
	else:
		tmp = math.log((b + (a + 2.0)))
	return tmp

Julia

a, b = sort([a, b])
function code(a, b)
	tmp = 0.0
	if (exp(a) <= 4e-21)
		tmp = Float64(b / Float64(exp(a) + 1.0));
	else
		tmp = log(Float64(b + Float64(a + 2.0)));
	end
	return tmp
end

MATLAB

a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
	tmp = 0.0;
	if (exp(a) <= 4e-21)
		tmp = b / (exp(a) + 1.0);
	else
		tmp = log((b + (a + 2.0)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := If[LessEqual[N[Exp[a], $MachinePrecision], 4e-21], N[(b / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[Log[N[(b + N[(a + 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 a) < 3.99999999999999963e-21

   1. Initial program 5.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 100.0%

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

      1. log1p-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in b around inf 100.0%

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

   if 3.99999999999999963e-21 < (exp.f64 a)

   1. Initial program 68.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 64.6%

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

      1. associate-+r+ 64.6%

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

      2. +-commutative 64.6%

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

      3. associate-+l+ 64.6%

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

   4. Simplified 64.6%

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

   5. Taylor expanded in a around 0 64.3%

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

      1. associate-+r+ 64.3%

         \[\leadsto \log \color{blue}{\left(\left(2 + a\right) + b\right)} \]

      2. +-commutative 64.3%

         \[\leadsto \log \color{blue}{\left(b + \left(2 + a\right)\right)} \]

   7. Simplified 64.3%

      \[\leadsto \log \color{blue}{\left(b + \left(2 + a\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{a} \leq 4 \cdot 10^{-21}:\\ \;\;\;\;\frac{b}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\log \left(b + \left(a + 2\right)\right)\\ \end{array} \]

Alternative 8: 57.2% accurate, 2.8× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq -1:\\ \;\;\;\;b \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\log \left(b + \left(a + 2\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b)
 :precision binary64
 (if (<= a -1.0) (* b 0.5) (log (+ b (+ a 2.0)))))

C

assert(a < b);
double code(double a, double b) {
	double tmp;
	if (a <= -1.0) {
		tmp = b * 0.5;
	} else {
		tmp = log((b + (a + 2.0)));
	}
	return tmp;
}

Fortran

NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-1.0d0)) then
        tmp = b * 0.5d0
    else
        tmp = log((b + (a + 2.0d0)))
    end if
    code = tmp
end function

Java

assert a < b;
public static double code(double a, double b) {
	double tmp;
	if (a <= -1.0) {
		tmp = b * 0.5;
	} else {
		tmp = Math.log((b + (a + 2.0)));
	}
	return tmp;
}

Python

[a, b] = sort([a, b])
def code(a, b):
	tmp = 0
	if a <= -1.0:
		tmp = b * 0.5
	else:
		tmp = math.log((b + (a + 2.0)))
	return tmp

Julia

a, b = sort([a, b])
function code(a, b)
	tmp = 0.0
	if (a <= -1.0)
		tmp = Float64(b * 0.5);
	else
		tmp = log(Float64(b + Float64(a + 2.0)));
	end
	return tmp
end

MATLAB

a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -1.0)
		tmp = b * 0.5;
	else
		tmp = log((b + (a + 2.0)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := If[LessEqual[a, -1.0], N[(b * 0.5), $MachinePrecision], N[Log[N[(b + N[(a + 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1

   1. Initial program 5.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 100.0%

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

      1. log1p-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in b around inf 100.0%

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

   6. Taylor expanded in a around 0 18.8%

      \[\leadsto \color{blue}{0.5 \cdot b} \]

   if -1 < a

   1. Initial program 68.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 64.6%

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

      1. associate-+r+ 64.6%

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

      2. +-commutative 64.6%

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

      3. associate-+l+ 64.6%

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

   4. Simplified 64.6%

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

   5. Taylor expanded in a around 0 64.3%

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

      1. associate-+r+ 64.3%

         \[\leadsto \log \color{blue}{\left(\left(2 + a\right) + b\right)} \]

      2. +-commutative 64.3%

         \[\leadsto \log \color{blue}{\left(b + \left(2 + a\right)\right)} \]

   7. Simplified 64.3%

      \[\leadsto \log \color{blue}{\left(b + \left(2 + a\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 53.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1:\\ \;\;\;\;b \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\log \left(b + \left(a + 2\right)\right)\\ \end{array} \]

Alternative 9: 56.7% accurate, 2.9× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq -104:\\ \;\;\;\;b \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\log \left(b + 2\right)\\ \end{array} \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b) :precision binary64 (if (<= a -104.0) (* b 0.5) (log (+ b 2.0))))

C

assert(a < b);
double code(double a, double b) {
	double tmp;
	if (a <= -104.0) {
		tmp = b * 0.5;
	} else {
		tmp = log((b + 2.0));
	}
	return tmp;
}

Fortran

NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-104.0d0)) then
        tmp = b * 0.5d0
    else
        tmp = log((b + 2.0d0))
    end if
    code = tmp
end function

Java

assert a < b;
public static double code(double a, double b) {
	double tmp;
	if (a <= -104.0) {
		tmp = b * 0.5;
	} else {
		tmp = Math.log((b + 2.0));
	}
	return tmp;
}

Python

[a, b] = sort([a, b])
def code(a, b):
	tmp = 0
	if a <= -104.0:
		tmp = b * 0.5
	else:
		tmp = math.log((b + 2.0))
	return tmp

Julia

a, b = sort([a, b])
function code(a, b)
	tmp = 0.0
	if (a <= -104.0)
		tmp = Float64(b * 0.5);
	else
		tmp = log(Float64(b + 2.0));
	end
	return tmp
end

MATLAB

a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -104.0)
		tmp = b * 0.5;
	else
		tmp = log((b + 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := If[LessEqual[a, -104.0], N[(b * 0.5), $MachinePrecision], N[Log[N[(b + 2.0), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -104

   1. Initial program 5.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 100.0%

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

      1. log1p-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in b around inf 100.0%

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

   6. Taylor expanded in a around 0 18.8%

      \[\leadsto \color{blue}{0.5 \cdot b} \]

   if -104 < a

   1. Initial program 68.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 64.6%

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

      1. associate-+r+ 64.6%

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

      2. +-commutative 64.6%

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

      3. associate-+l+ 64.6%

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

   4. Simplified 64.6%

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

   5. Taylor expanded in a around 0 63.7%

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

      1. +-commutative 63.7%

         \[\leadsto \log \color{blue}{\left(b + 2\right)} \]

   7. Simplified 63.7%

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

4. Final simplification 52.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -104:\\ \;\;\;\;b \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\log \left(b + 2\right)\\ \end{array} \]

Alternative 10: 56.2% accurate, 2.9× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq -100:\\ \;\;\;\;b \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\log 2\\ \end{array} \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b) :precision binary64 (if (<= a -100.0) (* b 0.5) (log 2.0)))

C

assert(a < b);
double code(double a, double b) {
	double tmp;
	if (a <= -100.0) {
		tmp = b * 0.5;
	} else {
		tmp = log(2.0);
	}
	return tmp;
}

Fortran

NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-100.0d0)) then
        tmp = b * 0.5d0
    else
        tmp = log(2.0d0)
    end if
    code = tmp
end function

Java

assert a < b;
public static double code(double a, double b) {
	double tmp;
	if (a <= -100.0) {
		tmp = b * 0.5;
	} else {
		tmp = Math.log(2.0);
	}
	return tmp;
}

Python

[a, b] = sort([a, b])
def code(a, b):
	tmp = 0
	if a <= -100.0:
		tmp = b * 0.5
	else:
		tmp = math.log(2.0)
	return tmp

Julia

a, b = sort([a, b])
function code(a, b)
	tmp = 0.0
	if (a <= -100.0)
		tmp = Float64(b * 0.5);
	else
		tmp = log(2.0);
	end
	return tmp
end

MATLAB

a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -100.0)
		tmp = b * 0.5;
	else
		tmp = log(2.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := If[LessEqual[a, -100.0], N[(b * 0.5), $MachinePrecision], N[Log[2.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -100

   1. Initial program 5.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 100.0%

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

      1. log1p-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in b around inf 100.0%

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

   6. Taylor expanded in a around 0 18.8%

      \[\leadsto \color{blue}{0.5 \cdot b} \]

   if -100 < a

   1. Initial program 68.8%

      \[\log \left(e^{a} + e^{b}\right) \]

   2. Taylor expanded in b around 0 65.6%

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

      1. log1p-def 65.6%

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

   4. Simplified 65.6%

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

   5. Taylor expanded in a around 0 64.6%

      \[\leadsto \color{blue}{0.5 \cdot b + \log 2} \]

   6. Taylor expanded in b around 0 64.5%

      \[\leadsto \color{blue}{\log 2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 53.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -100:\\ \;\;\;\;b \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\log 2\\ \end{array} \]

Alternative 11: 11.9% accurate, 101.0× speedup

Math

\[\begin{array}{l} [a, b] = \mathsf{sort}([a, b])\\ \\ b \cdot 0.5 \end{array} \]

FPCore

NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (a b) :precision binary64 (* b 0.5))

C

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

Fortran

NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = b * 0.5d0
end function

Java

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

Python

[a, b] = sort([a, b])
def code(a, b):
	return b * 0.5

Julia

a, b = sort([a, b])
function code(a, b)
	return Float64(b * 0.5)
end

MATLAB

a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
	tmp = b * 0.5;
end

Wolfram

NOTE: a and b should be sorted in increasing order before calling this function.
code[a_, b_] := N[(b * 0.5), $MachinePrecision]

Derivation

1. Initial program 53.3%

   \[\log \left(e^{a} + e^{b}\right) \]

2. Taylor expanded in b around 0 74.0%

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

   1. log1p-def 74.1%

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

4. Simplified 74.1%

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

5. Taylor expanded in b around inf 27.2%

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

6. Taylor expanded in a around 0 7.3%

   \[\leadsto \color{blue}{0.5 \cdot b} \]

7. Final simplification 7.3%

   \[\leadsto b \cdot 0.5 \]

Reproduce

herbie shell --seed 2023279 
(FPCore (a b)
  :name "symmetry log of sum of exp"
  :precision binary64
  (log (+ (exp a) (exp b))))