PopStar: computation of constraints and bound on recursion depth split
fixed output glitch when drawing list arguments in processor description
removed comment
matrix output shows all order constraints (not only of usable rules),
to avoid confusion in output of weightgap
computation of recursion depth refined for sPOP*
added kruskal.trs
relaxed build constraints
xml output extended; normaliseProof moved to processor-implementation
of transformation
added Utils.Xml.Encoding
removed debug output
added timeout to competition 2012 strategies
competition strategy 2012: use fastest if no timeout given
removed superfluous imports
rc2012 strategy: separated matrices from poly in direct methods
default strategy uses timeout of 60 seconds
exported Tct.Instances.polys
iteProgress: check answer of normalised proof
normalise proof in interactive mode
tctpfHTML: fixed reducedProofTree of timeout node
removed old commented code