Average Error: 0.0 → 0.0
Time: 12.9s
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 r115269 = x;
        double r115270 = r115269 * r115269;
        double r115271 = y;
        double r115272 = r115271 * r115271;
        double r115273 = r115270 - r115272;
        return r115273;
}
↓
double f(double x, double y) {
        double r115274 = x;
        double r115275 = r115274 * r115274;
        double r115276 = y;
        double r115277 = r115276 * r115276;
        double r115278 = r115275 - r115277;
        return r115278;
}

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