Average Error: 29.4 → 0
Time: 1.2s
Precision: binary64
\[\left(1 + x\right) - x\]
↓
\[1\]
\left(1 + x\right) - x
↓
1
(FPCore (x) :precision binary64 (- (+ 1.0 x) x))
↓
(FPCore (x) :precision binary64 1.0)
double code(double x) {
	return ((double) (((double) (1.0 + x)) - x));
}
↓
double code(double x) {
	return 1.0;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program Error: 29.4 bits

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

  2. SimplifiedError: 0 bits

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

  3. Final simplificationError: 0 bits

    \[\leadsto 1\]

Reproduce

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