Average Error: 0.0 → 0.0
Time: 675.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 r214431 = x;
        double r214432 = y;
        double r214433 = r214431 + r214432;
        double r214434 = r214431 - r214432;
        double r214435 = r214433 * r214434;
        return r214435;
}
↓
double f(double x, double y) {
        double r214436 = x;
        double r214437 = y;
        double r214438 = r214436 + r214437;
        double r214439 = r214436 - r214437;
        double r214440 = r214438 * r214439;
        return r214440;
}

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