Average Error: 0.0 → 0.0
Time: 5.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 r9551174 = x;
        double r9551175 = r9551174 * r9551174;
        double r9551176 = y;
        double r9551177 = r9551176 * r9551176;
        double r9551178 = r9551175 - r9551177;
        return r9551178;
}
↓
double f(double x, double y) {
        double r9551179 = y;
        double r9551180 = x;
        double r9551181 = r9551179 + r9551180;
        double r9551182 = r9551180 - r9551179;
        double r9551183 = r9551181 * r9551182;
        return r9551183;
}

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