Average Error: 38.8 → 0.0
Time: 52.9s
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 r9483477 = x;
        double r9483478 = 1.0;
        double r9483479 = r9483477 + r9483478;
        double r9483480 = r9483479 * r9483479;
        double r9483481 = r9483480 - r9483478;
        return r9483481;
}
↓
double f(double x) {
        double r9483482 = x;
        double r9483483 = 2.0;
        double r9483484 = r9483482 + r9483483;
        double r9483485 = r9483484 * r9483482;
        return r9483485;
}

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