Average Error: 0.0 → 0.0
Time: 597.0ms
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 r201643 = x;
        double r201644 = y;
        double r201645 = r201643 + r201644;
        double r201646 = r201643 - r201644;
        double r201647 = r201645 * r201646;
        return r201647;
}
↓
double f(double x, double y) {
        double r201648 = x;
        double r201649 = y;
        double r201650 = r201648 + r201649;
        double r201651 = r201648 - r201649;
        double r201652 = r201650 * r201651;
        return r201652;
}

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