{"push_id":601659520,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"cd8fda77b504ef7ec267f4d1c1f327b5efc4b4f0","before":"ed36147e69e8437dd7d636bcbe194cc7a712c19e","commits":[{"sha":"8c593112ce7695b391f194d350d779bad259b0ce","author":{"email":"a856efced3ebd67a1a78f27fb46e2fa6f4108525@tuwien.ac.at","name":"Stefan Hetzl"},"message":"faster expansion sequent minimization\n\nThis adds an algorithm which computes a single\nminimal expansion sequent below a given one which\nis considerably faster than computing all minimal\nexpansion sequents.","distinct":true,"url":"https://api.github.com/repos/gapt/gapt/commits/8c593112ce7695b391f194d350d779bad259b0ce"},{"sha":"fcd3aa8eab742a24ad682c01d724ba87ae824485","author":{"email":"a856efced3ebd67a1a78f27fb46e2fa6f4108525@tuwien.ac.at","name":"Stefan Hetzl"},"message":"more stats for MultiExpansionSequent","distinct":true,"url":"https://api.github.com/repos/gapt/gapt/commits/fcd3aa8eab742a24ad682c01d724ba87ae824485"},{"sha":"cd8fda77b504ef7ec267f4d1c1f327b5efc4b4f0","author":{"email":"a856efced3ebd67a1a78f27fb46e2fa6f4108525@tuwien.ac.at","name":"Stefan Hetzl"},"message":"script for testing veriT-import","distinct":true,"url":"https://api.github.com/repos/gapt/gapt/commits/cd8fda77b504ef7ec267f4d1c1f327b5efc4b4f0"}]}