Average Error: 0.0 → 0.0
Time: 4.2s
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 r180088 = x;
        double r180089 = r180088 * r180088;
        double r180090 = y;
        double r180091 = r180090 * r180090;
        double r180092 = r180089 - r180091;
        return r180092;
}
↓
double f(double x, double y) {
        double r180093 = x;
        double r180094 = y;
        double r180095 = r180093 - r180094;
        double r180096 = r180093 + r180094;
        double r180097 = r180095 * r180096;
        return r180097;
}

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