Average Error: 38.8 → 0.0
Time: 15.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 r308277 = x;
        double r308278 = 1.0;
        double r308279 = r308277 + r308278;
        double r308280 = r308279 * r308279;
        double r308281 = r308280 - r308278;
        return r308281;
}
↓
double f(double x) {
        double r308282 = x;
        double r308283 = 2.0;
        double r308284 = r308283 + r308282;
        double r308285 = r308282 * r308284;
        return r308285;
}

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(x + 2\right) \cdot x}\]

  3. Final simplification0.0

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

Reproduce

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