Average Error: 0.0 → 0
Time: 511.0ms
Precision: 64
\[x \cdot x - 1\]
↓
\[\mathsf{fma}\left(x, x, -1\right)\]
x \cdot x - 1
↓
\mathsf{fma}\left(x, x, -1\right)
double f(double x) {
        double r223623 = x;
        double r223624 = r223623 * r223623;
        double r223625 = 1.0;
        double r223626 = r223624 - r223625;
        return r223626;
}
↓
double f(double x) {
        double r223627 = x;
        double r223628 = 1.0;
        double r223629 = -r223628;
        double r223630 = fma(r223627, r223627, r223629);
        return r223630;
}

Error

Bits error versus x

Derivation

  1. Initial program 0.0

    \[x \cdot x - 1\]
  2. Using strategy rm

  3. Applied fma-neg0

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

  4. Final simplification0

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

Reproduce

herbie shell --seed 2020036 +o rules:numerics
(FPCore (x)
  :name "Data.Random.Dice:roll from dice-0.1"
  :precision binary64
  (- (* x x) 1))