Average Error: 0.0 → 0.0
Time: 651.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 r247243 = x;
        double r247244 = y;
        double r247245 = r247243 + r247244;
        double r247246 = r247243 - r247244;
        double r247247 = r247245 * r247246;
        return r247247;
}
↓
double f(double x, double y) {
        double r247248 = x;
        double r247249 = y;
        double r247250 = r247248 + r247249;
        double r247251 = r247248 - r247249;
        double r247252 = r247250 * r247251;
        return r247252;
}

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