{"push_id":871191413,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7df408b7701a98c8dc4bdc2d6d67f251c30e3b94","before":"3d5d896a473883467dd6683bc72d492c06e53f2d","commits":[{"sha":"7df408b7701a98c8dc4bdc2d6d67f251c30e3b94","author":{"email":"2f275a943c65d67ba543b6482cec85e98c8cf211@purdue.edu","name":"David"},"message":"Boolean Satisfiability Problem\n\nThis is the first project I ever completed entirely by myself with no\nskeleton code (and I'm very proud of this code!). My program recursively\nsolves any boolean satisfiability input (no matter how many clauses or\nvariables). Read the PDF for an in-depth explanation on how this works!","distinct":true,"url":"https://api.github.com/repos/bonetail/JavaProjects/commits/7df408b7701a98c8dc4bdc2d6d67f251c30e3b94"}]}