Average Error: 14.5 → 0.1
Time: 2.7s
Precision: 64
\[\frac{1}{x + 1} - \frac{1}{x}\]
↓
\[\frac{\frac{1}{\frac{x + 1}{0 - 1}}}{x}\]
\frac{1}{x + 1} - \frac{1}{x}
↓
\frac{\frac{1}{\frac{x + 1}{0 - 1}}}{x}
double f(double x) {
        double r24407 = 1.0;
        double r24408 = x;
        double r24409 = r24408 + r24407;
        double r24410 = r24407 / r24409;
        double r24411 = r24407 / r24408;
        double r24412 = r24410 - r24411;
        return r24412;
}
↓
double f(double x) {
        double r24413 = 1.0;
        double r24414 = x;
        double r24415 = r24414 + r24413;
        double r24416 = 0.0;
        double r24417 = r24416 - r24413;
        double r24418 = r24415 / r24417;
        double r24419 = r24413 / r24418;
        double r24420 = r24419 / r24414;
        return r24420;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 14.5

    \[\frac{1}{x + 1} - \frac{1}{x}\]
  2. Using strategy rm

  3. Applied frac-sub13.7

    \[\leadsto \color{blue}{\frac{1 \cdot x - \left(x + 1\right) \cdot 1}{\left(x + 1\right) \cdot x}}\]

  4. Simplified13.7

    \[\leadsto \frac{\color{blue}{1 \cdot \left(x - \left(x + 1\right)\right)}}{\left(x + 1\right) \cdot x}\]
  5. Using strategy rm

  6. Applied associate-/r*13.7

    \[\leadsto \color{blue}{\frac{\frac{1 \cdot \left(x - \left(x + 1\right)\right)}{x + 1}}{x}}\]

  7. Simplified0.1

    \[\leadsto \frac{\color{blue}{\frac{1}{\frac{x + 1}{0 - 1}}}}{x}\]

  8. Final simplification0.1

    \[\leadsto \frac{\frac{1}{\frac{x + 1}{0 - 1}}}{x}\]

Reproduce

herbie shell --seed 2019362 +o rules:numerics
(FPCore (x)
  :name "2frac (problem 3.3.1)"
  :precision binary64
  (- (/ 1 (+ x 1)) (/ 1 x)))