Average Error: 39.0 → 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 r542723 = x;
        double r542724 = 1.0;
        double r542725 = r542723 + r542724;
        double r542726 = r542725 * r542725;
        double r542727 = r542726 - r542724;
        return r542727;
}
↓
double f(double x) {
        double r542728 = x;
        double r542729 = 2.0;
        double r542730 = r542729 + r542728;
        double r542731 = r542728 * r542730;
        return r542731;
}

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

  3. Final simplification0.0

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

Reproduce

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