Average Error: 39.2 → 0.0
Time: 33.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 r860149 = x;
        double r860150 = 1.0;
        double r860151 = r860149 + r860150;
        double r860152 = r860151 * r860151;
        double r860153 = r860152 - r860150;
        return r860153;
}
↓
double f(double x) {
        double r860154 = x;
        double r860155 = 2.0;
        double r860156 = r860155 + r860154;
        double r860157 = r860154 * r860156;
        return r860157;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.2

    \[\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 2019144 
(FPCore (x)
  :name "Expanding a square"
  (- (* (+ x 1) (+ x 1)) 1))