Average Error: 0.0 → 0.0
Time: 11.7s
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 r110579 = x;
        double r110580 = y;
        double r110581 = r110579 + r110580;
        double r110582 = r110579 - r110580;
        double r110583 = r110581 * r110582;
        return r110583;
}
↓
double f(double x, double y) {
        double r110584 = x;
        double r110585 = y;
        double r110586 = r110584 + r110585;
        double r110587 = r110584 - r110585;
        double r110588 = r110586 * r110587;
        return r110588;
}

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