Average Error: 0.0 → 0.0
Time: 7.8s
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 r194624 = x;
        double r194625 = y;
        double r194626 = r194624 + r194625;
        double r194627 = r194624 - r194625;
        double r194628 = r194626 * r194627;
        return r194628;
}
↓
double f(double x, double y) {
        double r194629 = x;
        double r194630 = y;
        double r194631 = r194629 + r194630;
        double r194632 = r194629 - r194630;
        double r194633 = r194631 * r194632;
        return r194633;
}

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