Average Error: 0.0 → 0.0
Time: 6.6s
Precision: 64
\[0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[\left(1 + x\right) \cdot \left(x \cdot x\right)\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
\left(1 + x\right) \cdot \left(x \cdot x\right)
double f(double x) {
        double r1515374 = x;
        double r1515375 = r1515374 * r1515374;
        double r1515376 = r1515374 * r1515375;
        double r1515377 = r1515376 + r1515375;
        return r1515377;
}
↓
double f(double x) {
        double r1515378 = 1.0;
        double r1515379 = x;
        double r1515380 = r1515378 + r1515379;
        double r1515381 = r1515379 * r1515379;
        double r1515382 = r1515380 * r1515381;
        return r1515382;
}

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. Using strategy rm

  3. Applied distribute-lft1-in0.0

    \[\leadsto \color{blue}{\left(x + 1\right) \cdot \left(x \cdot x\right)}\]

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019151 
(FPCore (x)
  :name "Expression 3, p15"
  :pre (<= 0 x 2)

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

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