Average Error: 0.0 → 0.0
Time: 15.7s
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 r127870 = x;
        double r127871 = r127870 * r127870;
        double r127872 = y;
        double r127873 = r127872 * r127872;
        double r127874 = r127871 - r127873;
        return r127874;
}
↓
double f(double x, double y) {
        double r127875 = x;
        double r127876 = r127875 * r127875;
        double r127877 = y;
        double r127878 = r127877 * r127877;
        double r127879 = r127876 - r127878;
        return r127879;
}

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