Average Error: 38.8 → 0.0
Time: 4.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 r187641 = x;
        double r187642 = 1.0;
        double r187643 = r187641 + r187642;
        double r187644 = r187643 * r187643;
        double r187645 = r187644 - r187642;
        return r187645;
}
↓
double f(double x) {
        double r187646 = x;
        double r187647 = 2.0;
        double r187648 = r187647 + r187646;
        double r187649 = r187646 * r187648;
        return r187649;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 38.8

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