Average Error: 0.0 → 0.0
Time: 7.6s
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 r82101 = x;
        double r82102 = r82101 * r82101;
        double r82103 = r82101 * r82102;
        double r82104 = r82103 + r82102;
        return r82104;
}
↓
double f(double x) {
        double r82105 = x;
        double r82106 = 3.0;
        double r82107 = pow(r82105, r82106);
        double r82108 = r82105 * r82105;
        double r82109 = r82107 + r82108;
        return r82109;
}

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)))