Average Error: 0.0 → 0.0
Time: 12.4s
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 r106054 = x;
        double r106055 = r106054 * r106054;
        double r106056 = y;
        double r106057 = r106056 * r106056;
        double r106058 = r106055 - r106057;
        return r106058;
}
↓
double f(double x, double y) {
        double r106059 = x;
        double r106060 = r106059 * r106059;
        double r106061 = y;
        double r106062 = r106061 * r106061;
        double r106063 = r106060 - r106062;
        return r106063;
}

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