Is there a way to program this:

I have to write an equation like this (x1+x2)*(x1+x3)*(x2+x3)=0. Left side is a combination, k=2 and n=3 so the number of terms is 3. For small number of terms this is not a problem to type, but if I have x1,x2,x3,x4,x5,x6, the number of combinations is 15 so it is complicated. Is there a way how to program something like this in Maple or I have to do it manually?

Thanks!

Can I create a Groebner basis in Maple with system of inequalities and how should I do that?

For example: I have problem with 30 inequlities (all have to be binary {0,1}) and all inequalities are >=1 but if I put

F := [x1+x2+x3-1, x1+x5+x7-1 etc]; and after that I create Groebner basis, I get that system has no solutions, but I know it has. 

Thank you in advance!