Average Error: 0.0 → 0.0
Time: 687.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 r181770 = x;
        double r181771 = y;
        double r181772 = r181770 + r181771;
        double r181773 = r181770 - r181771;
        double r181774 = r181772 * r181773;
        return r181774;
}
↓
double f(double x, double y) {
        double r181775 = x;
        double r181776 = y;
        double r181777 = r181775 + r181776;
        double r181778 = r181775 - r181776;
        double r181779 = r181777 * r181778;
        return r181779;
}

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