Question: Very constrained minimization. Possible or not?

So, I have to minimize only one variable, but with totally insane constraints. For simplicity, I want to solve it only for n=4 and specific graph, so it will be a little bit easier than described below.

1n is a column of "1".
So, is it possible at all? I spent almost 5 hours, tried everything that is possible to google, but still can't run it. Here is what I've done(as 'D' is reserved, I used 'B' instead):

so it will look like:

so it will look like:

so it will look like:

so it will look like:

Error, (in Cons1) cannot determine if this expression is true or false: -Re(w1+w2+w3) < 1 and -Re(w1*w2+w1*w3+w1*w4+w1*w5+w2*w4+w2*w5+w3*w4+w3*w5+4*w1+w2+w3+w4+w5) < 0 and -Re(w1*w2*w3+w1*w2*w5+w1*w2*w6+w1*w3*w4+w1*w3*w6+w1*w4*w5+w1*w4*w6+w1*w5*w6+w2*w3*w4+w2*w3*w5+w2*w4*w5+w2*w4*w6+w2*w5*w6+w3*w4*w5+w3*w4*w6+w3*w5*w6+9*w1*w2+w1*w3+9*w1*w4+w1*w5+4*w1*w6+w2*w3+9*w2*w4+4*w2*w5+w2*w6+4*w3*w4+w3*w5+w3*w6+w4*w5+w4*w6+w5*w6) < 0 and -Re(w1*w2*w3+w1*w2*w5+w1*w2*w6+w1*w3*w4+w1*w3*w6+w1*w4*w5+w1*w4*w6+w1*w5*w6+w2*w3*w4+w2*w3*w5+w2*w4*w5+w2*w4*w6+w2*w5*w6+w3*w4*w5+w3*w4*w6+w3*w5*w6) < 0


P.S.: All functions work when I call them with specific arguments. Please help me.