Average Error: 0.0 → 0.0
Time: 7.3s
Precision: 64
\[0.0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[x \cdot \left(x \cdot x + x\right)\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
x \cdot \left(x \cdot x + x\right)
double f(double x) {
        double r69268 = x;
        double r69269 = r69268 * r69268;
        double r69270 = r69268 * r69269;
        double r69271 = r69270 + r69269;
        return r69271;
}
↓
double f(double x) {
        double r69272 = x;
        double r69273 = r69272 * r69272;
        double r69274 = r69273 + r69272;
        double r69275 = r69272 * r69274;
        return r69275;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(\left(1 + x\right) \cdot x\right) \cdot x\]

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

    \[\leadsto \color{blue}{{x}^{3} + x \cdot x}\]
  3. Using strategy rm

  4. Applied cube-mult0.0

    \[\leadsto \color{blue}{x \cdot \left(x \cdot x\right)} + x \cdot x\]

  5. Applied distribute-lft-out0.0

    \[\leadsto \color{blue}{x \cdot \left(x \cdot x + x\right)}\]

  6. Final simplification0.0

    \[\leadsto x \cdot \left(x \cdot x + x\right)\]

Reproduce

herbie shell --seed 2019304 
(FPCore (x)
  :name "Expression 3, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

  :herbie-target
  (* (* (+ 1 x) x) x)

  (+ (* x (* x x)) (* x x)))