added files for lazy basic smt solving. computation of propositional skeleton based on conjuctive normal form computation. added a simple unit test which is not working yet
compiling and code seems to run, not sure if it's working correctly yet, but unit test passes. congruence solver needs to be properly integrated
First commit of fast congruence closure algorithm with explain
fixed bug with default value, congruence closure working now
explain working, but probably buggy
edges data structure changed, eqClass union find fixed
prelim implementation of currying. before changing function args to list of terms
flattening working pretty much
flattening
integrated code compiling, but nullpointer exception
running and result looks fine
various changes to fix errors due to cases not thought of beforeintegration. basic unit tests pass, but mind the todos in DplltSuite
saving state before changing equation pair to predicateapplication/equals
changed Equation Pair to PredicateApplication/Equals and added Currifier unit test
Flattener unit test
Currifier test made a little better, comments and cosmetics
fixed nearest common ancestor algorithm and highest node computation. unit tests pass, work needed to make them less strict as talked mentioned in email exchange. changed return value of extract in flattener
refactored applyFun to Apply and ApplySymbol, as in core.Trees
Better tests, evaluation for propositional skeleton. Moved away from strict
syntactic requirements for Currifier and Flattener, towards testing properties.
Propositional skeleton test is a little bit tedious
cleaned up propositional skeleton test a bit