Average Error: 38.7 → 0.0
Time: 2.7s
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 r49453 = x;
        double r49454 = 1.0;
        double r49455 = r49453 + r49454;
        double r49456 = r49455 * r49455;
        double r49457 = r49456 - r49454;
        return r49457;
}
↓
double f(double x) {
        double r49458 = x;
        double r49459 = 2.0;
        double r49460 = r49459 + r49458;
        double r49461 = r49458 * r49460;
        return r49461;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 38.7

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