Average Error: 0.0 → 0
Time: 880.0ms
Precision: 64
\[0.0 \le x \le 2\]
\[x + x \cdot x\]
↓
\[\mathsf{fma}\left(x, x, x\right)\]
x + x \cdot x
↓
\mathsf{fma}\left(x, x, x\right)
double f(double x) {
        double r84883 = x;
        double r84884 = r84883 * r84883;
        double r84885 = r84883 + r84884;
        return r84885;
}
↓
double f(double x) {
        double r84886 = x;
        double r84887 = fma(r84886, r84886, r84886);
        return r84887;
}

Error

Bits error versus x

Target

Original0.0
Target0.0
Herbie0
\[\left(1 + x\right) \cdot x\]

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]

  2. Simplified0

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

  3. Final simplification0

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

Reproduce

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

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

  (+ x (* x x)))