Average Error: 0.0 → 0.0
Time: 12.2s
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 r123524 = x;
        double r123525 = r123524 * r123524;
        double r123526 = y;
        double r123527 = r123526 * r123526;
        double r123528 = r123525 - r123527;
        return r123528;
}
↓
double f(double x, double y) {
        double r123529 = x;
        double r123530 = r123529 * r123529;
        double r123531 = y;
        double r123532 = r123531 * r123531;
        double r123533 = r123530 - r123532;
        return r123533;
}

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