Average Error: 0.0 → 0.0
Time: 1.4s
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 r45834 = x;
        double r45835 = r45834 * r45834;
        double r45836 = y;
        double r45837 = r45836 * r45836;
        double r45838 = r45835 - r45837;
        return r45838;
}
↓
double f(double x, double y) {
        double r45839 = x;
        double r45840 = y;
        double r45841 = r45839 - r45840;
        double r45842 = r45839 + r45840;
        double r45843 = r45841 * r45842;
        return r45843;
}

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