Average Error: 29.6 → 0
Time: 599.0ms
Precision: 64
\[\left(1 + x\right) - x\]
↓
\[1\]
\left(1 + x\right) - x
↓
1
double f(double x) {
        double r8351 = 1.0;
        double r8352 = x;
        double r8353 = r8351 + r8352;
        double r8354 = r8353 - r8352;
        return r8354;
}
↓
double f(double __attribute__((unused)) x) {
        double r8355 = 1.0;
        return r8355;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 29.6

    \[\left(1 + x\right) - x\]

  2. Simplified0

    \[\leadsto \color{blue}{1}\]

  3. Final simplification0

    \[\leadsto 1\]

Reproduce

herbie shell --seed 2019316 
(FPCore (x)
  :name "Cancel like terms"
  :precision binary64
  (- (+ 1 x) x))