Average Error: 0.0 → 0.0
Time: 3.0s
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 r129199 = x;
        double r129200 = y;
        double r129201 = r129199 + r129200;
        double r129202 = r129199 - r129200;
        double r129203 = r129201 * r129202;
        return r129203;
}
↓
double f(double x, double y) {
        double r129204 = x;
        double r129205 = y;
        double r129206 = r129204 + r129205;
        double r129207 = r129204 - r129205;
        double r129208 = r129206 * r129207;
        return r129208;
}

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