Average Error: 0.0 → 0.0
Time: 6.3s
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 r160976 = x;
        double r160977 = y;
        double r160978 = r160976 + r160977;
        double r160979 = r160976 - r160977;
        double r160980 = r160978 * r160979;
        return r160980;
}
↓
double f(double x, double y) {
        double r160981 = x;
        double r160982 = y;
        double r160983 = r160981 + r160982;
        double r160984 = r160981 - r160982;
        double r160985 = r160983 * r160984;
        return r160985;
}

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