Average Error: 39.4 → 0.0
Time: 16.4s
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 r485104 = x;
        double r485105 = 1.0;
        double r485106 = r485104 + r485105;
        double r485107 = r485106 * r485106;
        double r485108 = r485107 - r485105;
        return r485108;
}
↓
double f(double x) {
        double r485109 = x;
        double r485110 = 2.0;
        double r485111 = r485110 + r485109;
        double r485112 = r485109 * r485111;
        return r485112;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.4

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