Average Error: 0.0 → 0.0
Time: 9.6s
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 r216471 = x;
        double r216472 = r216471 * r216471;
        double r216473 = y;
        double r216474 = r216473 * r216473;
        double r216475 = r216472 - r216474;
        return r216475;
}
↓
double f(double x, double y) {
        double r216476 = x;
        double r216477 = y;
        double r216478 = r216476 - r216477;
        double r216479 = r216476 + r216477;
        double r216480 = r216478 * r216479;
        return r216480;
}

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