Average Error: 39.4 → 0.0
Time: 7.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 r703999 = x;
        double r704000 = 1.0;
        double r704001 = r703999 + r704000;
        double r704002 = r704001 * r704001;
        double r704003 = r704002 - r704000;
        return r704003;
}
↓
double f(double x) {
        double r704004 = x;
        double r704005 = 2.0;
        double r704006 = r704005 + r704004;
        double r704007 = r704004 * r704006;
        return r704007;
}

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

  3. Final simplification0.0

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

Reproduce

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