Average Error: 0.0 → 0.0
Time: 5.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 r8928470 = x;
        double r8928471 = y;
        double r8928472 = r8928470 + r8928471;
        double r8928473 = r8928470 - r8928471;
        double r8928474 = r8928472 * r8928473;
        return r8928474;
}
↓
double f(double x, double y) {
        double r8928475 = y;
        double r8928476 = x;
        double r8928477 = r8928475 + r8928476;
        double r8928478 = r8928476 - r8928475;
        double r8928479 = r8928477 * r8928478;
        return r8928479;
}

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)))