Average Error: 30.3 → 0.0
Time: 914.0ms
Precision: binary64
\[\left(x + 1\right) \cdot \left(x + 1\right) - x \cdot x\]
↓
\[1 \cdot \left(\left(x + 1\right) + x\right)\]
\left(x + 1\right) \cdot \left(x + 1\right) - x \cdot x
↓
1 \cdot \left(\left(x + 1\right) + x\right)
double code(double x) {
	return ((double) (((double) (((double) (x + 1.0)) * ((double) (x + 1.0)))) - ((double) (x * x))));
}
↓
double code(double x) {
	return ((double) (1.0 * ((double) (((double) (x + 1.0)) + x))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 30.3

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

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

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