Average Error: 0.0 → 0.0
Time: 5.1s
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 r110873 = x;
        double r110874 = r110873 * r110873;
        double r110875 = y;
        double r110876 = r110875 * r110875;
        double r110877 = r110874 - r110876;
        return r110877;
}
↓
double f(double x, double y) {
        double r110878 = x;
        double r110879 = r110878 * r110878;
        double r110880 = y;
        double r110881 = r110880 * r110880;
        double r110882 = r110879 - r110881;
        return r110882;
}

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