fact: Definition test : Z`2 -> (seq Z)`2 -> bool * (seq Z)`2 := fun '(c, r) '(upds, downs) => let (u, d) := (r - c, r + c)%Z in ((u \notin upds) && (d \notin downs), (u :: upds, d :: downs)).
imports: ZArith mathcomp(all_ssreflect) infotheo(ssrZ) monae_lib hierarchy monad_lib fail_lib state_lib