Average Error: 38.8 → 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 r163480 = x;
        double r163481 = 1.0;
        double r163482 = r163480 + r163481;
        double r163483 = r163482 * r163482;
        double r163484 = r163483 - r163481;
        return r163484;
}
↓
double f(double x) {
        double r163485 = x;
        double r163486 = 2.0;
        double r163487 = r163486 + r163485;
        double r163488 = r163485 * r163487;
        return r163488;
}

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

  3. Final simplification0.0

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

Reproduce

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