Average Error: 0.0 → 0.0
Time: 4.8s
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 r10611362 = x;
        double r10611363 = y;
        double r10611364 = r10611362 + r10611363;
        double r10611365 = r10611362 - r10611363;
        double r10611366 = r10611364 * r10611365;
        return r10611366;
}
↓
double f(double x, double y) {
        double r10611367 = y;
        double r10611368 = x;
        double r10611369 = r10611367 + r10611368;
        double r10611370 = r10611368 - r10611367;
        double r10611371 = r10611369 * r10611370;
        return r10611371;
}

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