Average Error: 0.0 → 0.0
Time: 4.6s
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 r139930 = x;
        double r139931 = y;
        double r139932 = r139930 + r139931;
        double r139933 = r139930 - r139931;
        double r139934 = r139932 * r139933;
        return r139934;
}
↓
double f(double x, double y) {
        double r139935 = x;
        double r139936 = y;
        double r139937 = r139935 + r139936;
        double r139938 = r139935 - r139936;
        double r139939 = r139937 * r139938;
        return r139939;
}

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