setting the Martin's read endsequent from refutation as the default behaviour



git-svn-id: http://gapt.googlecode.com/svn/trunk/source@1411 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Small change in prooftool to show dbindex of bound variables.

git-svn-id: http://gapt.googlecode.com/svn/trunk/source@1412 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
- removed the default option to read endsequent from resproof
- returned variable renaming and apply contractions also on the clause in the projections.
- still has a problem with proofs where the theorem is in CNF already as then none of the variables instantiated is bound. can it be that we need to universally quantifies over this variables?


git-svn-id: http://gapt.googlecode.com/svn/trunk/source@1413 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
added Ex/AllVarInScope(x,f) where the variable x remains a bound variable. Mikheil, please you these extractors when you build the latex string


git-svn-id: http://gapt.googlecode.com/svn/trunk/source@1414 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Small change in prooftool to show dbindex of bound variables.


git-svn-id: http://gapt.googlecode.com/svn/trunk/source@1415 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
closed the formulas in end-sequent extraction. A[x] :- B[y] will become all x A :- exists x B, hope this is now correct (from a logical point it should be ok since exists x (Ax | Bx) implies (exists x Ax) | (exists x Bx) but i'm not sure we actually want this

git-svn-id: http://gapt.googlecode.com/svn/trunk/source@1416 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
- Fixes issue 227.
- Changed the help text from "ceresHelp" to "help".
- Fixed the interface of some methods from cut-introduction.
- cutIntro now tries all the smallest grammars and chooses the one that
  generates the smallest proof.


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