Changed the structure so that every claim is a class rather than an
Object, added a let construct, generalized the translator, and changed
SG accordingly. Have only implemented a randomized saddle point player
and up to Basis(g,b) in the graph example, the neither the graph
structure, its predicates and functions, nor translator are implemented.
This is sample output for the saddle point.