Average Error: 0.0 → 0.0
Time: 13.9s
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 r128438 = x;
        double r128439 = r128438 * r128438;
        double r128440 = y;
        double r128441 = r128440 * r128440;
        double r128442 = r128439 - r128441;
        return r128442;
}
↓
double f(double x, double y) {
        double r128443 = x;
        double r128444 = r128443 * r128443;
        double r128445 = y;
        double r128446 = r128445 * r128445;
        double r128447 = r128444 - r128446;
        return r128447;
}

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