Average Error: 0.0 → 0.0
Time: 6.3s
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 r150631 = x;
        double r150632 = y;
        double r150633 = r150631 + r150632;
        double r150634 = r150631 - r150632;
        double r150635 = r150633 * r150634;
        return r150635;
}
↓
double f(double x, double y) {
        double r150636 = x;
        double r150637 = y;
        double r150638 = r150636 + r150637;
        double r150639 = r150636 - r150637;
        double r150640 = r150638 * r150639;
        return r150640;
}

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)))