Average Error: 39.0 → 0.0
Time: 14.8s
Precision: 64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[\left(x + 2\right) \cdot x\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
\left(x + 2\right) \cdot x
double f(double x) {
        double r901032 = x;
        double r901033 = 1.0;
        double r901034 = r901032 + r901033;
        double r901035 = r901034 * r901034;
        double r901036 = r901035 - r901033;
        return r901036;
}
↓
double f(double x) {
        double r901037 = x;
        double r901038 = 2.0;
        double r901039 = r901037 + r901038;
        double r901040 = r901039 * r901037;
        return r901040;
}

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

  3. Final simplification0.0

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

Reproduce

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