Average Error: 0.0 → 0.0
Time: 4.5s
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 r9137622 = x;
        double r9137623 = y;
        double r9137624 = r9137622 + r9137623;
        double r9137625 = r9137622 - r9137623;
        double r9137626 = r9137624 * r9137625;
        return r9137626;
}
↓
double f(double x, double y) {
        double r9137627 = y;
        double r9137628 = x;
        double r9137629 = r9137627 + r9137628;
        double r9137630 = r9137628 - r9137627;
        double r9137631 = r9137629 * r9137630;
        return r9137631;
}

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