Average Error: 0.0 → 0.0
Time: 6.9s
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 r76956 = x;
        double r76957 = r76956 * r76956;
        double r76958 = r76956 * r76957;
        double r76959 = r76958 + r76957;
        return r76959;
}
↓
double f(double x) {
        double r76960 = x;
        double r76961 = r76960 * r76960;
        double r76962 = r76960 * r76961;
        double r76963 = r76962 + r76961;
        return r76963;
}

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 2019199 
(FPCore (x)
  :name "Expression 3, p15"
  :pre (<= 0.0 x 2.0)

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

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