Average Error: 39.0 → 0.0
Time: 12.8s
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 r344344 = x;
        double r344345 = 1.0;
        double r344346 = r344344 + r344345;
        double r344347 = r344346 * r344346;
        double r344348 = r344347 - r344345;
        return r344348;
}
↓
double f(double x) {
        double r344349 = x;
        double r344350 = 2.0;
        double r344351 = r344350 + r344349;
        double r344352 = r344349 * r344351;
        return r344352;
}

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019151 +o rules:numerics
(FPCore (x)
  :name "Expanding a square"
  (- (* (+ x 1) (+ x 1)) 1))