Average Error: 0.0 → 0.0
Time: 11.9s
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 r9686023 = x;
        double r9686024 = y;
        double r9686025 = r9686023 + r9686024;
        double r9686026 = r9686023 - r9686024;
        double r9686027 = r9686025 * r9686026;
        return r9686027;
}
↓
double f(double x, double y) {
        double r9686028 = y;
        double r9686029 = x;
        double r9686030 = r9686028 + r9686029;
        double r9686031 = r9686029 - r9686028;
        double r9686032 = r9686030 * r9686031;
        return r9686032;
}

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