Average Error: 0.0 → 0.0
Time: 25.4s
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 r16966256 = x;
        double r16966257 = r16966256 * r16966256;
        double r16966258 = r16966256 * r16966257;
        double r16966259 = r16966258 + r16966257;
        return r16966259;
}
↓
double f(double x) {
        double r16966260 = x;
        double r16966261 = r16966260 * r16966260;
        double r16966262 = r16966260 * r16966261;
        double r16966263 = r16966261 + r16966262;
        return r16966263;
}

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

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

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