Average Error: 0.0 → 0.0
Time: 7.3s
Precision: 64
\[0.0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[x \cdot x + x \cdot \left(x \cdot x\right)\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
x \cdot x + x \cdot \left(x \cdot x\right)
double f(double x) {
        double r5885736 = x;
        double r5885737 = r5885736 * r5885736;
        double r5885738 = r5885736 * r5885737;
        double r5885739 = r5885738 + r5885737;
        return r5885739;
}
↓
double f(double x) {
        double r5885740 = x;
        double r5885741 = r5885740 * r5885740;
        double r5885742 = r5885740 * r5885741;
        double r5885743 = r5885741 + r5885742;
        return r5885743;
}

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 x + x \cdot \left(x \cdot x\right)\]

Reproduce

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

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

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