Average Error: 15.1 → 0.3
Time: 12.4s
Precision: 64
\[\tan^{-1} \left(N + 1\right) - \tan^{-1} N\]
↓
\[\tan^{-1}_* \frac{1}{1 + N \cdot \left(1 + N\right)}\]
\tan^{-1} \left(N + 1\right) - \tan^{-1} N
↓
\tan^{-1}_* \frac{1}{1 + N \cdot \left(1 + N\right)}
double f(double N) {
        double r6059224 = N;
        double r6059225 = 1.0;
        double r6059226 = r6059224 + r6059225;
        double r6059227 = atan(r6059226);
        double r6059228 = atan(r6059224);
        double r6059229 = r6059227 - r6059228;
        return r6059229;
}
↓
double f(double N) {
        double r6059230 = 1.0;
        double r6059231 = 1.0;
        double r6059232 = N;
        double r6059233 = r6059230 + r6059232;
        double r6059234 = r6059232 * r6059233;
        double r6059235 = r6059231 + r6059234;
        double r6059236 = atan2(r6059230, r6059235);
        return r6059236;
}

Error

Bits error versus N

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original15.1
Target0.3
Herbie0.3
\[\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.3

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

  5. Final simplification0.3

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

Reproduce

herbie shell --seed 2019172 
(FPCore (N)
  :name "2atan (example 3.5)"

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

  (- (atan (+ N 1.0)) (atan N)))