581$ python3 bfswp.py --pos v -d3 mend tear
11:06:47
No. of combinations to check: 10
Found at distance 4 (13604 nodes expanded)
Found at distance 4 (14302 nodes expanded)
Found at distance 4 (14307 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 4 (3241 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 5 and 100228 nodes expanded)
Not found (distance 6 and 100003 nodes expanded)
Not found (distance 5 and 100228 nodes expanded)
Not found (distance 6 and 100003 nodes expanded)
Not found (distance 6 and 100003 nodes expanded)
Not found (distance 5 and 100228 nodes expanded)
Not found (distance 6 and 100003 nodes expanded)
Longest shortest is 6
Total time: 5 (s)
tear.v.01 deriv_related rupture.n.03 hyponyms breakage.n.03 deriv_related break.v.04 antonyms repair.v.01 
tear.v.01 hyponyms separate.v.02 hypernyms sever.v.01 also_sees break.v.04 antonyms repair.v.01 
tear.v.02 hyponyms separate.v.02 hypernyms sever.v.01 also_sees break.v.04 antonyms repair.v.01 
tear.v.05 deriv_related lacrimation.n.01 hyponyms bodily_process.n.01 hypernyms healing.n.01 deriv_related mend.v.02 
581$ python3 bfswp.py --pos a -d3 clean dirty 
11:11:53
No. of combinations to check: 216
Found at distance 1 (1 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 3 (17 nodes expanded)
Found at distance 4 (186 nodes expanded)
Found at distance 4 (188 nodes expanded)
Found at distance 4 (242 nodes expanded)
Found at distance 4 (244 nodes expanded)
Found at distance 3 (36 nodes expanded)
Found at distance 3 (50 nodes expanded)
Found at distance 3 (79 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 3 (72 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 4 (454 nodes expanded)
Found at distance 4 (456 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 6 (18062 nodes expanded)
Found at distance 6 (22228 nodes expanded)
Found at distance 6 (43193 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Found at distance 6 (38658 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100201 nodes expanded)
Not found (distance 7 and 100201 nodes expanded)
Not found (distance 7 and 100201 nodes expanded)
Not found (distance 7 and 100201 nodes expanded)
Found at distance 4 (1966 nodes expanded)
Not found (distance 5 and 100002 nodes expanded)
Found at distance 4 (3720 nodes expanded)
Not found (distance 7 and 100201 nodes expanded)
Found at distance 4 (5474 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 5 and 100002 nodes expanded)
Not found (distance 7 and 100201 nodes expanded)
Not found (distance 5 and 100002 nodes expanded)
Not found (distance 5 and 100002 nodes expanded)
Not found (distance 5 and 100002 nodes expanded)
Not found (distance 5 and 100002 nodes expanded)
Found at distance 3 (37 nodes expanded)
Found at distance 3 (38 nodes expanded)
Not found (distance 5 and 100002 nodes expanded)
Found at distance 3 (45 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 3 (43 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 3 (36 nodes expanded)
Found at distance 4 (237 nodes expanded)
Found at distance 4 (239 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 5 and 100002 nodes expanded)
Not found (distance 5 and 100002 nodes expanded)
Found at distance 6 (15626 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 5 and 100002 nodes expanded)
Not found (distance 5 and 100002 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Found at distance 6 (20161 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Found at distance 3 (17 nodes expanded)
Found at distance 3 (18 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100001 nodes expanded)
Found at distance 4 (61 nodes expanded)
Not found (distance 7 and 100001 nodes expanded)
Found at distance 4 (214 nodes expanded)
Found at distance 3 (16 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 4 (48 nodes expanded)
Found at distance 4 (50 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100001 nodes expanded)
Not found (distance 7 and 100001 nodes expanded)
Found at distance 6 (19407 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100001 nodes expanded)
Found at distance 6 (2977 nodes expanded)
Not found (distance 7 and 100001 nodes expanded)
Found at distance 3 (17 nodes expanded)
Found at distance 3 (46 nodes expanded)
Found at distance 3 (47 nodes expanded)
Not found (distance 7 and 100015 nodes expanded)
Not found (distance 7 and 100015 nodes expanded)
Found at distance 3 (54 nodes expanded)
Search space complete
Search space complete
DiGraph with 0 nodes and 0 edges
DiGraph with 0 nodes and 0 edges
Found at distance 1 (1 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 3 (45 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 4 (327 nodes expanded)
Found at distance 4 (329 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100015 nodes expanded)
Not found (distance 7 and 100015 nodes expanded)
Not found (distance 7 and 100015 nodes expanded)
Not found (distance 7 and 100015 nodes expanded)
Found at distance 6 (30190 nodes expanded)
Not found (distance 7 and 100178 nodes expanded)
Not found (distance 7 and 100178 nodes expanded)
Not found (distance 7 and 100178 nodes expanded)
Found at distance 1 (1 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 6 (34725 nodes expanded)
Found at distance 5 (85 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Search space complete
DiGraph with 0 nodes and 0 edges
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100178 nodes expanded)
Not found (distance 7 and 100178 nodes expanded)
Not found (distance 7 and 100178 nodes expanded)
Not found (distance 9 and 100001 nodes expanded)
Not found (distance 9 and 100001 nodes expanded)
Not found (distance 9 and 100001 nodes expanded)
Found at distance 3 (28 nodes expanded)
Found at distance 3 (29 nodes expanded)
Found at distance 3 (36 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 9 and 100001 nodes expanded)
Found at distance 8 (19111 nodes expanded)
Found at distance 8 (19120 nodes expanded)
Not found (distance 9 and 100001 nodes expanded)
Found at distance 3 (34 nodes expanded)
Search space complete
Search space complete
DiGraph with 0 nodes and 0 edges
DiGraph with 0 nodes and 0 edges
Not found (distance 9 and 100001 nodes expanded)
Found at distance 3 (27 nodes expanded)
Not found (distance 9 and 100001 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 4 (209 nodes expanded)
Found at distance 4 (211 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 9 and 100001 nodes expanded)
Found at distance 6 (15099 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 6 (19634 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 6 (7059 nodes expanded)
Found at distance 6 (7060 nodes expanded)
Not found (distance 9 and 100001 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100002 nodes expanded)
Not found (distance 7 and 100002 nodes expanded)
Found at distance 6 (9658 nodes expanded)
Found at distance 6 (7058 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100002 nodes expanded)
Not found (distance 7 and 100002 nodes expanded)
Not found (distance 7 and 100002 nodes expanded)
Not found (distance 7 and 100002 nodes expanded)
Found at distance 6 (14691 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Found at distance 7 (61819 nodes expanded)
Not found (distance 1 and 0 nodes expanded)
Found at distance 7 (61821 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Found at distance 6 (6668 nodes expanded)
Found at distance 6 (6669 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100000 nodes expanded)
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100000 nodes expanded)
Found at distance 6 (9267 nodes expanded)
Found at distance 6 (6667 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100000 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100000 nodes expanded)
Found at distance 6 (14300 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 7 (58441 nodes expanded)
Found at distance 7 (58443 nodes expanded)
Not found (distance 7 and 100001 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Not found (distance 7 and 100001 nodes expanded)
Found at distance 6 (7059 nodes expanded)
Found at distance 6 (7060 nodes expanded)
DiGraph with 0 nodes and 0 edges
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100001 nodes expanded)
Not found (distance 7 and 100001 nodes expanded)
Found at distance 6 (9658 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Found at distance 6 (7058 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100001 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Found at distance 6 (14691 nodes expanded)
Found at distance 7 (61819 nodes expanded)
Found at distance 7 (61821 nodes expanded)
Search space complete
DiGraph with 0 nodes and 0 edges
Not found (distance 7 and 100001 nodes expanded)
Not found (distance 7 and 100001 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
DiGraph with 0 nodes and 0 edges
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Search space complete
Not found (distance 1 and 0 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Not found (distance 7 and 100000 nodes expanded)
Longest shortest is 9
Total time: 38 (s)
dirty.a.01 antonyms clean.a.01 
dirty.a.04 deriv_related dirt.n.02 deriv_related dirty.a.01 antonyms clean.a.01 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 deriv_related dirty.a.01 antonyms clean.a.01 
dirty.s.03 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 deriv_related dirty.a.01 antonyms clean.a.01 
dirty.s.03 
dirty.s.02 deriv_related dirtiness.n.01 deriv_related dirty.a.01 antonyms clean.a.01 
dirty.s.02 deriv_related dirtiness.n.01 deriv_related dirty.a.01 antonyms clean.a.01 
dirty.a.04 antonyms clean.a.07 deriv_related cleanness.n.01 deriv_related clean.a.01 
dirty.s.02 deriv_related dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.a.01 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.a.01 
dirty.s.03 
dirty.s.08 deriv_related baseness.n.01 deriv_related seamy.s.02 deriv_related sordidness.n.01 hyponyms dirtiness.n.01 deriv_related dirty.a.01 antonyms clean.a.01 
dirty.s.08 deriv_related baseness.n.01 deriv_related seamy.s.02 deriv_related sordidness.n.01 hyponyms dirtiness.n.01 deriv_related dirty.a.01 antonyms clean.a.01 
dirty.s.08 deriv_related baseness.n.01 deriv_related seamy.s.02 deriv_related sordidness.n.01 hyponyms dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.a.01 
cheating.s.02 deriv_related foulness.n.01 hyponyms iniquity.n.01 hyponyms condition.n.01 hypernyms sanitary_condition.n.01 hypernyms cleanness.n.01 deriv_related clean.a.01 
dirty.s.03 deriv_related cloudiness.n.03 hyponyms opacity.n.03 antonyms clearness.n.02 deriv_related clean.s.02 
dirty.s.03 deriv_related cloudiness.n.03 hyponyms opacity.n.03 antonyms clearness.n.02 deriv_related clean.s.02 
dirty.s.03 deriv_related cloudiness.n.03 hyponyms opacity.n.03 antonyms clearness.n.02 deriv_related clean.s.02 
dirty.a.01 deriv_related dirty.a.01 deriv_related dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.s.03 
dirty.a.01 
dirty.a.01 antonyms clean.a.01 deriv_related cleanness.n.01 deriv_related clean.s.03 
dirty.a.04 antonyms clean.a.07 deriv_related cleanness.n.01 deriv_related clean.s.03 
dirty.s.02 deriv_related dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.s.03 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.s.03 
dirty.s.03 
cheating.s.02 deriv_related foulness.n.01 hyponyms iniquity.n.01 hyponyms condition.n.01 hypernyms sanitary_condition.n.01 hypernyms cleanness.n.01 deriv_related clean.s.03 
dirty.s.08 deriv_related baseness.n.01 deriv_related seamy.s.02 deriv_related sordidness.n.01 hyponyms dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.s.03 
dirty.a.01 deriv_related dirty.a.01 deriv_related dirtiness.n.01 deriv_related unclean.a.02 antonyms clean.a.06 
dirty.a.01 
dirty.a.04 deriv_related dirt.n.02 hyponyms dirtiness.n.01 deriv_related unclean.a.02 antonyms clean.a.06 
dirty.a.04 deriv_related dirtiness.n.02 hyponyms impurity.n.02 deriv_related unclean.a.02 antonyms clean.a.06 
dirty.s.02 deriv_related dirtiness.n.01 deriv_related unclean.a.02 antonyms clean.a.06 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 deriv_related unclean.a.02 antonyms clean.a.06 
dirty.s.03 
cheating.s.02 deriv_related foulness.n.01 hyponyms iniquity.n.01 hyponyms condition.n.01 hypernyms impurity.n.02 deriv_related unclean.a.02 antonyms clean.a.06 
dirty.s.08 deriv_related baseness.n.01 deriv_related seamy.s.02 deriv_related sordidness.n.01 hyponyms dirtiness.n.01 deriv_related unclean.a.02 antonyms clean.a.06 
dirty.a.01 deriv_related dirt.n.02 deriv_related dirty.a.04 antonyms clean.a.07 
dirty.a.01 deriv_related dirty.a.01 deriv_related dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.a.07 
dirty.a.01 
dirty.a.01 antonyms clean.a.01 deriv_related cleanness.n.01 deriv_related clean.a.07 
dirty.a.04 antonyms clean.a.07 
dirty.s.02 deriv_related dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.a.07 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.a.07 
dirty.s.03 
cheating.s.02 deriv_related foulness.n.01 hyponyms iniquity.n.01 hyponyms condition.n.01 hypernyms sanitary_condition.n.01 hypernyms cleanness.n.01 deriv_related clean.a.07 
dirty.a.02 antonyms clean.a.08 
dirty.s.08 deriv_related baseness.n.01 deriv_related seamy.s.02 deriv_related sordidness.n.01 hyponyms dirtiness.n.01 antonyms cleanness.n.01 deriv_related clean.a.07 
dirty.s.01 deriv_related filthiness.n.02 deriv_related cruddy.s.01 deriv_related smuttiness.n.02 deriv_related dirty.a.02 antonyms clean.a.08 
dirty.a.01 deriv_related dirty.a.01 deriv_related dirtiness.n.01 antonyms cleanness.n.01 deriv_related uninfected.s.01 
dirty.a.01 
dirty.a.01 antonyms clean.a.01 deriv_related cleanness.n.01 deriv_related uninfected.s.01 
dirty.s.08 deriv_related baseness.n.01 deriv_related despicable.s.01 deriv_related nefariousness.n.01 hypernyms filthiness.n.02 deriv_related cruddy.s.01 deriv_related smuttiness.n.02 deriv_related dirty.a.02 antonyms clean.a.08 
dirty.s.08 deriv_related baseness.n.01 deriv_related despicable.s.01 deriv_related nefariousness.n.01 hypernyms filthiness.n.02 deriv_related cruddy.s.01 deriv_related smuttiness.n.02 deriv_related dirty.a.02 antonyms clean.a.08 
dirty.a.04 antonyms clean.a.07 deriv_related cleanness.n.01 deriv_related uninfected.s.01 
dirty.s.02 deriv_related dirtiness.n.01 antonyms cleanness.n.01 deriv_related uninfected.s.01 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 antonyms cleanness.n.01 deriv_related uninfected.s.01 
dirty.s.03 
cheating.s.02 deriv_related foulness.n.01 hyponyms iniquity.n.01 hyponyms condition.n.01 hypernyms sanitary_condition.n.01 hypernyms cleanness.n.01 deriv_related uninfected.s.01 
dirty.s.08 deriv_related baseness.n.01 deriv_related seamy.s.02 deriv_related sordidness.n.01 hyponyms dirtiness.n.01 antonyms cleanness.n.01 deriv_related uninfected.s.01 
dirty.a.01 deriv_related dirty.a.01 deriv_related dirtiness.n.01 hyponyms sanitary_condition.n.01 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.06 
dirty.a.01 
dirty.a.04 deriv_related dirtiness.n.02 hyponyms impurity.n.02 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.06 
dirty.s.02 deriv_related dirtiness.n.01 hyponyms sanitary_condition.n.01 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.06 
cheating.s.02 deriv_related foulness.n.01 hyponyms iniquity.n.01 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.06 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 hyponyms sanitary_condition.n.01 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.06 
dirty.s.03 
dirty.a.01 deriv_related dirty.a.01 deriv_related dirtiness.n.01 hyponyms sanitary_condition.n.01 hyponyms condition.n.01 hypernyms emptiness.n.01 hypernyms blankness.n.01 deriv_related blank.s.01 
dirty.a.01 
dirty.a.04 deriv_related dirtiness.n.02 hyponyms impurity.n.02 hyponyms condition.n.01 hypernyms emptiness.n.01 hypernyms blankness.n.01 deriv_related blank.s.01 
dirty.s.02 deriv_related dirtiness.n.01 hyponyms sanitary_condition.n.01 hyponyms condition.n.01 hypernyms emptiness.n.01 hypernyms blankness.n.01 deriv_related blank.s.01 
cheating.s.02 deriv_related foulness.n.01 hyponyms iniquity.n.01 hyponyms condition.n.01 hypernyms emptiness.n.01 hypernyms blankness.n.01 deriv_related blank.s.01 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 hyponyms sanitary_condition.n.01 hyponyms condition.n.01 hypernyms emptiness.n.01 hypernyms blankness.n.01 deriv_related blank.s.01 
dirty.s.03 
dirty.a.01 deriv_related dirty.a.01 deriv_related dirtiness.n.01 hyponyms sanitary_condition.n.01 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.09 
dirty.a.01 
dirty.a.04 deriv_related dirtiness.n.02 hyponyms impurity.n.02 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.09 
dirty.s.02 deriv_related dirtiness.n.01 hyponyms sanitary_condition.n.01 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.09 
cheating.s.02 deriv_related foulness.n.01 hyponyms iniquity.n.01 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.09 
dirty.s.03 deriv_related dirty.s.03 deriv_related dinginess.n.01 hyponyms dirtiness.n.01 hyponyms sanitary_condition.n.01 hyponyms condition.n.01 hypernyms purity.n.02 hypernyms cleanness.n.02 deriv_related clean.s.09 
dirty.s.03 
581$ python3 -i break.py
>>> break_trees
[Tree('S', [Tree('NP-SBJ', [Tree('NP', [Tree('NNP', ['Dr.']), Tree('NNP', ['H.V.']), Tree('NNP', ['Hilprecht'])]), Tree(',', [',']), Tree('NP', [Tree('NP', [Tree('NNP', ['Professor'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('NNP', ['Assyrian'])])]), Tree('PP-LOC', [Tree('IN', ['at']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NNP', ['University'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('NNP', ['Pennsylvania'])])])])])])]), Tree(',', [',']), Tree('VP', [Tree('VBD', ['dreamed']), Tree('SBAR', [Tree('IN', ['that']), Tree('S', [Tree('NP-SBJ', [Tree('NP', [Tree('DT', ['a']), Tree('JJ', ['Babylonian']), Tree('NN', ['priest'])]), Tree(',', [',']), Tree('VP', [Tree('VBN', ['associated']), Tree('NP', [Tree('-NONE-', ['*'])]), Tree('PP', [Tree('IN', ['with']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NN', ['king']), Tree('NNP', ['Kurigalzu'])]), Tree(',', [',']), Tree('PRN', [Tree('-LRB-', ['-LRB-']), Tree('NP-TMP', [Tree('CD', ['1300']), Tree('NN', ['B.C.'])]), Tree('-RRB-', ['-RRB-'])])])])])]), Tree('VP', [Tree('VP', [Tree('VBD', ['escorted']), Tree('NP', [Tree('PRP', ['him'])]), Tree('PP-DIR', [Tree('TO', ['to']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NN', ['treasure']), Tree('NN', ['chamber'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NN', ['temple'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('NNP', ['Bel'])])])])])])])]), Tree(',', [',']), Tree('VP', [Tree('VBD', ['gave']), Tree('NP', [Tree('PRP', ['him'])]), Tree('NP', [Tree('NP', [Tree('CD', ['six']), Tree('JJ', ['novel']), Tree('NNS', ['points'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('NP', [Tree('NN', ['information'])]), Tree('PP', [Tree('IN', ['about']), Tree('NP', [Tree('DT', ['a']), Tree('JJ', ['certain']), Tree('VBN', ['broken']), Tree('NN', ['relic'])])])])])])]), Tree(',', [',']), Tree('CC', ['and']), Tree('VP', [Tree('VBD', ['corrected']), Tree('NP', [Tree('NP', [Tree('DT', ['an']), Tree('NN', ['error'])]), Tree('PP', [Tree('IN', ['in']), Tree('NP', [Tree('PRP$', ['its']), Tree('NN', ['identification'])])])])])])])])]), Tree('.', ['.'])]), Tree('S', [Tree('S', [Tree('NP-SBJ', [Tree('NP', [Tree('DT', ['The']), Tree('NN', ['state']), Tree('POS', ["'s"])]), Tree('NN', ['railroad']), Tree('NN', ['system'])]), Tree('VP', [Tree('VBD', ['counted']), Tree('NP', [Tree('NP', [Tree('NNS', ['miles'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('NP', [Tree('VBN', ['broken']), Tree('NNS', ['bridges'])]), Tree('CC', ['and']), Tree('NP', [Tree('VBG', ['missing']), Tree('JJ', ['rights-of-way'])])])])])])]), Tree(':', [':']), Tree('S', [Tree('NP-SBJ', [Tree('PRP', ['it'])]), Tree('VP', [Tree('MD', ['would']), Tree('ADVP', [Tree('RB', ['obviously'])]), Tree('VP', [Tree('VB', ['remain']), Tree('PP', [Tree('IN', ['out']), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('NN', ['commission'])])])]), Tree('PP-TMP', [Tree('IN', ['for']), Tree('NP', [Tree('NNS', ['weeks'])])])])])]), Tree('.', ['.'])]), Tree('S', [Tree('ADVP-TMP', [Tree('RB', ['Often'])]), Tree(',', [',']), Tree('S-ADV', [Tree('NP-SBJ', [Tree('-NONE-', ['*-1'])]), Tree('VP', [Tree('VBG', ['threading']), Tree('PP-DIR', [Tree('IN', ['through']), Tree('NP', [Tree('DT', ['the']), Tree('NN', ['overcast'])])])])]), Tree(',', [',']), Tree('NP-SBJ-1', [Tree('PRP', ['he'])]), Tree('VP', [Tree('VBD', ['was']), Tree('VP', [Tree('VBN', ['forced']), Tree('S', [Tree('NP-SBJ-2', [Tree('-NONE-', ['*-1'])]), Tree('VP', [Tree('TO', ['to']), Tree('VP', [Tree('VB', ['fly']), Tree('ADVP-LOC', [Tree('RB', ['close']), Tree('PP', [Tree('TO', ['to']), Tree('NP', [Tree('DT', ['the']), Tree('NN', ['ground'])])])]), Tree('S-ADV', [Tree('-NONE-', ['*ICH*-3'])])])])]), Tree('PP', [Tree('IN', ['by']), Tree('NP-LGS', [Tree('DT', ['a']), Tree('JJ', ['low']), Tree('NN', ['ceiling'])])]), Tree(',', [',']), Tree('S-ADV-3', [Tree('NP-SBJ', [Tree('-NONE-', ['*-2'])]), Tree('VP', [Tree('VBG', ['skimming']), Tree('PP-LOC', [Tree('IN', ['above']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NNP', ['Winooski'])]), Tree('CC', ['or']), Tree('NP', [Tree('DT', ['the']), Tree('NNP', ['White']), Tree('NNP', ['River'])])])]), Tree('PP-DIR', [Tree('IN', ['along']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NN', ['line'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('DT', ['the']), Tree('VBN', ['broken']), Tree('NN', ['railroad'])])])])])])])])]), Tree('.', ['.'])]), Tree('S', [Tree('PP-TMP', [Tree('IN', ['At']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NN', ['end'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('DT', ['the']), Tree('VBN', ['calculated']), Tree('NN', ['time'])])])])]), Tree('NP-SBJ-1', [Tree('PRP', ['he'])]), Tree('VP', [Tree('MD', ["'d"]), Tree('VP', [Tree('VP', [Tree('VB', ['nose']), Tree('NP', [Tree('DT', ['the']), Tree('NNP', ['Waco'])]), Tree('PP-DIR', [Tree('RP', ['down']), Tree('PP', [Tree('IN', ['through']), Tree('NP', [Tree('DT', ['the']), Tree('NN', ['cloud']), Tree('NN', ['bank'])])])])]), Tree('CC', ['and']), Tree('VP', [Tree('VB', ['hope']), Tree('S', [Tree('NP-SBJ', [Tree('-NONE-', ['*-1'])]), Tree('VP', [Tree('TO', ['to']), Tree('VP', [Tree('VB', ['break']), Tree('ADVP', [Tree('IN', ['through'])]), Tree('SBAR-LOC', [Tree('WHADVP-2', [Tree('WRB', ['where'])]), Tree('S', [Tree('NP-SBJ', [Tree('NP', [Tree('DT', ['some']), Tree('NN', ['feature'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('DT', ['the']), Tree('NN', ['winter']), Tree('NN', ['landscape'])])])]), Tree('VP', [Tree('MD', ['would']), Tree('VP', [Tree('VB', ['be']), Tree('ADJP-PRD', [Tree('JJ', ['recognizable'])]), Tree('ADVP-LOC', [Tree('-NONE-', ['*T*-2'])])])])])])])])])])])]), Tree('.', ['.'])]),
...
Tree('S', [Tree('S', [Tree('NP-SBJ', [Tree('NNP', ['Michelle'])]), Tree('VP', [Tree('VBZ', ['lives']), Tree('PP-LOC-CLR', [Tree('IN', ['in']), Tree('NP', [Tree('DT', ['a']), Tree('NN', ['hotel']), Tree('NN', ['room'])])])])]), Tree(',', [',']), Tree('CC', ['and']), Tree('S', [Tree('SBAR-ADV', [Tree('IN', ['although']), Tree('S', [Tree('NP-SBJ', [Tree('PRP', ['she'])]), Tree('VP', [Tree('VBZ', ['drives']), Tree('NP', [Tree('DT', ['a']), Tree('JJ', ['canary-colored']), Tree('NNP', ['Porsche'])])])])]), Tree(',', [',']), Tree('NP-SBJ', [Tree('PRP', ['she'])]), Tree('VP', [Tree('VBZ', ['has']), Tree('RB', ["n't"]), Tree('NP', [Tree('NP', [Tree('NN', ['time'])]), Tree('SBAR', [Tree('WHADVP-3', [Tree('-NONE-', ['0'])]), Tree('S', [Tree('NP-SBJ', [Tree('-NONE-', ['*'])]), Tree('VP', [Tree('TO', ['to']), Tree('VP', [Tree('VB', ['clean']), Tree('CC', ['or']), Tree('VB', ['repair']), Tree('NP', [Tree('PRP', ['it'])]), Tree('ADVP-TMP', [Tree('-NONE-', ['*T*-3'])])])])])])])])]), Tree(':', [';']), Tree('S', [Tree('NP-SBJ-1', [Tree('DT', ['the']), Tree('ADJP', [Tree('JJ', ['beat-up'])]), Tree('NN', ['vehicle'])]), Tree('VP', [Tree('MD', ['can']), Tree('VP', [Tree('VB', ['be']), Tree('VP', [Tree('VBN', ['started']), Tree('NP', [Tree('-NONE-', ['*-1'])]), Tree('PP', [Tree('ADVP', [Tree('RB', ['only'])]), Tree('IN', ['with']), Tree('NP', [Tree('NP', [Tree('DT', ['a']), Tree('JJ', ['huge']), Tree('NN', ['pair'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('NNS', ['pliers'])])])])]), Tree('SBAR-PRP', [Tree('IN', ['because']), Tree('S', [Tree('NP-SBJ', [Tree('DT', ['the']), Tree('NN', ['ignition']), Tree('NN', ['key'])]), Tree('VP', [Tree('VBZ', ['has']), Tree('VP', [Tree('VBN', ['broken']), Tree('PRT', [Tree('RP', ['off'])]), Tree('PP-LOC', [Tree('IN', ['in']), Tree('NP', [Tree('DT', ['the']), Tree('NN', ['lock'])])])])])])])])])])]), Tree('.', ['.'])]), Tree('S', [Tree('NP-SBJ', [Tree('DT', ['The']), Tree('JJ', ['first']), Tree('NN', ['episode'])]), Tree('VP', [Tree('VBD', ['concluded']), Tree('PP-CLR', [Tree('IN', ['with']), Tree('NP', [Tree('NP', [Tree('DT', ['a']), Tree('ADJP', [Tree('RB', ['marvelously']), Tree('JJ', ['cute'])]), Tree('NN', ['scene'])]), Tree('SBAR', [Tree('WHPP-2', [Tree('IN', ['in']), Tree('WHNP', [Tree('WDT', ['which'])])]), Tree('S', [Tree('NP-SBJ', [Tree('DT', ['the']), Tree('NN', ['trading-room']), Tree('NN', ['crew'])]), Tree('VP', [Tree('VBD', ['minded']), Tree('NP', [Tree('NP', [Tree('DT', ['a']), Tree('NN', ['baby'])]), Tree(',', [',']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NN', ['casualty'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('NP', [Tree('DT', ['a']), Tree('VBN', ['broken']), Tree('NN', ['marriage'])]), Tree('PP-LOC', [Tree('IN', ['at']), Tree('NP', [Tree('DT', ['the']), Tree('NN', ['firm'])])])])])])]), Tree('PP-LOC', [Tree('-NONE-', ['*T*-2'])])])])])])])]), Tree('.', ['.'])]), Tree('S', [Tree('CC', ['And']), Tree('NP-SBJ-1', [Tree('PRP', ['they'])]), Tree('VP', [Tree('VBP', ['have']), Tree('VP', [Tree('VBN', ['grown']), Tree('PRT', [Tree('RP', ['up'])]), Tree('PP-LOC-CLR', [Tree('IN', ['in']), Tree('NP', [Tree('ADJP', [Tree('RB', ['unprecedentedly']), Tree('JJ', ['grim'])]), Tree('NNS', ['circumstances'])])]), Tree(',', [',']), Tree('PP-LOC-CLR', [Tree('IN', ['among']), Tree('S-NOM', [Tree('NP-SBJ', [Tree('NN', ['family']), Tree('NNS', ['structures'])]), Tree('VP', [Tree('VBG', ['breaking']), Tree('PRT', [Tree('IN', ['down'])])])])]), Tree(',', [',']), Tree('S-ADV', [Tree('NP-SBJ', [Tree('-NONE-', ['*-1'])]), Tree('VP', [Tree('VBN', ['surrounded']), Tree('PP', [Tree('IN', ['by']), Tree('NP', [Tree('NP', [Tree('JJ', ['self-destructive']), Tree('NNS', ['behaviors'])]), Tree('CC', ['and']), Tree('NP', [Tree('JJ', ['bleak']), Tree('NNS', ['prospects'])])])])])])])]), Tree('.', ['.'])]), Tree('S', [Tree('PP-LOC', [Tree('IN', ['Under']), Tree('NP', [Tree('NP', [Tree('DT', ['a']), Tree('NN', ['reform'])]), Tree('VP', [Tree('VBG', ['arising']), Tree('PP-TMP-CLR', [Tree('IN', ['from']), Tree('NP', [Tree('DT', ['the']), Tree('CD', ['1987']), Tree('NN', ['crash'])])])])])]), Tree(',', [',']), Tree('NP-SBJ', [Tree('NP', [Tree('VBG', ['trading'])]), Tree('PP-LOC', [Tree('IN', ['in']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NNP', ['Merc']), Tree('POS', ["'s"])]), Tree('NN', ['stock-index']), Tree('NNS', ['futures'])])])]), Tree('VP', [Tree('MD', ['will']), Tree('VP', [Tree('VB', ['break']), Tree('PP-TMP', [Tree('IN', ['for']), Tree('NP', [Tree('CD', ['10']), Tree('NNS', ['minutes'])])]), Tree('SBAR-ADV', [Tree('IN', ['if']), Tree('S', [Tree('NP-SBJ', [Tree('DT', ['the']), Tree('NN', ['contract'])]), Tree('VP', [Tree('VBZ', ['opens']), Tree('CC', ['and']), Tree('VBZ', ['stays']), Tree('NP-LOC', [Tree('NP', [Tree('NP', [Tree('CD', ['five']), Tree('NNS', ['points'])]), Tree('PP', [Tree('IN', ['from']), Tree('NP', [Tree('NP', [Tree('NNP', ['Friday']), Tree('POS', ["'s"])]), Tree('NN', ['close'])])])]), Tree(',', [',']), Tree('NP', [Tree('NP', [Tree('DT', ['a']), Tree('NN', ['move'])]), Tree('ADJP', [Tree('JJ', ['equal']), Tree('PP', [Tree('TO', ['to']), Tree('NP', [Tree('NP', [Tree('CD', ['40']), Tree('NNS', ['points'])]), Tree('PP-LOC', [Tree('IN', ['on']), Tree('NP', [Tree('DT', ['the']), Tree('NNP', ['Dow']), Tree('NNP', ['Jones']), Tree('NNP', ['Industrial']), Tree('NNP', ['Average'])])])])])])])])])])])])]), Tree('.', ['.'])]), Tree('S', [Tree('CC', ['But']), Tree('NP-SBJ', [Tree('NNP', ['Sen.']), Tree('NNP', ['McCain'])]), Tree('VP', [Tree('VBZ', ['says']), Tree('SBAR', [Tree('-NONE-', ['0']), Tree('S', [Tree('NP-SBJ', [Tree('NNP', ['Mr.']), Tree('NNP', ['Keating'])]), Tree('VP', [Tree('VBD', ['broke']), Tree('PRT', [Tree('RP', ['off'])]), Tree('NP', [Tree('PRP$', ['their']), Tree('NN', ['friendship'])]), Tree('ADVP-MNR', [Tree('RB', ['abruptly'])]), Tree('PP-TMP', [Tree('IN', ['in']), Tree('NP', [Tree('CD', ['1987'])])]), Tree(',', [',']), Tree('SBAR-PRP', [Tree('IN', ['because']), Tree('S', [Tree('NP-SBJ-1', [Tree('DT', ['the']), Tree('NN', ['senator'])]), Tree('VP', [Tree('VBD', ['refused']), Tree('S', [Tree('NP-SBJ', [Tree('-NONE-', ['*-1'])]), Tree('VP', [Tree('TO', ['to']), Tree('VP', [Tree('VB', ['press']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NN', ['thrift']), Tree('NN', ['executive']), Tree('POS', ["'s"])]), Tree('NN', ['case'])]), Tree('ADVP-MNR', [Tree('ADVP', [Tree('RB', ['as']), Tree('RB', ['vigorously'])]), Tree('SBAR', [Tree('IN', ['as']), Tree('S', [Tree('NP-SBJ', [Tree('NNP', ['Mr.']), Tree('NNP', ['Keating'])]), Tree('VP', [Tree('VBD', ['wanted']), Tree('S', [Tree('-NONE-', ['*?*'])])])])])])])])])])])])])])])]), Tree('.', ['.'])])]
>>> len(break_trees)
244
>>> for t in break_trees:
...     for st in t.subtrees():
...             if not isinstance(st, str):
...                     for i in range(len(st)):
...                             if st[i].label().startswith('VB'):
...                                     if len(st[i]) == 1:
...                                             if st[i][0] in verbforms:
...                                                     print(st)
... 
Traceback (most recent call last):
  File "<stdin>", line 5, in <module>
AttributeError: 'str' object has no attribute 'label'
>>> for t in break_trees:
...     for st in t.subtrees():
...             if not isinstance(st, str):
...                     for i in range(len(st)):
...                             if not isinstance(st[i], str):
...                                     if st[i].label().startswith('VB'):
...                                             if len(st[i]) == 1:
...                                                     print(st)
... 
(VP
  (VBD dreamed)
  (SBAR
    (IN that)
    (S
      (NP-SBJ
        (NP (DT a) (JJ Babylonian) (NN priest))
        (, ,)
        (VP
          (VBN associated)
          (NP (-NONE- *))
          (PP
            (IN with)
            (NP
              (NP (DT the) (NN king) (NNP Kurigalzu))
              (, ,)
              (PRN
                (-LRB- -LRB-)
                (NP-TMP (CD 1300) (NN B.C.))
                (-RRB- -RRB-))))))
      (VP
        (VP
          (VBD escorted)
          (NP (PRP him))
          (PP-DIR
            (TO to)
            (NP
              (NP (DT the) (NN treasure) (NN chamber))
              (PP
                (IN of)
                (NP
                  (NP (DT the) (NN temple))
                  (PP (IN of) (NP (NNP Bel))))))))
        (, ,)
        (VP
          (VBD gave)
          (NP (PRP him))
          (NP
            (NP (CD six) (JJ novel) (NNS points))
            (PP
              (IN of)
              (NP
                (NP (NN information))
                (PP
                  (IN about)
                  (NP (DT a) (JJ certain) (VBN broken) (NN relic)))))))
        (, ,)
        (CC and)
        (VP
          (VBD corrected)
          (NP
            (NP (DT an) (NN error))
            (PP (IN in) (NP (PRP$ its) (NN identification)))))))))
...      
(VP (VBG breaking) (NP (JJ big) (NNS stories)))
(VP
  (VBN broken)
  (PRT (RP off))
  (PP-LOC (IN in) (NP (DT the) (NN lock))))
(NP (DT a) (VBN broken) (NN marriage))
(VP (VBG breaking) (PRT (IN down)))
(VP
  (VB break)
  (PP-TMP (IN for) (NP (CD 10) (NNS minutes)))
  (SBAR-ADV
    (IN if)
    (S
      (NP-SBJ (DT the) (NN contract))
      (VP
        (VBZ opens)
        (CC and)
        (VBZ stays)
        (NP-LOC
          (NP
            (NP (CD five) (NNS points))
            (PP (IN from) (NP (NP (NNP Friday) (POS 's)) (NN close))))
          (, ,)
          (NP
            (NP (DT a) (NN move))
            (ADJP
              (JJ equal)
              (PP
                (TO to)
                (NP
                  (NP (CD 40) (NNS points))
                  (PP-LOC
                    (IN on)
                    (NP
                      (DT the)
                      (NNP Dow)
                      (NNP Jones)
                      (NNP Industrial)
                      (NNP Average))))))))))))
(VP
  (VBD broke)
  (PRT (RP off))
  (NP (PRP$ their) (NN friendship))
  (ADVP-MNR (RB abruptly))
  (PP-TMP (IN in) (NP (CD 1987)))
  (, ,)
  (SBAR-PRP
    (IN because)
    (S
      (NP-SBJ-1 (DT the) (NN senator))
      (VP
        (VBD refused)
        (S
          (NP-SBJ (-NONE- *-1))
          (VP
            (TO to)
            (VP
              (VB press)
              (NP
                (NP (DT the) (NN thrift) (NN executive) (POS 's))
                (NN case))
              (ADVP-MNR
                (ADVP (RB as) (RB vigorously))
                (SBAR
                  (IN as)
                  (S
>>>                 (NP-SBJ (NNP Mr.) (NNP Keating))

        print(st)                                  

>>> break_vfs = []
>>> for t in break_trees:
...     for st in t.subtrees():
...             if not isinstance(st, str):
...                     for i in range(len(st)):
...                             if not isinstance(st[i], str):
...                                     if st[i].label().startswith('VB'):      ...                                             if len(st[i]) == 1:             ...                                                     if st[i][0] in verbforms:
...                                                             if st.label().startswith('VP'):
...                                                                     break_vfs.append(st)
... 
>>> len(break_vfs)
224
>>> break_vfs[0]
Tree('VP', [Tree('VB', ['break']), Tree('ADVP', [Tree('IN', ['through'])]), Tree('SBAR-LOC', [Tree('WHADVP-2', [Tree('WRB', ['where'])]), Tree('S', [Tree('NP-SBJ', [Tree('NP', [Tree('DT', ['some']), Tree('NN', ['feature'])]), Tree('PP', [Tree('IN', ['of']), Tree('NP', [Tree('DT', ['the']), Tree('NN', ['winter']), Tree('NN', ['landscape'])])])]), Tree('VP', [Tree('MD', ['would']), Tree('VP', [Tree('VB', ['be']), Tree('ADJP-PRD', [Tree('JJ', ['recognizable'])]), Tree('ADVP-LOC', [Tree('-NONE-', ['*T*-2'])])])])])])])
>>> break_vfs[-1]
Tree('VP', [Tree('VBD', ['broke']), Tree('PRT', [Tree('RP', ['off'])]), Tree('NP', [Tree('PRP$', ['their']), Tree('NN', ['friendship'])]), Tree('ADVP-MNR', [Tree('RB', ['abruptly'])]), Tree('PP-TMP', [Tree('IN', ['in']), Tree('NP', [Tree('CD', ['1987'])])]), Tree(',', [',']), Tree('SBAR-PRP', [Tree('IN', ['because']), Tree('S', [Tree('NP-SBJ-1', [Tree('DT', ['the']), Tree('NN', ['senator'])]), Tree('VP', [Tree('VBD', ['refused']), Tree('S', [Tree('NP-SBJ', [Tree('-NONE-', ['*-1'])]), Tree('VP', [Tree('TO', ['to']), Tree('VP', [Tree('VB', ['press']), Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('NN', ['thrift']), Tree('NN', ['executive']), Tree('POS', ["'s"])]), Tree('NN', ['case'])]), Tree('ADVP-MNR', [Tree('ADVP', [Tree('RB', ['as']), Tree('RB', ['vigorously'])]), Tree('SBAR', [Tree('IN', ['as']), Tree('S', [Tree('NP-SBJ', [Tree('NNP', ['Mr.']), Tree('NNP', ['Keating'])]), Tree('VP', [Tree('VBD', ['wanted']), Tree('S', [Tree('-NONE-', ['*?*'])])])])])])])])])])])])])
>>>