Average Error: 0.0 → 0.0
Time: 666.0ms
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 r170261 = x;
        double r170262 = r170261 * r170261;
        double r170263 = y;
        double r170264 = r170263 * r170263;
        double r170265 = r170262 - r170264;
        return r170265;
}
↓
double f(double x, double y) {
        double r170266 = x;
        double r170267 = r170266 * r170266;
        double r170268 = y;
        double r170269 = r170268 * r170268;
        double r170270 = r170267 - r170269;
        return r170270;
}

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