Average Error: 40.1 → 0.0
Time: 21.9s
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 r620083 = x;
        double r620084 = 1.0;
        double r620085 = r620083 + r620084;
        double r620086 = r620085 * r620085;
        double r620087 = r620086 - r620084;
        return r620087;
}
↓
double f(double x) {
        double r620088 = x;
        double r620089 = 2.0;
        double r620090 = r620089 + r620088;
        double r620091 = r620088 * r620090;
        return r620091;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 40.1

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

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

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