Average Error: 0.0 → 0.0
Time: 3.5s
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 r142289 = x;
        double r142290 = r142289 * r142289;
        double r142291 = y;
        double r142292 = r142291 * r142291;
        double r142293 = r142290 - r142292;
        return r142293;
}
↓
double f(double x, double y) {
        double r142294 = x;
        double r142295 = r142294 * r142294;
        double r142296 = y;
        double r142297 = r142296 * r142296;
        double r142298 = r142295 - r142297;
        return r142298;
}

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