Average Error: 39.5 → 0.0
Time: 1.6s
Precision: 64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[x \cdot 2 + {x}^{2}\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
x \cdot 2 + {x}^{2}
double f(double x) {
        double r2688 = x;
        double r2689 = 1.0;
        double r2690 = r2688 + r2689;
        double r2691 = r2690 * r2690;
        double r2692 = r2691 - r2689;
        return r2692;
}
↓
double f(double x) {
        double r2693 = x;
        double r2694 = 2.0;
        double r2695 = r2693 * r2694;
        double r2696 = 2.0;
        double r2697 = pow(r2693, r2696);
        double r2698 = r2695 + r2697;
        return r2698;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.5

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

  2. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{{x}^{2} + 2 \cdot x}\]

  3. Simplified0.0

    \[\leadsto \color{blue}{x \cdot \left(2 + x\right)}\]
  4. Using strategy rm

  5. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{x \cdot 2 + x \cdot x}\]

  6. Simplified0.0

    \[\leadsto x \cdot 2 + \color{blue}{{x}^{2}}\]

  7. Final simplification0.0

    \[\leadsto x \cdot 2 + {x}^{2}\]

Reproduce

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