Average Error: 0.0 → 0.0
Time: 643.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 r191445 = x;
        double r191446 = r191445 * r191445;
        double r191447 = y;
        double r191448 = r191447 * r191447;
        double r191449 = r191446 - r191448;
        return r191449;
}
↓
double f(double x, double y) {
        double r191450 = x;
        double r191451 = r191450 * r191450;
        double r191452 = y;
        double r191453 = r191452 * r191452;
        double r191454 = r191451 - r191453;
        return r191454;
}

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