Average Error: 39.1 → 0.0
Time: 4.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 r187306 = x;
        double r187307 = 1.0;
        double r187308 = r187306 + r187307;
        double r187309 = r187308 * r187308;
        double r187310 = r187309 - r187307;
        return r187310;
}
↓
double f(double x) {
        double r187311 = x;
        double r187312 = 2.0;
        double r187313 = r187312 + r187311;
        double r187314 = r187311 * r187313;
        return r187314;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.1

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