Proof Score for the Mutual Exclusion Property of QLOCK
  (You can download .zip file of this whole directory from here.)

The following sequence of files shows an example process of developing specification and proof score for the mutual exclusion property of Qlock protocol.  It is recommended for readers to check that proof-N.cafe can be obtained by applying legitimate splittings and/or transformations to some of proof passage(s) in proof-(N-1).cafe for 00 < N < 22.  Notice that proof-N.cafe (N = 00 ... 05) is making use of only invariants-0.cafe and proof-N.cafe (N = 06 ... 09) is making use of only invariants-1.cafe, and proof-N.cafe (N = 10 ... 21) is making use of invariants-2.cafe .
Notice that you do not need to prepare all of the above files.  Only the files qlock.cafe, invariants-2.cafe, and proof-21.cafe consititute a complete suite of specification and effective proof scroe for the mutual exclusion property of the Qlock protocol.