Average Error: 0.0 → 0.0
Time: 13.0s
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 r129396 = x;
        double r129397 = r129396 * r129396;
        double r129398 = y;
        double r129399 = r129398 * r129398;
        double r129400 = r129397 - r129399;
        return r129400;
}
↓
double f(double x, double y) {
        double r129401 = x;
        double r129402 = r129401 * r129401;
        double r129403 = y;
        double r129404 = r129403 * r129403;
        double r129405 = r129402 - r129404;
        return r129405;
}

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)))