Average Error: 0.0 → 0.0
Time: 313.0ms
Precision: 64
\[x \cdot x - 1\]
↓
\[x \cdot x - 1\]
x \cdot x - 1
↓
x \cdot x - 1
double f(double x) {
        double r208905 = x;
        double r208906 = r208905 * r208905;
        double r208907 = 1.0;
        double r208908 = r208906 - r208907;
        return r208908;
}
↓
double f(double x) {
        double r208909 = x;
        double r208910 = r208909 * r208909;
        double r208911 = 1.0;
        double r208912 = r208910 - r208911;
        return r208912;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot x - 1\]

  2. Final simplification0.0

    \[\leadsto x \cdot x - 1\]

Reproduce

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