Average Error: 0.0 → 0.0
Time: 5.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 r10081913 = x;
        double r10081914 = y;
        double r10081915 = r10081913 + r10081914;
        double r10081916 = r10081913 - r10081914;
        double r10081917 = r10081915 * r10081916;
        return r10081917;
}
↓
double f(double x, double y) {
        double r10081918 = y;
        double r10081919 = x;
        double r10081920 = r10081918 + r10081919;
        double r10081921 = r10081919 - r10081918;
        double r10081922 = r10081920 * r10081921;
        return r10081922;
}

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