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 r119810 = x;
        double r119811 = r119810 * r119810;
        double r119812 = y;
        double r119813 = r119812 * r119812;
        double r119814 = r119811 - r119813;
        return r119814;
}
↓
double f(double x, double y) {
        double r119815 = x;
        double r119816 = y;
        double r119817 = r119815 - r119816;
        double r119818 = r119815 + r119816;
        double r119819 = r119817 * r119818;
        return r119819;
}

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)))