Average Error: 0.0 → 0.0
Time: 1.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 r252602 = x;
        double r252603 = y;
        double r252604 = r252602 + r252603;
        double r252605 = r252602 - r252603;
        double r252606 = r252604 * r252605;
        return r252606;
}
↓
double f(double x, double y) {
        double r252607 = x;
        double r252608 = y;
        double r252609 = r252607 + r252608;
        double r252610 = r252607 - r252608;
        double r252611 = r252609 * r252610;
        return r252611;
}

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