Average Error: 0.0 → 0.0
Time: 632.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 r192618 = x;
        double r192619 = y;
        double r192620 = r192618 + r192619;
        double r192621 = r192618 - r192619;
        double r192622 = r192620 * r192621;
        return r192622;
}
↓
double f(double x, double y) {
        double r192623 = x;
        double r192624 = y;
        double r192625 = r192623 + r192624;
        double r192626 = r192623 - r192624;
        double r192627 = r192625 * r192626;
        return r192627;
}

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