Average Error: 0.0 → 0.0
Time: 5.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 r213863 = x;
        double r213864 = r213863 * r213863;
        double r213865 = y;
        double r213866 = r213865 * r213865;
        double r213867 = r213864 - r213866;
        return r213867;
}
↓
double f(double x, double y) {
        double r213868 = x;
        double r213869 = y;
        double r213870 = r213868 - r213869;
        double r213871 = r213868 + r213869;
        double r213872 = r213870 * r213871;
        return r213872;
}

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