Average Error: 0.0 → 0.0
Time: 10.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 r148248 = x;
        double r148249 = y;
        double r148250 = r148248 + r148249;
        double r148251 = r148248 - r148249;
        double r148252 = r148250 * r148251;
        return r148252;
}
↓
double f(double x, double y) {
        double r148253 = x;
        double r148254 = y;
        double r148255 = r148253 + r148254;
        double r148256 = r148253 - r148254;
        double r148257 = r148255 * r148256;
        return r148257;
}

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