Average Error: 0.0 → 0.0
Time: 8.2s
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 r6282152 = x;
        double r6282153 = r6282152 * r6282152;
        double r6282154 = y;
        double r6282155 = r6282154 * r6282154;
        double r6282156 = r6282153 - r6282155;
        return r6282156;
}
↓
double f(double x, double y) {
        double r6282157 = y;
        double r6282158 = x;
        double r6282159 = r6282157 + r6282158;
        double r6282160 = r6282158 - r6282157;
        double r6282161 = r6282159 * r6282160;
        return r6282161;
}

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