Average Error: 0.0 → 0.0
Time: 637.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 r254257 = x;
        double r254258 = r254257 * r254257;
        double r254259 = y;
        double r254260 = r254259 * r254259;
        double r254261 = r254258 - r254260;
        return r254261;
}
↓
double f(double x, double y) {
        double r254262 = x;
        double r254263 = r254262 * r254262;
        double r254264 = y;
        double r254265 = r254264 * r254264;
        double r254266 = r254263 - r254265;
        return r254266;
}

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