Average Error: 0.0 → 0.0
Time: 16.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 r6870169 = x;
        double r6870170 = r6870169 * r6870169;
        double r6870171 = y;
        double r6870172 = r6870171 * r6870171;
        double r6870173 = r6870170 - r6870172;
        return r6870173;
}
↓
double f(double x, double y) {
        double r6870174 = y;
        double r6870175 = x;
        double r6870176 = r6870174 + r6870175;
        double r6870177 = r6870175 - r6870174;
        double r6870178 = r6870176 * r6870177;
        return r6870178;
}

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