Average Error: 0.0 → 0.0
Time: 4.8s
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 r154900 = x;
        double r154901 = r154900 * r154900;
        double r154902 = y;
        double r154903 = r154902 * r154902;
        double r154904 = r154901 - r154903;
        return r154904;
}
↓
double f(double x, double y) {
        double r154905 = x;
        double r154906 = r154905 * r154905;
        double r154907 = y;
        double r154908 = r154907 * r154907;
        double r154909 = r154906 - r154908;
        return r154909;
}

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