Average Error: 0.0 → 0.0
Time: 670.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 r219911 = x;
        double r219912 = y;
        double r219913 = r219911 + r219912;
        double r219914 = r219911 - r219912;
        double r219915 = r219913 * r219914;
        return r219915;
}
↓
double f(double x, double y) {
        double r219916 = x;
        double r219917 = y;
        double r219918 = r219916 + r219917;
        double r219919 = r219916 - r219917;
        double r219920 = r219918 * r219919;
        return r219920;
}

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