Average Error: 14.9 → 0.4
Time: 11.2s
Precision: 64
\[\tan^{-1} \left(N + 1\right) - \tan^{-1} N\]
↓
\[\tan^{-1}_* \frac{1}{1 + \mathsf{fma}\left(N, N, N\right)}\]
\tan^{-1} \left(N + 1\right) - \tan^{-1} N
↓
\tan^{-1}_* \frac{1}{1 + \mathsf{fma}\left(N, N, N\right)}
double f(double N) {
        double r2993611 = N;
        double r2993612 = 1.0;
        double r2993613 = r2993611 + r2993612;
        double r2993614 = atan(r2993613);
        double r2993615 = atan(r2993611);
        double r2993616 = r2993614 - r2993615;
        return r2993616;
}
↓
double f(double N) {
        double r2993617 = 1.0;
        double r2993618 = N;
        double r2993619 = fma(r2993618, r2993618, r2993618);
        double r2993620 = r2993617 + r2993619;
        double r2993621 = atan2(r2993617, r2993620);
        return r2993621;
}

Error

Bits error versus N

Target

Original14.9
Target0.4
Herbie0.4
\[\tan^{-1} \left(\frac{1}{1 + N \cdot \left(N + 1\right)}\right)\]

Derivation

  1. Initial program 14.9

    \[\tan^{-1} \left(N + 1\right) - \tan^{-1} N\]
  2. Using strategy rm

  3. Applied diff-atan13.7

    \[\leadsto \color{blue}{\tan^{-1}_* \frac{\left(N + 1\right) - N}{1 + \left(N + 1\right) \cdot N}}\]

  4. Simplified0.4

    \[\leadsto \tan^{-1}_* \frac{\color{blue}{1}}{1 + \left(N + 1\right) \cdot N}\]

  5. Simplified0.4

    \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N, 1 + N, 1\right)}}\]
  6. Using strategy rm

  7. Applied fma-udef0.4

    \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot \left(1 + N\right) + 1}}\]

  8. Simplified0.4

    \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N, N, N\right)} + 1}\]

  9. Final simplification0.4

    \[\leadsto \tan^{-1}_* \frac{1}{1 + \mathsf{fma}\left(N, N, N\right)}\]

Reproduce

herbie shell --seed 2019163 +o rules:numerics
(FPCore (N)
  :name "2atan (example 3.5)"

  :herbie-target
  (atan (/ 1 (+ 1 (* N (+ N 1)))))

  (- (atan (+ N 1)) (atan N)))