Average Error: 0.0 → 0.0
Time: 7.7s
Precision: 64
\[x \cdot x - y \cdot y\]
↓
\[\left(y + x\right) \cdot \left(x - y\right)\]
x \cdot x - y \cdot y
↓
\left(y + x\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r9849896 = x;
        double r9849897 = r9849896 * r9849896;
        double r9849898 = y;
        double r9849899 = r9849898 * r9849898;
        double r9849900 = r9849897 - r9849899;
        return r9849900;
}
↓
double f(double x, double y) {
        double r9849901 = y;
        double r9849902 = x;
        double r9849903 = r9849901 + r9849902;
        double r9849904 = r9849902 - r9849901;
        double r9849905 = r9849903 * r9849904;
        return r9849905;
}

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. Using strategy rm

  3. Applied difference-of-squares0.0

    \[\leadsto \color{blue}{\left(x + y\right) \cdot \left(x - y\right)}\]

  4. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2019163 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  (- (* x x) (* y y)))