Average Error: 38.4 → 0.0
Time: 5.7s
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 r399519 = x;
        double r399520 = 1.0;
        double r399521 = r399519 + r399520;
        double r399522 = r399521 * r399521;
        double r399523 = r399522 - r399520;
        return r399523;
}
↓
double f(double x) {
        double r399524 = x;
        double r399525 = 2.0;
        double r399526 = r399524 + r399525;
        double r399527 = r399526 * r399524;
        return r399527;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 38.4

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