Average Error: 0.0 → 0.0
Time: 8.6s
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 r9437339 = x;
        double r9437340 = y;
        double r9437341 = r9437339 + r9437340;
        double r9437342 = r9437339 - r9437340;
        double r9437343 = r9437341 * r9437342;
        return r9437343;
}
↓
double f(double x, double y) {
        double r9437344 = y;
        double r9437345 = x;
        double r9437346 = r9437344 + r9437345;
        double r9437347 = r9437345 - r9437344;
        double r9437348 = r9437346 * r9437347;
        return r9437348;
}

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