Average Error: 0.0 → 0.0
Time: 4.2s
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 r227388 = x;
        double r227389 = r227388 * r227388;
        double r227390 = y;
        double r227391 = r227390 * r227390;
        double r227392 = r227389 - r227391;
        return r227392;
}
↓
double f(double x, double y) {
        double r227393 = x;
        double r227394 = y;
        double r227395 = r227393 - r227394;
        double r227396 = r227393 + r227394;
        double r227397 = r227395 * r227396;
        return r227397;
}

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