Average Error: 0.0 → 0.0
Time: 6.4s
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 r192196 = x;
        double r192197 = y;
        double r192198 = r192196 + r192197;
        double r192199 = r192196 - r192197;
        double r192200 = r192198 * r192199;
        return r192200;
}
↓
double f(double x, double y) {
        double r192201 = x;
        double r192202 = y;
        double r192203 = r192201 + r192202;
        double r192204 = r192201 - r192202;
        double r192205 = r192203 * r192204;
        return r192205;
}

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