Average Error: 38.7 → 0.0
Time: 2.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 r56225 = x;
        double r56226 = 1.0;
        double r56227 = r56225 + r56226;
        double r56228 = r56227 * r56227;
        double r56229 = r56228 - r56226;
        return r56229;
}
↓
double f(double x) {
        double r56230 = x;
        double r56231 = 2.0;
        double r56232 = r56231 + r56230;
        double r56233 = r56230 * r56232;
        return r56233;
}

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