Average Error: 0.0 → 0.0
Time: 1.1s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y) {
	return ((double) (((double) (x * x)) - ((double) (y * y))));
}

↓
double code(double x, double y) {
	return ((double) (((double) (x + y)) * ((double) (x - y))));
}

Error
Bits error versus x
Bits error versus y
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.0
    \[\]
  2. Using strategy rm
  3. Applied difference-of-squares0.0
    \[\leadsto \]
  4. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  :precision binary64
  (- (* x x) (* y y)))