Average Error: 0.0 → 0.0
Time: 846.0ms
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 r254814 = x;
        double r254815 = r254814 * r254814;
        double r254816 = y;
        double r254817 = r254816 * r254816;
        double r254818 = r254815 - r254817;
        return r254818;
}
↓
double f(double x, double y) {
        double r254819 = x;
        double r254820 = r254819 * r254819;
        double r254821 = y;
        double r254822 = r254821 * r254821;
        double r254823 = r254820 - r254822;
        return r254823;
}

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