proposition: Lemma long_inv : forall (c : Config) (s0 s1 s2 : Site), parent c s0 s1 -> ancestor c s1 s2 -> ancestor c s0 s2.
proof: Proof. intros. generalize H. elim H0. intros. apply long with (s1 := s3). apply short. auto. auto. intros. generalize (H2 H4); intro. apply long with (s1 := s4). auto. auto. Qed.
imports: DistributedReferenceCounting.machine4.invariant0 DistributedReferenceCounting.machine4.invariant1 DistributedReferenceCounting.machine4.invariant2 DistributedReferenceCounting.machine4.invariant3 DistributedReferenceCounting.machine4.invariant4