Average Error: 0.0 → 0.0
Time: 3.6s
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 r77176 = x;
        double r77177 = r77176 * r77176;
        double r77178 = r77176 * r77177;
        double r77179 = r77178 + r77177;
        return r77179;
}
↓
double f(double x) {
        double r77180 = x;
        double r77181 = r77180 * r77180;
        double r77182 = r77180 * r77181;
        double r77183 = r77182 + r77181;
        return r77183;
}

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 2020047 +o rules:numerics
(FPCore (x)
  :name "Expression 3, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

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

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