Average Error: 0.0 → 0.0
Time: 3.9s
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 r166576 = x;
        double r166577 = r166576 * r166576;
        double r166578 = y;
        double r166579 = r166578 * r166578;
        double r166580 = r166577 - r166579;
        return r166580;
}
↓
double f(double x, double y) {
        double r166581 = x;
        double r166582 = r166581 * r166581;
        double r166583 = y;
        double r166584 = r166583 * r166583;
        double r166585 = r166582 - r166584;
        return r166585;
}

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