Average Error: 0.0 → 0.0
Time: 1.3s
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 r222685 = x;
        double r222686 = y;
        double r222687 = r222685 + r222686;
        double r222688 = r222685 - r222686;
        double r222689 = r222687 * r222688;
        return r222689;
}
↓
double f(double x, double y) {
        double r222690 = x;
        double r222691 = y;
        double r222692 = r222690 + r222691;
        double r222693 = r222690 - r222691;
        double r222694 = r222692 * r222693;
        return r222694;
}

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