Average Error: 0.0 → 0.0
Time: 703.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 r188866 = x;
        double r188867 = r188866 * r188866;
        double r188868 = y;
        double r188869 = r188868 * r188868;
        double r188870 = r188867 - r188869;
        return r188870;
}
↓
double f(double x, double y) {
        double r188871 = x;
        double r188872 = r188871 * r188871;
        double r188873 = y;
        double r188874 = r188873 * r188873;
        double r188875 = r188872 - r188874;
        return r188875;
}

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