Average Error: 0.0 → 0.0
Time: 8.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 r218492 = x;
        double r218493 = r218492 * r218492;
        double r218494 = y;
        double r218495 = r218494 * r218494;
        double r218496 = r218493 - r218495;
        return r218496;
}
↓
double f(double x, double y) {
        double r218497 = x;
        double r218498 = y;
        double r218499 = r218497 - r218498;
        double r218500 = r218497 + r218498;
        double r218501 = r218499 * r218500;
        return r218501;
}

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