Average Error: 0.0 → 0.0
Time: 14.1s
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 r124973 = x;
        double r124974 = r124973 * r124973;
        double r124975 = y;
        double r124976 = r124975 * r124975;
        double r124977 = r124974 - r124976;
        return r124977;
}
↓
double f(double x, double y) {
        double r124978 = x;
        double r124979 = y;
        double r124980 = r124978 - r124979;
        double r124981 = r124978 + r124979;
        double r124982 = r124980 * r124981;
        return r124982;
}

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