words 349524 printed-Tree true 638 printed-vs-grammar mismatches 136
Gemini 'Tree' true on 2 words
Gemini 'MultiTree' leaf clause true on 2 of 638 printed trees (true only when no RBracket follows a node, i.e. single-node trees: 2 )
printed Father vs stack fathers, bad: 248
Gemini i=1 case: Subseq(w,2,1) = [] Balanced: True ; printed Tree([2]) = True
Depth(i,w) != NetB(w,1,i) at node positions: 0
Lemma TE cases 6156 failures 0
MISMATCH [2, 1, 2, 0, 1, 2, 0] printed=True grammar=False
MISMATCH [2, 1, 2, 0, 1, 3, 0] printed=True grammar=False
MISMATCH [2, 1, 3, 0, 1, 2, 0] printed=True grammar=False
MISMATCH [2, 1, 3, 0, 1, 3, 0] printed=True grammar=False
MISMATCH [3, 1, 2, 0, 1, 2, 0] printed=True grammar=False
MISMATCH [3, 1, 2, 0, 1, 3, 0] printed=True grammar=False
MISMATCH [3, 1, 3, 0, 1, 2, 0] printed=True grammar=False
MISMATCH [3, 1, 3, 0, 1, 3, 0] printed=True grammar=False
MISMATCH [2, 1, 2, 0, 1, 2, 2, 0] printed=True grammar=False
MISMATCH [2, 1, 2, 0, 1, 2, 3, 0] printed=True grammar=False
