Average Error: 0.0 → 0.0
Time: 15.2s
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 r162919 = x;
        double r162920 = r162919 * r162919;
        double r162921 = y;
        double r162922 = r162921 * r162921;
        double r162923 = r162920 - r162922;
        return r162923;
}
↓
double f(double x, double y) {
        double r162924 = x;
        double r162925 = r162924 * r162924;
        double r162926 = y;
        double r162927 = r162926 * r162926;
        double r162928 = r162925 - r162927;
        return r162928;
}

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)))