Average Error: 0.0 → 0.0
Time: 1.0m
Precision: 64
\[0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[x \cdot \left(x \cdot x + x\right)\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
x \cdot \left(x \cdot x + x\right)
double f(double x) {
        double r16740685 = x;
        double r16740686 = r16740685 * r16740685;
        double r16740687 = r16740685 * r16740686;
        double r16740688 = r16740687 + r16740686;
        return r16740688;
}
↓
double f(double x) {
        double r16740689 = x;
        double r16740690 = r16740689 * r16740689;
        double r16740691 = r16740690 + r16740689;
        double r16740692 = r16740689 * r16740691;
        return r16740692;
}

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-lft-out0.0

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

  4. Final simplification0.0

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

Reproduce

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

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

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