Average Error: 0.0 → 0.0
Time: 1.2s
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 r144381 = x;
        double r144382 = y;
        double r144383 = r144381 + r144382;
        double r144384 = r144381 - r144382;
        double r144385 = r144383 * r144384;
        return r144385;
}
↓
double f(double x, double y) {
        double r144386 = x;
        double r144387 = y;
        double r144388 = r144386 + r144387;
        double r144389 = r144386 - r144387;
        double r144390 = r144388 * r144389;
        return r144390;
}

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