Average Error: 0.0 → 0.0
Time: 609.0ms
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 r140519 = x;
        double r140520 = y;
        double r140521 = r140519 + r140520;
        double r140522 = r140519 - r140520;
        double r140523 = r140521 * r140522;
        return r140523;
}
↓
double f(double x, double y) {
        double r140524 = x;
        double r140525 = y;
        double r140526 = r140524 + r140525;
        double r140527 = r140524 - r140525;
        double r140528 = r140526 * r140527;
        return r140528;
}

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