Average Error: 0.0 → 0.0
Time: 15.5s
Precision: 64
\[0.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 r73475 = x;
        double r73476 = r73475 * r73475;
        double r73477 = r73475 * r73476;
        double r73478 = r73477 + r73476;
        return r73478;
}
↓
double f(double x) {
        double r73479 = x;
        double r73480 = r73479 * r73479;
        double r73481 = r73480 + r73479;
        double r73482 = r73479 * r73481;
        return r73482;
}

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 + 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 2019347 
(FPCore (x)
  :name "Expression 3, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

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

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