Average Error: 0.0 → 0.0
Time: 7.5s
Precision: 64
\[x \cdot x - y \cdot y\]
↓
\[\left(y + x\right) \cdot \left(x - y\right)\]
x \cdot x - y \cdot y
↓
\left(y + x\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r9699201 = x;
        double r9699202 = r9699201 * r9699201;
        double r9699203 = y;
        double r9699204 = r9699203 * r9699203;
        double r9699205 = r9699202 - r9699204;
        return r9699205;
}
↓
double f(double x, double y) {
        double r9699206 = y;
        double r9699207 = x;
        double r9699208 = r9699206 + r9699207;
        double r9699209 = r9699207 - r9699206;
        double r9699210 = r9699208 * r9699209;
        return r9699210;
}

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. Using strategy rm

  3. Applied difference-of-squares0.0

    \[\leadsto \color{blue}{\left(x + y\right) \cdot \left(x - y\right)}\]

  4. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2019171 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  (- (* x x) (* y y)))