Average Error: 0.0 → 0.0
Time: 1.5s
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 r255199 = x;
        double r255200 = r255199 * r255199;
        double r255201 = y;
        double r255202 = r255201 * r255201;
        double r255203 = r255200 - r255202;
        return r255203;
}
↓
double f(double x, double y) {
        double r255204 = x;
        double r255205 = y;
        double r255206 = r255204 - r255205;
        double r255207 = r255204 + r255205;
        double r255208 = r255206 * r255207;
        return r255208;
}

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