Average Error: 0.0 → 0.0
Time: 719.0ms
Precision: binary64
Cost: 320
\[x \cdot x - 1\]
↓
\[x \cdot x - 1\]
x \cdot x - 1
↓
x \cdot x - 1
(FPCore (x) :precision binary64 (- (* x x) 1.0))
↓
(FPCore (x) :precision binary64 (- (* x x) 1.0))
double code(double x) {
	return (x * x) - 1.0;
}
↓
double code(double x) {
	return (x * x) - 1.0;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Alternatives

Alternative 1
Error21.6
Cost64
\[-1\]
Alternative 2
Error62.2
Cost64
\[1\]

Error

Time

Derivation

  1. Initial program 0.0

    \[x \cdot x - 1\]

  2. Simplified0.0

    \[\leadsto \color{blue}{x \cdot x - 1}\]

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2021040 
(FPCore (x)
  :name "Data.Random.Dice:roll from dice-0.1"
  :precision binary64
  (- (* x x) 1.0))