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 r776897 = x;
        double r776898 = y;
        double r776899 = r776897 + r776898;
        double r776900 = r776897 - r776898;
        double r776901 = r776899 * r776900;
        return r776901;
}
↓
double f(double x, double y) {
        double r776902 = x;
        double r776903 = y;
        double r776904 = r776902 + r776903;
        double r776905 = r776902 - r776903;
        double r776906 = r776904 * r776905;
        return r776906;
}

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