Average Error: 38.9 → 0.1
Time: 7.3s
Precision: 64
Internal Precision: 128
\[\log \left(1 + x\right)\]
↓
\[\begin{array}{l} \mathbf{if}\;x \le 0.00012756475162532222:\\ \;\;\;\;x + \left(x \cdot x\right) \cdot \left(\frac{1}{3} \cdot x - \frac{1}{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(x + 1\right)\\ \end{array}\]

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original38.9
Target0.2
Herbie0.1
\[\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 x < 0.00012756475162532222

    1. Initial program 59.0

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

    2. Initial simplification59.0

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

    3. Taylor expanded around 0 0.2

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

    4. Simplified0.2

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

    if 0.00012756475162532222 < x

    1. Initial program 0.1

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

    2. Initial simplification0.1

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

  4. Final simplification0.1

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

Runtime

Time bar (total: 7.3s)Debug logProfile

BaselineHerbieOracleSpan%
Regimes20.90.10.020.899.6%
herbie shell --seed 2018354 
(FPCore (x)
  :name "ln(1 + x)"

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

  (log (+ 1 x)))