Average Error: 0.0 → 0.0
Time: 4.6s
Precision: 64
\[0.0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
x \cdot \left(x \cdot x\right) + x \cdot x
double f(double x) {
        double r51715 = x;
        double r51716 = r51715 * r51715;
        double r51717 = r51715 * r51716;
        double r51718 = r51717 + r51716;
        return r51718;
}
↓
double f(double x) {
        double r51719 = x;
        double r51720 = r51719 * r51719;
        double r51721 = r51719 * r51720;
        double r51722 = r51721 + r51720;
        return r51722;
}

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

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

Reproduce

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

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

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