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

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

\end{array}
double f(double x) {
        double r56330 = 1.0;
        double r56331 = x;
        double r56332 = r56330 + r56331;
        double r56333 = log(r56332);
        return r56333;
}
↓
double f(double x) {
        double r56334 = 1.0;
        double r56335 = x;
        double r56336 = r56334 + r56335;
        double r56337 = 1.0000000000000033;
        bool r56338 = r56336 <= r56337;
        double r56339 = r56334 * r56335;
        double r56340 = log(r56334);
        double r56341 = r56339 + r56340;
        double r56342 = 0.5;
        double r56343 = 2.0;
        double r56344 = pow(r56335, r56343);
        double r56345 = pow(r56334, r56343);
        double r56346 = r56344 / r56345;
        double r56347 = r56342 * r56346;
        double r56348 = r56341 - r56347;
        double r56349 = sqrt(r56336);
        double r56350 = log(r56349);
        double r56351 = r56350 + r56350;
        double r56352 = r56338 ? r56348 : r56351;
        return r56352;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original38.8
Target0.2
Herbie0.5
\[\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.0000000000000033

    1. Initial program 59.6

      \[\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.0000000000000033 < (+ 1.0 x)

    1. Initial program 0.9

      \[\log \left(1 + x\right)\]
    2. Using strategy rm

    3. Applied add-sqr-sqrt1.0

      \[\leadsto \log \color{blue}{\left(\sqrt{1 + x} \cdot \sqrt{1 + x}\right)}\]

    4. Applied log-prod1.0

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

  4. Final simplification0.5

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

Reproduce

herbie shell --seed 2020047 
(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)))