Average Error: 0.0 → 0.0
Time: 6.3s
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 r195846 = x;
        double r195847 = y;
        double r195848 = r195846 + r195847;
        double r195849 = r195846 - r195847;
        double r195850 = r195848 * r195849;
        return r195850;
}
↓
double f(double x, double y) {
        double r195851 = x;
        double r195852 = y;
        double r195853 = r195851 + r195852;
        double r195854 = r195851 - r195852;
        double r195855 = r195853 * r195854;
        return r195855;
}

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