Version 012 is a minor release with bug fixes to QBF conversion of TC2.
The following are the main changes in version 012
 (1) Fixed: QBF conversion with TC over predicates cached in structures,
	    loading DIMACS files without comments, QBF conversion of TC2
	    applied to predicates in very small structures
 (2) Improved: slightly smaller QBF encodings

Version 011 is a minor release with small improvements to version 010.
The following are the main changes in version 011
 (1) Improvements to qcir command: SO(TC) with mixed first-order and
     predicate variables are now converted to TC2 using new monadic
     predicates, giving polynomial size encodings for such queries
 (2) New formats supported for QBF conversion: cleansed QCIR, prenex QCIR,
     PCNF (qdimacs).  These are converted from the general QCIR encoding -
     other tools will likely provide better qdimacs conversions.
 (3) Fixed: memory leaks from the parser
 (4) Removed: draw() command stub, zChaff support, CryptoMinisat 2.9.5 builtin.
     Other old SAT solvers and reduction-finding with BDDs remain deprecated.

Version 010 is the first release after a period of inactivity.
The following are the changes in version 010
 (1) Patches to the parser and included solvers to compile with newer compilers
     (e.g. recent macOS)
 (2) New choice for builtin SAT solver: Glucose 3.0
 (3) Bug fix: avoid re-using TC caches when they may depend on outer quantified
     variables. (eg correct output for \forall x,y: TC[z1,z2: x=y](x,y))
 (4) New qcir command: qcir(structure, phi, "filename")
     To output a QBF in QCIR format equivalent to structure \models phi.
     The qcir command is currently experimental; improvements are intended.
     This initial implementation of the qcir command uses polynomial size
     encodings for SO(TC1) and SO(TC2), mixing first-order and predicate
     variable arguments to TC operators results in an exponential size blowup,
     which will be fixed in the future.  For now, one can rewrite using monadic
     second-order variables.
 (5) Transitive closure over predicate variables: supported only in the qcir
     command. Direct evaluation and reduction finding support only TC1
 (6) Fixed: various memory leaks and an off-by-one allocation
 (7) Increased: maximum size of command accepted, to 1024*1024 bytes
 (8) Fixed: handling of higher-arity TC over tuples with even arities
 (9) Updated contact email: since UMass decided to revoke their "permanent"
     alumni email addresses
 (10) Deprecated: future versions will likely remove some of the old choices
     for builtin SAT solver and reduction-finding with BDDs
