suite

% there should be exactly one way to produce the answer here
% (as opposed to two) - the idea is that GenI enforces the
% condition that only trees with empty subst nodes list may
% subst up
abc semantics:[a() b() t1()]
sub semantics:[b() t1()]

% adjunction 
adj semantics:[t1() xg()]
adj-nepas semantics:[t1() xnepas()]
adj-multi semantics:[t1() xg() xg2()]

% kidsToParents rule
k2p         semantics:[t1() d()]
k2p-trivial semantics:[k2p()]

% this should still work
iaf-killer-good semantics:[t1(x) t2(x) iaf(x)]

tb-success   semantics:[eg()]

aconstr-with-anchor semantics:[aconstr-with-anchor()]

tb-noadj-good-1 semantics:[tb-unification-noadj() no-thing()]
tb-noadj-good-2 semantics:[tb-unification-noadj() thing-good()]
tb-unification-1 semantics:[tb-unification-bot()]
tb-unification-2 semantics:[tb-unification-bot() tb-unification-adj()]

lemanchor semantics:[lemanchor()]