Average Error: 39.0 → 0.0
Time: 5.9s
Precision: 64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[x \cdot \left(2 + x\right)\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
x \cdot \left(2 + x\right)
double f(double x) {
        double r534342 = x;
        double r534343 = 1.0;
        double r534344 = r534342 + r534343;
        double r534345 = r534344 * r534344;
        double r534346 = r534345 - r534343;
        return r534346;
}
↓
double f(double x) {
        double r534347 = x;
        double r534348 = 2.0;
        double r534349 = r534348 + r534347;
        double r534350 = r534347 * r534349;
        return r534350;
}

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(x + 1\right) \cdot \left(x + 1\right) - 1\]

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019163 
(FPCore (x)
  :name "Expanding a square"
  (- (* (+ x 1) (+ x 1)) 1))