Average Error: 39.4 → 0.0
Time: 13.1s
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 r344387 = x;
        double r344388 = 1.0;
        double r344389 = r344387 + r344388;
        double r344390 = r344389 * r344389;
        double r344391 = r344390 - r344388;
        return r344391;
}
↓
double f(double x) {
        double r344392 = x;
        double r344393 = 2.0;
        double r344394 = r344393 + r344392;
        double r344395 = r344392 * r344394;
        return r344395;
}

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

  3. Final simplification0.0

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

Reproduce

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