Average Error: 0.0 → 0.0
Time: 7.9s
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 r156194 = x;
        double r156195 = y;
        double r156196 = r156194 + r156195;
        double r156197 = r156194 - r156195;
        double r156198 = r156196 * r156197;
        return r156198;
}
↓
double f(double x, double y) {
        double r156199 = x;
        double r156200 = y;
        double r156201 = r156199 + r156200;
        double r156202 = r156199 - r156200;
        double r156203 = r156201 * r156202;
        return r156203;
}

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