Cleaned up and reorganized some code as per Stefan's suggestions.


git-svn-id: http://gapt.googlecode.com/svn/trunk/source@2164 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Added an algorithm that converts MultiExpansionTrees to ExpansionTrees, along with a simple unit test. Consequently, minimalExpansionSequents can now be applied to ExpansionSequents by converting back and forth.


git-svn-id: http://gapt.googlecode.com/svn/trunk/source@2165 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
ral: fixed atomic factor rules, paramodulation allows flipped equiations too now 

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