Average Error: 0.0 → 0.0
Time: 16.2s
Precision: 64
\[0.0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[\left(x \cdot x\right) \cdot x + x \cdot x\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
\left(x \cdot x\right) \cdot x + x \cdot x
double f(double x) {
        double r5527172 = x;
        double r5527173 = r5527172 * r5527172;
        double r5527174 = r5527172 * r5527173;
        double r5527175 = r5527174 + r5527173;
        return r5527175;
}
↓
double f(double x) {
        double r5527176 = x;
        double r5527177 = r5527176 * r5527176;
        double r5527178 = r5527177 * r5527176;
        double r5527179 = r5527178 + r5527177;
        return r5527179;
}

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

Reproduce

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

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

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