Average Error: 0.0 → 0.0
Time: 826.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 r167206 = x;
        double r167207 = y;
        double r167208 = r167206 + r167207;
        double r167209 = r167206 - r167207;
        double r167210 = r167208 * r167209;
        return r167210;
}
↓
double f(double x, double y) {
        double r167211 = x;
        double r167212 = y;
        double r167213 = r167211 + r167212;
        double r167214 = r167211 - r167212;
        double r167215 = r167213 * r167214;
        return r167215;
}

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