Average Error: 0.0 → 0.0
Time: 10.5s
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 r118678 = x;
        double r118679 = y;
        double r118680 = r118678 + r118679;
        double r118681 = r118678 - r118679;
        double r118682 = r118680 * r118681;
        return r118682;
}
↓
double f(double x, double y) {
        double r118683 = x;
        double r118684 = y;
        double r118685 = r118683 + r118684;
        double r118686 = r118683 - r118684;
        double r118687 = r118685 * r118686;
        return r118687;
}

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