Modified toDeep.apply to take polarity into account. Added a unit test to verify that toDeep works correctly.


git-svn-id: http://gapt.googlecode.com/svn/trunk/source@2156 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Added multi expansion sequents and a toDeep function for both trees and sequents to multiExpansionTrees.


git-svn-id: http://gapt.googlecode.com/svn/trunk/source@2157 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Can now compress ExpansionSequents as well as individual ExpansionTrees.


git-svn-id: http://gapt.googlecode.com/svn/trunk/source@2158 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Added an algorithm that, given a MultiExpansionSequent, computes the list of valid MultiExpansionSequents below the argument. There is also a small unit test.


git-svn-id: http://gapt.googlecode.com/svn/trunk/source@2159 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
fix for ivy to robinson, robinson paramodulation checks rewriting, more fixes for robinson to ral

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