Average Error: 0.0 → 0.0
Time: 2.7s
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 r4539736 = x;
        double r4539737 = r4539736 * r4539736;
        double r4539738 = r4539736 * r4539737;
        double r4539739 = r4539738 + r4539737;
        return r4539739;
}
↓
double f(double x) {
        double r4539740 = x;
        double r4539741 = r4539740 * r4539740;
        double r4539742 = r4539740 * r4539741;
        double r4539743 = r4539741 + r4539742;
        return r4539743;
}

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

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

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