fixed a bug in paramodulation parsing

git-svn-id: http://gapt.googlecode.com/svn/trunk/source@1395 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
the prover9 formula parsing grammar only accepted -((all X p(X))) but not -(all X p(X)) because the outermost quantifier of a sequence of quantifiers is always put into parenthesis.

git-svn-id: http://gapt.googlecode.com/svn/trunk/source@1396 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Changed decompositions to grammars, implemented Grammar class, completed the commands in CLI to generate a proof with cut step by step, using only FlatTermSet for the term sets now, implemented a function that prints the first decompositions so that the user can choose, adapted CLI help text. Btw, the term extraction algorithm does work for ACNF.

git-svn-id: http://gapt.googlecode.com/svn/trunk/source@1397 85d21ef8-add0-11de-ae77-5bfb9c5a3f34