Average Error: 0.0 → 0.0
Time: 506.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 r100802 = x;
        double r100803 = r100802 * r100802;
        double r100804 = r100802 * r100803;
        double r100805 = r100804 + r100803;
        return r100805;
}
↓
double f(double x) {
        double r100806 = x;
        double r100807 = 3.0;
        double r100808 = pow(r100806, r100807);
        double r100809 = fma(r100806, r100806, r100808);
        return r100809;
}

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 2020064 +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)))