Average Error: 0.0 → 0.0
Time: 7.6s
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 r11700153 = x;
        double r11700154 = r11700153 * r11700153;
        double r11700155 = y;
        double r11700156 = r11700155 * r11700155;
        double r11700157 = r11700154 - r11700156;
        return r11700157;
}
↓
double f(double x, double y) {
        double r11700158 = y;
        double r11700159 = x;
        double r11700160 = r11700158 + r11700159;
        double r11700161 = r11700159 - r11700158;
        double r11700162 = r11700160 * r11700161;
        return r11700162;
}

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)))