Average Error: 0.0 → 0.0
Time: 1.0s
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 r156887 = x;
        double r156888 = y;
        double r156889 = r156887 + r156888;
        double r156890 = r156887 - r156888;
        double r156891 = r156889 * r156890;
        return r156891;
}
↓
double f(double x, double y) {
        double r156892 = x;
        double r156893 = y;
        double r156894 = r156892 + r156893;
        double r156895 = r156892 - r156893;
        double r156896 = r156894 * r156895;
        return r156896;
}

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