Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids

We prove that the universal theory and the quasi-equational theory of bounded residuated distributive lattice-ordered groupoids are both EXPTIME-complete. Similar results are proven for bounded distributive lattices with a unary or binary operator and for some special classes of bounded residuated distributive lattice-ordered groupoids.