Average Error: 0.0 → 0.0
Time: 13.7s
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 r3908513 = x;
        double r3908514 = r3908513 * r3908513;
        double r3908515 = r3908513 * r3908514;
        double r3908516 = r3908515 + r3908514;
        return r3908516;
}
↓
double f(double x) {
        double r3908517 = x;
        double r3908518 = r3908517 * r3908517;
        double r3908519 = r3908517 * r3908518;
        double r3908520 = r3908518 + r3908519;
        return r3908520;
}

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 2019138 
(FPCore (x)
  :name "Expression 3, p15"
  :pre (<= 0 x 2)

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

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