Average Error: 0.0 → 0.0
Time: 1.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 r162513 = x;
        double r162514 = r162513 * r162513;
        double r162515 = y;
        double r162516 = r162515 * r162515;
        double r162517 = r162514 - r162516;
        return r162517;
}
↓
double f(double x, double y) {
        double r162518 = x;
        double r162519 = r162518 * r162518;
        double r162520 = y;
        double r162521 = r162520 * r162520;
        double r162522 = r162519 - r162521;
        return r162522;
}

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