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

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

  2. Final simplification39.3

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

Reproduce

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