Average Error: 39.2 → 0.0
Time: 2.1s
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 r10910 = x;
        double r10911 = 1.0;
        double r10912 = r10910 + r10911;
        double r10913 = r10912 * r10912;
        double r10914 = r10913 - r10911;
        return r10914;
}
↓
double f(double x) {
        double r10915 = x;
        double r10916 = 2.0;
        double r10917 = r10915 * r10916;
        double r10918 = 2.0;
        double r10919 = pow(r10915, r10918);
        double r10920 = r10917 + r10919;
        return r10920;
}

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. 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 2019318 
(FPCore (x)
  :name "Expanding a square"
  :precision binary64
  (- (* (+ x 1) (+ x 1)) 1))