Average Error: 39.4 → 0.0
Time: 6.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 r580732 = x;
        double r580733 = 1.0;
        double r580734 = r580732 + r580733;
        double r580735 = r580734 * r580734;
        double r580736 = r580735 - r580733;
        return r580736;
}
↓
double f(double x) {
        double r580737 = x;
        double r580738 = 2.0;
        double r580739 = r580738 + r580737;
        double r580740 = r580737 * r580739;
        return r580740;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.4

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