Average Error: 0.0 → 0.0
Time: 13.1s
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 r126312 = x;
        double r126313 = r126312 * r126312;
        double r126314 = y;
        double r126315 = r126314 * r126314;
        double r126316 = r126313 - r126315;
        return r126316;
}
↓
double f(double x, double y) {
        double r126317 = x;
        double r126318 = r126317 * r126317;
        double r126319 = y;
        double r126320 = r126319 * r126319;
        double r126321 = r126318 - r126320;
        return r126321;
}

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