Average Error: 39.4 → 0.0
Time: 8.2s
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 r698796 = x;
        double r698797 = 1.0;
        double r698798 = r698796 + r698797;
        double r698799 = r698798 * r698798;
        double r698800 = r698799 - r698797;
        return r698800;
}
↓
double f(double x) {
        double r698801 = x;
        double r698802 = 2.0;
        double r698803 = r698802 + r698801;
        double r698804 = r698801 * r698803;
        return r698804;
}

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))