Average Error: 0.0 → 0.0
Time: 14.0s
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 r171991 = x;
        double r171992 = r171991 * r171991;
        double r171993 = y;
        double r171994 = r171993 * r171993;
        double r171995 = r171992 - r171994;
        return r171995;
}
↓
double f(double x, double y) {
        double r171996 = x;
        double r171997 = y;
        double r171998 = r171996 - r171997;
        double r171999 = r171996 + r171997;
        double r172000 = r171998 * r171999;
        return r172000;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(x - y\right) \cdot \left(x + y\right)}\]

  3. Final simplification0.0

    \[\leadsto \left(x - y\right) \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2019326 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  :precision binary64
  (- (* x x) (* y y)))