Average Error: 0.0 → 0.0
Time: 5.8s
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 r133039 = x;
        double r133040 = y;
        double r133041 = r133039 + r133040;
        double r133042 = r133039 - r133040;
        double r133043 = r133041 * r133042;
        return r133043;
}
↓
double f(double x, double y) {
        double r133044 = x;
        double r133045 = y;
        double r133046 = r133044 + r133045;
        double r133047 = r133044 - r133045;
        double r133048 = r133046 * r133047;
        return r133048;
}

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