Average Error: 0.0 → 0.0
Time: 1.5s
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 r156374 = x;
        double r156375 = y;
        double r156376 = r156374 + r156375;
        double r156377 = r156374 - r156375;
        double r156378 = r156376 * r156377;
        return r156378;
}
↓
double f(double x, double y) {
        double r156379 = x;
        double r156380 = y;
        double r156381 = r156379 + r156380;
        double r156382 = r156379 - r156380;
        double r156383 = r156381 * r156382;
        return r156383;
}

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