Average Error: 30.0 → 0
Time: 885.0ms
Precision: 64
\[\left(1 + x\right) - x\]
↓
\[1\]
\left(1 + x\right) - x
↓
1
double f(double x) {
        double r64 = 1.0;
        double r65 = x;
        double r66 = r64 + r65;
        double r67 = r66 - r65;
        return r67;
}
↓
double f(double __attribute__((unused)) x) {
        double r68 = 1.0;
        return r68;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 30.0

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

  2. Simplified0

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

  3. Final simplification0

    \[\leadsto 1\]

Reproduce

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