Hilberts Tenth problem and NP-completeness of Boolean Syllogistic with unordered cartesian product

We relate the decidability problem for BS with unordered cartesian product with Hilberts Tenth problem and prove that BS with unordered cartesian product is NP-complete.