Average Error: 0.0 → 0.0
Time: 667.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 r195700 = x;
        double r195701 = y;
        double r195702 = r195700 + r195701;
        double r195703 = r195700 - r195701;
        double r195704 = r195702 * r195703;
        return r195704;
}
↓
double f(double x, double y) {
        double r195705 = x;
        double r195706 = y;
        double r195707 = r195705 + r195706;
        double r195708 = r195705 - r195706;
        double r195709 = r195707 * r195708;
        return r195709;
}

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