Average Error: 0.0 → 0.0
Time: 6.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 r230446 = x;
        double r230447 = r230446 * r230446;
        double r230448 = y;
        double r230449 = r230448 * r230448;
        double r230450 = r230447 - r230449;
        return r230450;
}
↓
double f(double x, double y) {
        double r230451 = x;
        double r230452 = y;
        double r230453 = r230451 - r230452;
        double r230454 = r230451 + r230452;
        double r230455 = r230453 * r230454;
        return r230455;
}

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