Average Error: 0.0 → 0.0
Time: 6.7s
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 r751860 = x;
        double r751861 = y;
        double r751862 = r751860 + r751861;
        double r751863 = r751860 - r751861;
        double r751864 = r751862 * r751863;
        return r751864;
}
↓
double f(double x, double y) {
        double r751865 = y;
        double r751866 = x;
        double r751867 = r751865 + r751866;
        double r751868 = r751866 - r751865;
        double r751869 = r751867 * r751868;
        return r751869;
}

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