Average Error: 0.0 → 0.0
Time: 4.3s
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 r151232 = x;
        double r151233 = r151232 * r151232;
        double r151234 = y;
        double r151235 = r151234 * r151234;
        double r151236 = r151233 - r151235;
        return r151236;
}
↓
double f(double x, double y) {
        double r151237 = x;
        double r151238 = r151237 * r151237;
        double r151239 = y;
        double r151240 = r151239 * r151239;
        double r151241 = r151238 - r151240;
        return r151241;
}

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