  We consider Proof Complexity in light of the unusual binary encoding of
certain combinatorial principles. We contrast this Proof Complexity with the
normal unary encoding in several refutation systems, based on Resolution and
Integer Linear Programming. Please consult the article for the full abstract.
