Average Error: 0.0 → 0.0
Time: 866.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 r201770 = x;
        double r201771 = y;
        double r201772 = r201770 + r201771;
        double r201773 = r201770 - r201771;
        double r201774 = r201772 * r201773;
        return r201774;
}
↓
double f(double x, double y) {
        double r201775 = x;
        double r201776 = y;
        double r201777 = r201775 + r201776;
        double r201778 = r201775 - r201776;
        double r201779 = r201777 * r201778;
        return r201779;
}

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