Average Error: 0.0 → 0.0
Time: 13.2s
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 r5819399 = x;
        double r5819400 = r5819399 * r5819399;
        double r5819401 = r5819399 * r5819400;
        double r5819402 = r5819401 + r5819400;
        return r5819402;
}
↓
double f(double x) {
        double r5819403 = x;
        double r5819404 = r5819403 * r5819403;
        double r5819405 = r5819404 + r5819403;
        double r5819406 = r5819403 * r5819405;
        return r5819406;
}

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. Using strategy rm

  3. Applied distribute-lft-out0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019170 
(FPCore (x)
  :name "Expression 3, p15"
  :pre (<= 0.0 x 2.0)

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

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