Average Error: 0.0 → 0.0
Time: 5.5s
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 r226623 = x;
        double r226624 = y;
        double r226625 = r226623 + r226624;
        double r226626 = r226623 - r226624;
        double r226627 = r226625 * r226626;
        return r226627;
}
↓
double f(double x, double y) {
        double r226628 = x;
        double r226629 = y;
        double r226630 = r226628 + r226629;
        double r226631 = r226628 - r226629;
        double r226632 = r226630 * r226631;
        return r226632;
}

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