Average Error: 0.0 → 0.0
Time: 2.9s
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 r116397 = x;
        double r116398 = y;
        double r116399 = r116397 + r116398;
        double r116400 = r116397 - r116398;
        double r116401 = r116399 * r116400;
        return r116401;
}
↓
double f(double x, double y) {
        double r116402 = x;
        double r116403 = y;
        double r116404 = r116402 + r116403;
        double r116405 = r116402 - r116403;
        double r116406 = r116404 * r116405;
        return r116406;
}

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