Isomorphism conjecture for graphs obtained by fixed shrinking strategies

Let $G$ be a graph, let $(y,x)\in P^G_A$ be a vector, and let

$$\mathrm{SRK}\in\{\mathrm{C1},\mathrm{C1C2},\mathrm{C1C2C3},\mathrm{S1},\mathrm{S1S2}\}$$

be a fixed shrinking strategy. Shrinking-strategy isomorphism conjecture. The graphs obtained by applying $\mathrm{SRK}$ to $(y,x)$ are isomorphic. This conjecture formalizes the experimental observation that the final shrunk graph appeared independent of the ordering of the rules and shrinkable sets. The paper presents this as a suggestion based on computational results and does not provide a proof.