Average Error: 0.0 → 0.0
Time: 711.0ms
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 r171661 = x;
        double r171662 = r171661 * r171661;
        double r171663 = y;
        double r171664 = r171663 * r171663;
        double r171665 = r171662 - r171664;
        return r171665;
}
↓
double f(double x, double y) {
        double r171666 = x;
        double r171667 = y;
        double r171668 = r171666 + r171667;
        double r171669 = r171666 - r171667;
        double r171670 = r171668 * r171669;
        return r171670;
}

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