Average Error: 0.0 → 0.0
Time: 1.8s
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 r197880 = x;
        double r197881 = y;
        double r197882 = r197880 + r197881;
        double r197883 = r197880 - r197881;
        double r197884 = r197882 * r197883;
        return r197884;
}
↓
double f(double x, double y) {
        double r197885 = x;
        double r197886 = y;
        double r197887 = r197885 + r197886;
        double r197888 = r197885 - r197886;
        double r197889 = r197887 * r197888;
        return r197889;
}

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