Average Error: 0.0 → 0.0
Time: 3.3s
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[\left(x + y\right) \cdot \left(x - y\right)\]
\left(x + y\right) \cdot \left(x - y\right)
↓
\left(x + y\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r192364 = x;
        double r192365 = y;
        double r192366 = r192364 + r192365;
        double r192367 = r192364 - r192365;
        double r192368 = r192366 * r192367;
        return r192368;
}
↓
double f(double x, double y) {
        double r192369 = x;
        double r192370 = y;
        double r192371 = r192369 + r192370;
        double r192372 = r192369 - r192370;
        double r192373 = r192371 * r192372;
        return r192373;
}

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(x + y\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2019303 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  :precision binary64
  (* (+ x y) (- x y)))