Average Error: 38.8 → 0.5
Time: 8.7s
Precision: 64
\[\log \left(1 + x\right)\]
↓
\[\begin{array}{l} \mathbf{if}\;1 + x \le 1.00000000000000333:\\ \;\;\;\;\mathsf{fma}\left(\frac{{x}^{2}}{{1}^{2}}, \frac{-1}{2}, \mathsf{fma}\left(1, x, \log 1\right)\right)\\ \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:\\
\;\;\;\;\mathsf{fma}\left(\frac{{x}^{2}}{{1}^{2}}, \frac{-1}{2}, \mathsf{fma}\left(1, x, \log 1\right)\right)\\

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

\end{array}
double f(double x) {
        double r79138 = 1.0;
        double r79139 = x;
        double r79140 = r79138 + r79139;
        double r79141 = log(r79140);
        return r79141;
}
↓
double f(double x) {
        double r79142 = 1.0;
        double r79143 = x;
        double r79144 = r79142 + r79143;
        double r79145 = 1.0000000000000033;
        bool r79146 = r79144 <= r79145;
        double r79147 = 2.0;
        double r79148 = pow(r79143, r79147);
        double r79149 = pow(r79142, r79147);
        double r79150 = r79148 / r79149;
        double r79151 = -0.5;
        double r79152 = log(r79142);
        double r79153 = fma(r79142, r79143, r79152);
        double r79154 = fma(r79150, r79151, r79153);
        double r79155 = sqrt(r79144);
        double r79156 = log(r79155);
        double r79157 = r79156 + r79156;
        double r79158 = r79146 ? r79154 : r79157;
        return r79158;
}

Error

Bits error versus x

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}}}\]

    3. Simplified0.3

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{{x}^{2}}{{1}^{2}}, \frac{-1}{2}, \mathsf{fma}\left(1, x, \log 1\right)\right)}\]

    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:\\ \;\;\;\;\mathsf{fma}\left(\frac{{x}^{2}}{{1}^{2}}, \frac{-1}{2}, \mathsf{fma}\left(1, x, \log 1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(\sqrt{1 + x}\right) + \log \left(\sqrt{1 + x}\right)\\ \end{array}\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(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)))