Average Error: 0.0 → 0.0
Time: 3.9s
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 r243543 = x;
        double r243544 = y;
        double r243545 = r243543 + r243544;
        double r243546 = r243543 - r243544;
        double r243547 = r243545 * r243546;
        return r243547;
}
↓
double f(double x, double y) {
        double r243548 = x;
        double r243549 = y;
        double r243550 = r243548 + r243549;
        double r243551 = r243548 - r243549;
        double r243552 = r243550 * r243551;
        return r243552;
}

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