Average Error: 0.0 → 0.0
Time: 599.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 r163750 = x;
        double r163751 = y;
        double r163752 = r163750 + r163751;
        double r163753 = r163750 - r163751;
        double r163754 = r163752 * r163753;
        return r163754;
}
↓
double f(double x, double y) {
        double r163755 = x;
        double r163756 = y;
        double r163757 = r163755 + r163756;
        double r163758 = r163755 - r163756;
        double r163759 = r163757 * r163758;
        return r163759;
}

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