Average Error: 0.0 → 0.0
Time: 6.4s
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 r13820410 = x;
        double r13820411 = r13820410 * r13820410;
        double r13820412 = y;
        double r13820413 = r13820412 * r13820412;
        double r13820414 = r13820411 - r13820413;
        return r13820414;
}
↓
double f(double x, double y) {
        double r13820415 = x;
        double r13820416 = r13820415 * r13820415;
        double r13820417 = y;
        double r13820418 = r13820417 * r13820417;
        double r13820419 = r13820416 - r13820418;
        return r13820419;
}

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