Average Error: 39.2 → 0.3
Time: 3.7s
Precision: 64
\[\log \left(1 + x\right)\]
↓
\[\begin{array}{l} \mathbf{if}\;1 + x \le 1.0000000183640019:\\ \;\;\;\;\left(1 \cdot x + \log 1\right) - \frac{1}{2} \cdot \frac{{x}^{2}}{{1}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\log \left(1 + x\right)\\ \end{array}\]
\log \left(1 + x\right)
↓
\begin{array}{l}
\mathbf{if}\;1 + x \le 1.0000000183640019:\\
\;\;\;\;\left(1 \cdot x + \log 1\right) - \frac{1}{2} \cdot \frac{{x}^{2}}{{1}^{2}}\\

\mathbf{else}:\\
\;\;\;\;\log \left(1 + x\right)\\

\end{array}
double code(double x) {
	return log((1.0 + x));
}
↓
double code(double x) {
	double VAR;
	if (((1.0 + x) <= 1.0000000183640019)) {
		VAR = (((1.0 * x) + log(1.0)) - (0.5 * (pow(x, 2.0) / pow(1.0, 2.0))));
	} else {
		VAR = log((1.0 + x));
	}
	return VAR;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original39.2
Target0.1
Herbie0.3
\[\begin{array}{l} \mathbf{if}\;1 + x = 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \log \left(1 + x\right)}{\left(1 + x\right) - 1}\\ \end{array}\]

Derivation

  1. Split input into 2 regimes

  2. if (+ 1.0 x) < 1.0000000183640019

    1. Initial program 59.2

      \[\log \left(1 + x\right)\]

    2. Taylor expanded around 0 0.3

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

    if 1.0000000183640019 < (+ 1.0 x)

    1. Initial program 0.2

      \[\log \left(1 + x\right)\]
  3. Recombined 2 regimes into one program.

  4. Final simplification0.3

    \[\leadsto \begin{array}{l} \mathbf{if}\;1 + x \le 1.0000000183640019:\\ \;\;\;\;\left(1 \cdot x + \log 1\right) - \frac{1}{2} \cdot \frac{{x}^{2}}{{1}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\log \left(1 + x\right)\\ \end{array}\]

Reproduce

herbie shell --seed 2020091 
(FPCore (x)
  :name "ln(1 + x)"
  :precision binary64

  :herbie-target
  (if (== (+ 1 x) 1) x (/ (* x (log (+ 1 x))) (- (+ 1 x) 1)))

  (log (+ 1 x)))