Average Error: 0.0 → 0.0
Time: 594.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 r157552 = x;
        double r157553 = y;
        double r157554 = r157552 + r157553;
        double r157555 = r157552 - r157553;
        double r157556 = r157554 * r157555;
        return r157556;
}
↓
double f(double x, double y) {
        double r157557 = x;
        double r157558 = y;
        double r157559 = r157557 + r157558;
        double r157560 = r157557 - r157558;
        double r157561 = r157559 * r157560;
        return r157561;
}

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