I think having a positive score all it requires to gain DT2. Mathematically 0 is neither positive nor negative but I think in computer language it considers as positive. So when the score after at least an inclusion and exclusion from two DT1 executes, the algorithm considers it positive. The user gains DT2. Hopefully I get your explanation correct. But I will consider x >=1 not x>=0. Right now it must be x>=0.
According to Bpip you have a net score of +4 inclusions. Just to eliminate any confusion; for Claire to be on DT2 at least one DT1 member must have her included. But, if one includes Claire and one excludes he, she will remain on DT2 even though her net inclusions is 0.
I am of the opinion that a net score of +2 should be required for inclusion to DT2. So, for Claire to be included in DT2, at least two DT1 members would need to include her. If one DT1 member excludes Claire, she would need a total of three inclusions to be on DT2. I think this would reduce the Trust System spam that is so common today. It would also reduce the potential for trust system cliques from developing.
I did at least two and a net of one.
although your net +2 is a tad stricter. I would think either one is better than current set of rules.
so far everyone voted for eith of the two above.