Average Error: 39.1 → 0.0
Time: 5.4s
Precision: 64
\[\log \left(1 + x\right)\]
↓
\[\mathsf{log1p}\left(x\right)\]
\log \left(1 + x\right)
↓
\mathsf{log1p}\left(x\right)
double f(double x) {
        double r1661367 = 1.0;
        double r1661368 = x;
        double r1661369 = r1661367 + r1661368;
        double r1661370 = log(r1661369);
        return r1661370;
}
↓
double f(double x) {
        double r1661371 = x;
        double r1661372 = log1p(r1661371);
        return r1661372;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original39.1
Target0.2
Herbie0.0
\[\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. Initial program 39.1

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

  2. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{log1p}\left(x\right)}\]

  3. Final simplification0.0

    \[\leadsto \mathsf{log1p}\left(x\right)\]

Reproduce

herbie shell --seed 2019132 +o rules:numerics
(FPCore (x)
  :name "ln(1 + x)"

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

  (log (+ 1 x)))