Average Error: 59.7 → 29.6
Time: 1.4s
Precision: binary64
\[\left(\left(x + 1\right) \cdot \left(x + 1\right) - x \cdot \left(x + 1\right)\right) - 1\]
↓
\[1 \cdot \left(x + 1\right) - 1\]
\left(\left(x + 1\right) \cdot \left(x + 1\right) - x \cdot \left(x + 1\right)\right) - 1
↓
1 \cdot \left(x + 1\right) - 1
double code(double x) {
	return ((double) (((double) (((double) (((double) (x + 1.0)) * ((double) (x + 1.0)))) - ((double) (x * ((double) (x + 1.0)))))) - 1.0));
}
↓
double code(double x) {
	return ((double) (((double) (1.0 * ((double) (x + 1.0)))) - 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 59.7

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

  2. Simplified29.6

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

  3. Final simplification29.6

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

Reproduce

herbie shell --seed 2020152 
(FPCore (x)
  :name "(- (- (* (+ x 1) (+ x 1)) (* x (+ x 1))) 1)"
  :precision binary64
  (- (- (* (+ x 1.0) (+ x 1.0)) (* x (+ x 1.0))) 1.0))