Main:bigenough1 from B

Average Error: 0.0 → 0

Time: 424.0ms

Precision: 64

Math

\[x + x \cdot x\]

↓

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

C

double f(double x) {
        double r106936 = x;
        double r106937 = r106936 * r106936;
        double r106938 = r106936 + r106937;
        return r106938;
}

↓

double f(double x) {
        double r106939 = x;
        double r106940 = fma(r106939, r106939, r106939);
        return r106940;
}

Error

Bits error versus x

Derivation

1. Initial program 0.0

   \[x + x \cdot x\]

2. Simplified 0

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

3. Final simplification 0

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

Reproduce

herbie shell --seed 2020039 +o rules:numerics
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))