Average Error: 0.0 → 0.0
Time: 4.4s
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[\left(y + x\right) \cdot \left(x - y\right)\]
\left(x + y\right) \cdot \left(x - y\right)
↓
\left(y + x\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r10806268 = x;
        double r10806269 = y;
        double r10806270 = r10806268 + r10806269;
        double r10806271 = r10806268 - r10806269;
        double r10806272 = r10806270 * r10806271;
        return r10806272;
}
↓
double f(double x, double y) {
        double r10806273 = y;
        double r10806274 = x;
        double r10806275 = r10806273 + r10806274;
        double r10806276 = r10806274 - r10806273;
        double r10806277 = r10806275 * r10806276;
        return r10806277;
}

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

    \[\left(x + y\right) \cdot \left(x - y\right)\]

  2. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2019158 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  (* (+ x y) (- x y)))