Average Error: 0.0 → 0
Time: 1.0s
Precision: 64
\[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 r11472319 = x;
        double r11472320 = r11472319 * r11472319;
        double r11472321 = r11472319 + r11472320;
        return r11472321;
}
↓
double f(double x) {
        double r11472322 = x;
        double r11472323 = fma(r11472322, r11472322, r11472322);
        return r11472323;
}

Error

Bits error versus x

Target

Original0.0
Target0.0
Herbie0
\[\left(1.0 + 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 2019121 +o rules:numerics
(FPCore (x)
  :name "Expression 2, p15"
  :pre (<= 0 x 2)

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

  (+ x (* x x)))