Average Error: 39.2 → 0.0
Time: 9.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 r675898 = x;
        double r675899 = 1.0;
        double r675900 = r675898 + r675899;
        double r675901 = r675900 * r675900;
        double r675902 = r675901 - r675899;
        return r675902;
}
↓
double f(double x) {
        double r675903 = x;
        double r675904 = 2.0;
        double r675905 = r675903 + r675904;
        double r675906 = r675905 * r675903;
        return r675906;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.2

    \[\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 2019125 
(FPCore (x)
  :name "Expanding a square"
  (- (* (+ x 1) (+ x 1)) 1))