Average Error: 0.0 → 0.0
Time: 11.5s
Precision: 64
\[0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[\mathsf{fma}\left(x \cdot x, x, x \cdot x\right)\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
\mathsf{fma}\left(x \cdot x, x, x \cdot x\right)
double f(double x) {
        double r3928076 = x;
        double r3928077 = r3928076 * r3928076;
        double r3928078 = r3928076 * r3928077;
        double r3928079 = r3928078 + r3928077;
        return r3928079;
}
↓
double f(double x) {
        double r3928080 = x;
        double r3928081 = r3928080 * r3928080;
        double r3928082 = fma(r3928081, r3928080, r3928081);
        return r3928082;
}

Error

Bits error versus x

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

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019134 +o rules:numerics
(FPCore (x)
  :name "Expression 3, p15"
  :pre (<= 0 x 2)

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

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