Average Error: 0.0 → 0.0
Time: 6.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 r130746 = x;
        double r130747 = y;
        double r130748 = r130746 + r130747;
        double r130749 = r130746 - r130747;
        double r130750 = r130748 * r130749;
        return r130750;
}
↓
double f(double x, double y) {
        double r130751 = x;
        double r130752 = y;
        double r130753 = r130751 + r130752;
        double r130754 = r130751 - r130752;
        double r130755 = r130753 * r130754;
        return r130755;
}

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