Average Error: 0.0 → 0.0
Time: 5.7s
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 r153512 = x;
        double r153513 = y;
        double r153514 = r153512 + r153513;
        double r153515 = r153512 - r153513;
        double r153516 = r153514 * r153515;
        return r153516;
}
↓
double f(double x, double y) {
        double r153517 = x;
        double r153518 = y;
        double r153519 = r153517 + r153518;
        double r153520 = r153517 - r153518;
        double r153521 = r153519 * r153520;
        return r153521;
}

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