Average Error: 0.0 → 0.0
Time: 15.9s
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 r136486 = x;
        double r136487 = r136486 * r136486;
        double r136488 = y;
        double r136489 = r136488 * r136488;
        double r136490 = r136487 - r136489;
        return r136490;
}
↓
double f(double x, double y) {
        double r136491 = x;
        double r136492 = y;
        double r136493 = r136491 - r136492;
        double r136494 = r136491 + r136492;
        double r136495 = r136493 * r136494;
        return r136495;
}

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