Average Error: 0.0 → 0.0
Time: 668.0ms
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 r264054 = x;
        double r264055 = y;
        double r264056 = r264054 + r264055;
        double r264057 = r264054 - r264055;
        double r264058 = r264056 * r264057;
        return r264058;
}
↓
double f(double x, double y) {
        double r264059 = x;
        double r264060 = y;
        double r264061 = r264059 + r264060;
        double r264062 = r264059 - r264060;
        double r264063 = r264061 * r264062;
        return r264063;
}

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