Average Error: 0.0 → 0.0
Time: 6.8s
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 r12450499 = x;
        double r12450500 = r12450499 * r12450499;
        double r12450501 = y;
        double r12450502 = r12450501 * r12450501;
        double r12450503 = r12450500 - r12450502;
        return r12450503;
}
↓
double f(double x, double y) {
        double r12450504 = y;
        double r12450505 = x;
        double r12450506 = r12450504 + r12450505;
        double r12450507 = r12450505 - r12450504;
        double r12450508 = r12450506 * r12450507;
        return r12450508;
}

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