Average Error: 0.0 → 0.0
Time: 5.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 r118313 = x;
        double r118314 = y;
        double r118315 = r118313 + r118314;
        double r118316 = r118313 - r118314;
        double r118317 = r118315 * r118316;
        return r118317;
}
↓
double f(double x, double y) {
        double r118318 = x;
        double r118319 = y;
        double r118320 = r118318 + r118319;
        double r118321 = r118318 - r118319;
        double r118322 = r118320 * r118321;
        return r118322;
}

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