Average Error: 0.0 → 0.0
Time: 697.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 r227615 = x;
        double r227616 = y;
        double r227617 = r227615 + r227616;
        double r227618 = r227615 - r227616;
        double r227619 = r227617 * r227618;
        return r227619;
}
↓
double f(double x, double y) {
        double r227620 = x;
        double r227621 = y;
        double r227622 = r227620 + r227621;
        double r227623 = r227620 - r227621;
        double r227624 = r227622 * r227623;
        return r227624;
}

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