Average Error: 0.0 → 0.0
Time: 3.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 r119999 = x;
        double r120000 = y;
        double r120001 = r119999 + r120000;
        double r120002 = r119999 - r120000;
        double r120003 = r120001 * r120002;
        return r120003;
}
↓
double f(double x, double y) {
        double r120004 = y;
        double r120005 = x;
        double r120006 = r120004 + r120005;
        double r120007 = r120005 - r120004;
        double r120008 = r120006 * r120007;
        return r120008;
}

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