Average Error: 0.0 → 0.0
Time: 7.0s
Precision: 64
\[0.0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[{x}^{3} + x \cdot x\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
{x}^{3} + x \cdot x
double f(double x) {
        double r61365 = x;
        double r61366 = r61365 * r61365;
        double r61367 = r61365 * r61366;
        double r61368 = r61367 + r61366;
        return r61368;
}
↓
double f(double x) {
        double r61369 = x;
        double r61370 = 3.0;
        double r61371 = pow(r61369, r61370);
        double r61372 = r61369 * r61369;
        double r61373 = r61371 + r61372;
        return r61373;
}

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. Final simplification0.0

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

Reproduce

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

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

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