Average Error: 0.0 → 0.0
Time: 595.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 r189982 = x;
        double r189983 = y;
        double r189984 = r189982 + r189983;
        double r189985 = r189982 - r189983;
        double r189986 = r189984 * r189985;
        return r189986;
}
↓
double f(double x, double y) {
        double r189987 = x;
        double r189988 = y;
        double r189989 = r189987 + r189988;
        double r189990 = r189987 - r189988;
        double r189991 = r189989 * r189990;
        return r189991;
}

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