Average Error: 0.0 → 0.0
Time: 1.1s
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 r159648 = x;
        double r159649 = y;
        double r159650 = r159648 + r159649;
        double r159651 = r159648 - r159649;
        double r159652 = r159650 * r159651;
        return r159652;
}
↓
double f(double x, double y) {
        double r159653 = x;
        double r159654 = y;
        double r159655 = r159653 + r159654;
        double r159656 = r159653 - r159654;
        double r159657 = r159655 * r159656;
        return r159657;
}

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