Average Error: 0.0 → 0.0
Time: 9.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\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 r76702 = x;
        double r76703 = r76702 * r76702;
        double r76704 = r76702 * r76703;
        double r76705 = r76704 + r76703;
        return r76705;
}
↓
double f(double x) {
        double r76706 = x;
        double r76707 = r76706 * r76706;
        double r76708 = r76706 * r76707;
        double r76709 = r76708 + r76707;
        return r76709;
}

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 2020043 
(FPCore (x)
  :name "Expression 3, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

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

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