Average Error: 0.0 → 0.0
Time: 27.4s
Precision: 64
\[0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[\mathsf{fma}\left(x, x \cdot x, x \cdot x\right)\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
\mathsf{fma}\left(x, x \cdot x, x \cdot x\right)
double f(double x) {
        double r4175171 = x;
        double r4175172 = r4175171 * r4175171;
        double r4175173 = r4175171 * r4175172;
        double r4175174 = r4175173 + r4175172;
        return r4175174;
}
↓
double f(double x) {
        double r4175175 = x;
        double r4175176 = r4175175 * r4175175;
        double r4175177 = fma(r4175175, r4175176, r4175176);
        return r4175177;
}

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, x \cdot x, x \cdot x\right)}\]

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019144 +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)))