Average Error: 0.0 → 0.0
Time: 2.2s
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 r4032281 = x;
        double r4032282 = y;
        double r4032283 = r4032281 + r4032282;
        double r4032284 = r4032281 - r4032282;
        double r4032285 = r4032283 * r4032284;
        return r4032285;
}
↓
double f(double x, double y) {
        double r4032286 = y;
        double r4032287 = x;
        double r4032288 = r4032286 + r4032287;
        double r4032289 = r4032287 - r4032286;
        double r4032290 = r4032288 * r4032289;
        return r4032290;
}

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