Average Error: 0.0 → 0.0
Time: 606.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 r171976 = x;
        double r171977 = y;
        double r171978 = r171976 + r171977;
        double r171979 = r171976 - r171977;
        double r171980 = r171978 * r171979;
        return r171980;
}
↓
double f(double x, double y) {
        double r171981 = x;
        double r171982 = y;
        double r171983 = r171981 + r171982;
        double r171984 = r171981 - r171982;
        double r171985 = r171983 * r171984;
        return r171985;
}

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