Average Error: 0.0 → 0.0
Time: 15.3s
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 r7734238 = x;
        double r7734239 = r7734238 * r7734238;
        double r7734240 = y;
        double r7734241 = r7734240 * r7734240;
        double r7734242 = r7734239 - r7734241;
        return r7734242;
}
↓
double f(double x, double y) {
        double r7734243 = y;
        double r7734244 = x;
        double r7734245 = r7734243 + r7734244;
        double r7734246 = r7734244 - r7734243;
        double r7734247 = r7734245 * r7734246;
        return r7734247;
}

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