Average Error: 0.0 → 0
Time: 737.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 r243654 = x;
        double r243655 = r243654 * r243654;
        double r243656 = 1.0;
        double r243657 = r243655 - r243656;
        return r243657;
}
↓
double f(double x) {
        double r243658 = x;
        double r243659 = 1.0;
        double r243660 = -r243659;
        double r243661 = fma(r243658, r243658, r243660);
        return r243661;
}

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))