Average Error: 0.0 → 0.0
Time: 4.5s
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 r7116655 = x;
        double r7116656 = r7116655 * r7116655;
        double r7116657 = y;
        double r7116658 = r7116657 * r7116657;
        double r7116659 = r7116656 - r7116658;
        return r7116659;
}
↓
double f(double x, double y) {
        double r7116660 = x;
        double r7116661 = r7116660 * r7116660;
        double r7116662 = y;
        double r7116663 = r7116662 * r7116662;
        double r7116664 = r7116661 - r7116663;
        return r7116664;
}

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