Average Error: 39.8 → 0.0
Time: 16.3s
Precision: 64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[x \cdot \left(2 + x\right)\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
x \cdot \left(2 + x\right)
double f(double x) {
        double r484600 = x;
        double r484601 = 1.0;
        double r484602 = r484600 + r484601;
        double r484603 = r484602 * r484602;
        double r484604 = r484603 - r484601;
        return r484604;
}
↓
double f(double x) {
        double r484605 = x;
        double r484606 = 2.0;
        double r484607 = r484606 + r484605;
        double r484608 = r484605 * r484607;
        return r484608;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.8

    \[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(x + 2\right) \cdot x}\]

  3. Final simplification0.0

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

Reproduce

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