Average Error: 0.0 → 0.0
Time: 616.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 r146712 = x;
        double r146713 = y;
        double r146714 = r146712 + r146713;
        double r146715 = r146712 - r146713;
        double r146716 = r146714 * r146715;
        return r146716;
}
↓
double f(double x, double y) {
        double r146717 = x;
        double r146718 = y;
        double r146719 = r146717 + r146718;
        double r146720 = r146717 - r146718;
        double r146721 = r146719 * r146720;
        return r146721;
}

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