Average Error: 39.0 → 0.0
Time: 6.2s
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 r591323 = x;
        double r591324 = 1.0;
        double r591325 = r591323 + r591324;
        double r591326 = r591325 * r591325;
        double r591327 = r591326 - r591324;
        return r591327;
}
↓
double f(double x) {
        double r591328 = x;
        double r591329 = 2.0;
        double r591330 = r591329 + r591328;
        double r591331 = r591328 * r591330;
        return r591331;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.0

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

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

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