Average Error: 0.0 → 0.0
Time: 659.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 r177608 = x;
        double r177609 = y;
        double r177610 = r177608 + r177609;
        double r177611 = r177608 - r177609;
        double r177612 = r177610 * r177611;
        return r177612;
}
↓
double f(double x, double y) {
        double r177613 = x;
        double r177614 = y;
        double r177615 = r177613 + r177614;
        double r177616 = r177613 - r177614;
        double r177617 = r177615 * r177616;
        return r177617;
}

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