Average Error: 0.0 → 0.0
Time: 724.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 r156031 = x;
        double r156032 = r156031 * r156031;
        double r156033 = y;
        double r156034 = r156033 * r156033;
        double r156035 = r156032 - r156034;
        return r156035;
}
↓
double f(double x, double y) {
        double r156036 = x;
        double r156037 = r156036 * r156036;
        double r156038 = y;
        double r156039 = r156038 * r156038;
        double r156040 = r156037 - r156039;
        return r156040;
}

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 2020003 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  :precision binary64
  (- (* x x) (* y y)))