Average Error: 0.0 → 0.0
Time: 15.5s
Precision: 64
\[0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[x \cdot \left(x \cdot x + x\right)\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
x \cdot \left(x \cdot x + x\right)
double f(double x) {
        double r4552696 = x;
        double r4552697 = r4552696 * r4552696;
        double r4552698 = r4552696 * r4552697;
        double r4552699 = r4552698 + r4552697;
        return r4552699;
}
↓
double f(double x) {
        double r4552700 = x;
        double r4552701 = r4552700 * r4552700;
        double r4552702 = r4552701 + r4552700;
        double r4552703 = r4552700 * r4552702;
        return r4552703;
}

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.0 + x\right) \cdot x\right) \cdot x\]

Derivation

  1. Initial program 0.0

    \[x \cdot \left(x \cdot x\right) + x \cdot x\]
  2. Using strategy rm

  3. Applied distribute-lft-out0.0

    \[\leadsto \color{blue}{x \cdot \left(x \cdot x + x\right)}\]

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019144 
(FPCore (x)
  :name "Expression 3, p15"
  :pre (<= 0 x 2)

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

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