The paper aims to distinguish the couple-couple non-isomorphism hypergraphs, which have a known vertexes number, Z, and sides number, d. To solve this problem a number of criteria graded in distinguishing accuracy are developed. It also presents an experimental method to test the efficiency of the used criteria. It gives a method to put them in order. This research is considered a practical because it is useful in designing of machines and variable structure complex systems, and in comparing the new patterns.