Average Error: 0.0 → 0.0
Time: 609.0ms
Precision: 64
\[x \cdot x - y \cdot y\]
↓
\[x \cdot x - y \cdot y\]
x \cdot x - y \cdot y
↓
x \cdot x - y \cdot y
double f(double x, double y) {
        double r202867 = x;
        double r202868 = r202867 * r202867;
        double r202869 = y;
        double r202870 = r202869 * r202869;
        double r202871 = r202868 - r202870;
        return r202871;
}
↓
double f(double x, double y) {
        double r202872 = x;
        double r202873 = r202872 * r202872;
        double r202874 = y;
        double r202875 = r202874 * r202874;
        double r202876 = r202873 - r202875;
        return r202876;
}

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

    \[x \cdot x - y \cdot y\]

  2. Final simplification0.0

    \[\leadsto x \cdot x - y \cdot y\]

Reproduce

herbie shell --seed 2020062 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  :precision binary64
  (- (* x x) (* y y)))