Average Error: 0.0 → 0.0
Time: 1.7s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[x \cdot y + z \cdot t\]
x \cdot y + z \cdot t
↓
x \cdot y + z \cdot t
double f(double x, double y, double z, double t) {
        double r159759 = x;
        double r159760 = y;
        double r159761 = r159759 * r159760;
        double r159762 = z;
        double r159763 = t;
        double r159764 = r159762 * r159763;
        double r159765 = r159761 + r159764;
        return r159765;
}
↓
double f(double x, double y, double z, double t) {
        double r159766 = x;
        double r159767 = y;
        double r159768 = r159766 * r159767;
        double r159769 = z;
        double r159770 = t;
        double r159771 = r159769 * r159770;
        double r159772 = r159768 + r159771;
        return r159772;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + z \cdot t\]

  2. Final simplification0.0

    \[\leadsto x \cdot y + z \cdot t\]

Reproduce

herbie shell --seed 2020039 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))