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

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

  2. Final simplification39.0

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

Reproduce

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