Average Error: 0.0 → 0.0
Time: 4.2s
Precision: 64
\[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 r26714457 = x;
        double r26714458 = r26714457 * r26714457;
        double r26714459 = r26714457 * r26714458;
        double r26714460 = r26714459 + r26714458;
        return r26714460;
}
↓
double f(double x) {
        double r26714461 = x;
        double r26714462 = r26714461 * r26714461;
        double r26714463 = r26714461 * r26714462;
        double r26714464 = r26714462 + r26714463;
        return r26714464;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2019112 +o rules:numerics
(FPCore (x)
  :name "Expression 3, p15"
  :pre (<= 0 x 2)

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

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