Average Error: 0.0 → 0.0
Time: 1.1s
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 r163892 = x;
        double r163893 = r163892 * r163892;
        double r163894 = y;
        double r163895 = r163894 * r163894;
        double r163896 = r163893 - r163895;
        return r163896;
}
↓
double f(double x, double y) {
        double r163897 = x;
        double r163898 = y;
        double r163899 = r163897 + r163898;
        double r163900 = r163897 - r163898;
        double r163901 = r163899 * r163900;
        return r163901;
}

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