Average Error: 15.1 → 0.4
Time: 15.9s
Precision: 64
\[\tan^{-1} \left(N + 1\right) - \tan^{-1} N\]
↓
\[\tan^{-1}_* \frac{1}{1 + \left(N + 1\right) \cdot N}\]
\tan^{-1} \left(N + 1\right) - \tan^{-1} N
↓
\tan^{-1}_* \frac{1}{1 + \left(N + 1\right) \cdot N}
double f(double N) {
        double r58979 = N;
        double r58980 = 1.0;
        double r58981 = r58979 + r58980;
        double r58982 = atan(r58981);
        double r58983 = atan(r58979);
        double r58984 = r58982 - r58983;
        return r58984;
}
↓
double f(double N) {
        double r58985 = 1.0;
        double r58986 = 1.0;
        double r58987 = N;
        double r58988 = r58987 + r58985;
        double r58989 = r58988 * r58987;
        double r58990 = r58986 + r58989;
        double r58991 = atan2(r58985, r58990);
        return r58991;
}

Error

Bits error versus N

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

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

Derivation

  1. Initial program 15.1

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

  3. Applied diff-atan14.1

    \[\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. Final simplification0.4

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

Reproduce

herbie shell --seed 2019323 
(FPCore (N)
  :name "2atan (example 3.5)"
  :precision binary64

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

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