Average Error: 0.0 → 0.0
Time: 516.0ms
Precision: 64
\[0.0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[\mathsf{fma}\left(x, x, {x}^{3}\right)\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
\mathsf{fma}\left(x, x, {x}^{3}\right)
double f(double x) {
        double r84504 = x;
        double r84505 = r84504 * r84504;
        double r84506 = r84504 * r84505;
        double r84507 = r84506 + r84505;
        return r84507;
}
↓
double f(double x) {
        double r84508 = x;
        double r84509 = 3.0;
        double r84510 = pow(r84508, r84509);
        double r84511 = fma(r84508, r84508, r84510);
        return r84511;
}

Error

Bits error versus x

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. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, {x}^{3}\right)}\]

  3. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(x, x, {x}^{3}\right)\]

Reproduce

herbie shell --seed 2019354 +o rules:numerics
(FPCore (x)
  :name "Expression 3, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

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

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