Average Error: 0.0 → 0.0
Time: 334.0ms
Precision: 64
\[x \cdot x - 1\]
↓
\[x \cdot x - 1\]
x \cdot x - 1
↓
x \cdot x - 1
double f(double x) {
        double r190987 = x;
        double r190988 = r190987 * r190987;
        double r190989 = 1.0;
        double r190990 = r190988 - r190989;
        return r190990;
}
↓
double f(double x) {
        double r190991 = x;
        double r190992 = r190991 * r190991;
        double r190993 = 1.0;
        double r190994 = r190992 - r190993;
        return r190994;
}

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 2020027 
(FPCore (x)
  :name "Data.Random.Dice:roll from dice-0.1"
  :precision binary64
  (- (* x x) 1))