Average Error: 0.0 → 0.0
Time: 5.8s
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 r6972607 = x;
        double r6972608 = r6972607 * r6972607;
        double r6972609 = y;
        double r6972610 = r6972609 * r6972609;
        double r6972611 = r6972608 - r6972610;
        return r6972611;
}
↓
double f(double x, double y) {
        double r6972612 = y;
        double r6972613 = x;
        double r6972614 = r6972612 + r6972613;
        double r6972615 = r6972613 - r6972612;
        double r6972616 = r6972614 * r6972615;
        return r6972616;
}

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