Average Error: 29.2 → 0
Time: 5.3s
Precision: 64
\[\left(1 + x\right) - x\]
↓
\[1\]
\left(1 + x\right) - x
↓
1
double f(double x) {
        double r192 = 1.0;
        double r193 = x;
        double r194 = r192 + r193;
        double r195 = r194 - r193;
        return r195;
}
↓
double f(double __attribute__((unused)) x) {
        double r196 = 1.0;
        return r196;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 29.2

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

  2. Simplified0

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

  3. Final simplification0

    \[\leadsto 1\]

Reproduce

herbie shell --seed 2020045 +o rules:numerics
(FPCore (x)
  :name "Cancel like terms"
  :precision binary64
  (- (+ 1 x) x))