Average Error: 38.5 → 0.0
Time: 10.1s
Precision: 64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[\left(x + 2\right) \cdot x\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
\left(x + 2\right) \cdot x
double f(double x) {
        double r633228 = x;
        double r633229 = 1.0;
        double r633230 = r633228 + r633229;
        double r633231 = r633230 * r633230;
        double r633232 = r633231 - r633229;
        return r633232;
}
↓
double f(double x) {
        double r633233 = x;
        double r633234 = 2.0;
        double r633235 = r633233 + r633234;
        double r633236 = r633235 * r633233;
        return r633236;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 38.5

    \[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(2 + x\right) \cdot x}\]

  3. Final simplification0.0

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

Reproduce

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