Average Error: 0.0 → 0.0
Time: 6.1s
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 r6981510 = x;
        double r6981511 = r6981510 * r6981510;
        double r6981512 = y;
        double r6981513 = r6981512 * r6981512;
        double r6981514 = r6981511 - r6981513;
        return r6981514;
}
↓
double f(double x, double y) {
        double r6981515 = y;
        double r6981516 = x;
        double r6981517 = r6981515 + r6981516;
        double r6981518 = r6981516 - r6981515;
        double r6981519 = r6981517 * r6981518;
        return r6981519;
}

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