Average Error: 38.8 → 0.0
Time: 8.0s
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 r436423 = x;
        double r436424 = 1.0;
        double r436425 = r436423 + r436424;
        double r436426 = r436425 * r436425;
        double r436427 = r436426 - r436424;
        return r436427;
}
↓
double f(double x) {
        double r436428 = x;
        double r436429 = 2.0;
        double r436430 = r436428 + r436429;
        double r436431 = r436430 * r436428;
        return r436431;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 38.8

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