Average Error: 0.0 → 0.0
Time: 6.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 r8438300 = x;
        double r8438301 = r8438300 * r8438300;
        double r8438302 = y;
        double r8438303 = r8438302 * r8438302;
        double r8438304 = r8438301 - r8438303;
        return r8438304;
}
↓
double f(double x, double y) {
        double r8438305 = y;
        double r8438306 = x;
        double r8438307 = r8438305 + r8438306;
        double r8438308 = r8438306 - r8438305;
        double r8438309 = r8438307 * r8438308;
        return r8438309;
}

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