First run at SMT-LIB generated table test.

Implement a first run (with simple non-exhaustive test) of the SMT-LIB generator
for hierarchical tables.  This generates the same information as the cvc3
generator, but using the appropriate syntax.  Note that the generated script
can't be directly run, due to how SMT-LIB verifiers work regarding reading of
values, so the queries need to be piped directly across one by one for
verification.

Also, since SMT-LIB doesn't have an equivalent to CVC3's QUERY command, all
queries have a not placed in front.  This lead to a few changes to the queries:
 - Disjoint queries now had a format of: (not (and (not (and e1 e2)))).  This
can be simplified with De Morgan's law to (or (and e1 e2)) (by removing the
(not (and (not to the more simple (or).
 - Complete queries now have an extra (not in front.  No further optimization
is possible.
 - For the parent part of any query, instead of using (not (=> (p e)), which
removes the potential disjoint optimization, the not is pushed down so the
format is now (and p (not e)).  Also, for simplification p is always defined,
and is true when no parent cells exist.

git-svn-id: https://groke.mcmaster.ca/svn/grad/colin/branches/TableTool_javization@10658 57e6efec-57d4-0310-aeb1-a6c144bb1a8b