Average Error: 0.0 → 0.0
Time: 28.7s
Precision: 64
\[x \cdot x - y \cdot y\]
↓
\[\left(x + y\right) \cdot \left(x - y\right)\]
x \cdot x - y \cdot y
↓
\left(x + y\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r10121063 = x;
        double r10121064 = r10121063 * r10121063;
        double r10121065 = y;
        double r10121066 = r10121065 * r10121065;
        double r10121067 = r10121064 - r10121066;
        return r10121067;
}
↓
double f(double x, double y) {
        double r10121068 = x;
        double r10121069 = y;
        double r10121070 = r10121068 + r10121069;
        double r10121071 = r10121068 - r10121069;
        double r10121072 = r10121070 * r10121071;
        return r10121072;
}

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(x + y\right) \cdot \left(x - y\right)\]

Reproduce

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