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 r217619 = x;
        double r217620 = y;
        double r217621 = r217619 + r217620;
        double r217622 = r217619 - r217620;
        double r217623 = r217621 * r217622;
        return r217623;
}
↓
double f(double x, double y) {
        double r217624 = x;
        double r217625 = y;
        double r217626 = r217624 + r217625;
        double r217627 = r217624 - r217625;
        double r217628 = r217626 * r217627;
        return r217628;
}

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)))