YES After renaming modulo { r->0, s->1, n->2, b->3, u->4, t->5, c->6 }, it remains to prove termination of the 15-rule system { 0 0 -> 1 0 , 0 1 -> 1 0 , 0 2 -> 1 0 , 0 3 -> 4 1 3 , 0 4 -> 4 0 , 1 4 -> 4 1 , 2 4 -> 4 2 , 5 0 4 -> 5 6 0 , 5 1 4 -> 5 6 0 , 5 2 4 -> 5 6 0 , 6 4 -> 4 6 , 6 1 -> 1 6 , 6 0 -> 0 6 , 6 2 -> 2 6 , 6 2 -> 2 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 is interpreted by / \ | 1 0 | | 0 1 | \ / 1 is interpreted by / \ | 1 0 | | 0 1 | \ / 2 is interpreted by / \ | 1 1 | | 0 1 | \ / 3 is interpreted by / \ | 1 1 | | 0 1 | \ / 4 is interpreted by / \ | 1 0 | | 0 1 | \ / 5 is interpreted by / \ | 1 1 | | 0 1 | \ / 6 is interpreted by / \ | 1 0 | | 0 1 | \ / After renaming modulo { 0->0, 1->1, 3->2, 4->3, 2->4, 5->5, 6->6 }, it remains to prove termination of the 13-rule system { 0 0 -> 1 0 , 0 1 -> 1 0 , 0 2 -> 3 1 2 , 0 3 -> 3 0 , 1 3 -> 3 1 , 4 3 -> 3 4 , 5 0 3 -> 5 6 0 , 5 1 3 -> 5 6 0 , 6 3 -> 3 6 , 6 1 -> 1 6 , 6 0 -> 0 6 , 6 4 -> 4 6 , 6 4 -> 4 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 is interpreted by / \ | 1 1 | | 0 1 | \ / 1 is interpreted by / \ | 1 0 | | 0 1 | \ / 2 is interpreted by / \ | 1 0 | | 0 1 | \ / 3 is interpreted by / \ | 1 1 | | 0 1 | \ / 4 is interpreted by / \ | 1 0 | | 0 1 | \ / 5 is interpreted by / \ | 1 0 | | 0 1 | \ / 6 is interpreted by / \ | 1 0 | | 0 1 | \ / After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4, 5->5, 6->6 }, it remains to prove termination of the 11-rule system { 0 1 -> 1 0 , 0 2 -> 3 1 2 , 0 3 -> 3 0 , 1 3 -> 3 1 , 4 3 -> 3 4 , 5 1 3 -> 5 6 0 , 6 3 -> 3 6 , 6 1 -> 1 6 , 6 0 -> 0 6 , 6 4 -> 4 6 , 6 4 -> 4 } Applying the dependency pairs transformation. After renaming modulo { (0,true)->0, (1,false)->1, (1,true)->2, (0,false)->3, (2,false)->4, (3,false)->5, (4,true)->6, (5,true)->7, (6,false)->8, (6,true)->9, (4,false)->10, (5,false)->11 }, it remains to prove termination of the 28-rule system { 0 1 -> 2 3 , 0 1 -> 0 , 0 4 -> 2 4 , 0 5 -> 0 , 2 5 -> 2 , 6 5 -> 6 , 7 1 5 -> 7 8 3 , 7 1 5 -> 9 3 , 7 1 5 -> 0 , 9 5 -> 9 , 9 1 -> 2 8 , 9 1 -> 9 , 9 3 -> 0 8 , 9 3 -> 9 , 9 10 -> 6 8 , 9 10 -> 9 , 9 10 -> 6 , 3 1 ->= 1 3 , 3 4 ->= 5 1 4 , 3 5 ->= 5 3 , 1 5 ->= 5 1 , 10 5 ->= 5 10 , 11 1 5 ->= 11 8 3 , 8 5 ->= 5 8 , 8 1 ->= 1 8 , 8 3 ->= 3 8 , 8 10 ->= 10 8 , 8 10 ->= 10 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 is interpreted by / \ | 1 0 | | 0 1 | \ / 1 is interpreted by / \ | 1 0 | | 0 1 | \ / 2 is interpreted by / \ | 1 0 | | 0 1 | \ / 3 is interpreted by / \ | 1 0 | | 0 1 | \ / 4 is interpreted by / \ | 1 1 | | 0 1 | \ / 5 is interpreted by / \ | 1 0 | | 0 1 | \ / 6 is interpreted by / \ | 1 0 | | 0 1 | \ / 7 is interpreted by / \ | 1 1 | | 0 1 | \ / 8 is interpreted by / \ | 1 0 | | 0 1 | \ / 9 is interpreted by / \ | 1 0 | | 0 1 | \ / 10 is interpreted by / \ | 1 1 | | 0 1 | \ / 11 is interpreted by / \ | 1 1 | | 0 1 | \ / After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4, 5->5, 6->6, 7->7, 8->8, 9->9, 10->10, 11->11 }, it remains to prove termination of the 23-rule system { 0 1 -> 2 3 , 0 1 -> 0 , 0 4 -> 2 4 , 0 5 -> 0 , 2 5 -> 2 , 6 5 -> 6 , 7 1 5 -> 7 8 3 , 9 5 -> 9 , 9 1 -> 2 8 , 9 1 -> 9 , 9 3 -> 0 8 , 9 3 -> 9 , 3 1 ->= 1 3 , 3 4 ->= 5 1 4 , 3 5 ->= 5 3 , 1 5 ->= 5 1 , 10 5 ->= 5 10 , 11 1 5 ->= 11 8 3 , 8 5 ->= 5 8 , 8 1 ->= 1 8 , 8 3 ->= 3 8 , 8 10 ->= 10 8 , 8 10 ->= 10 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 is interpreted by / \ | 1 0 | | 0 1 | \ / 1 is interpreted by / \ | 1 0 | | 0 1 | \ / 2 is interpreted by / \ | 1 0 | | 0 1 | \ / 3 is interpreted by / \ | 1 0 | | 0 1 | \ / 4 is interpreted by / \ | 1 1 | | 0 1 | \ / 5 is interpreted by / \ | 1 0 | | 0 1 | \ / 6 is interpreted by / \ | 1 1 | | 0 1 | \ / 7 is interpreted by / \ | 1 1 | | 0 1 | \ / 8 is interpreted by / \ | 1 0 | | 0 1 | \ / 9 is interpreted by / \ | 1 1 | | 0 1 | \ / 10 is interpreted by / \ | 1 1 | | 0 1 | \ / 11 is interpreted by / \ | 1 1 | | 0 1 | \ / After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4, 5->5, 6->6, 7->7, 8->8, 9->9, 10->10, 11->11 }, it remains to prove termination of the 21-rule system { 0 1 -> 2 3 , 0 1 -> 0 , 0 4 -> 2 4 , 0 5 -> 0 , 2 5 -> 2 , 6 5 -> 6 , 7 1 5 -> 7 8 3 , 9 5 -> 9 , 9 1 -> 9 , 9 3 -> 9 , 3 1 ->= 1 3 , 3 4 ->= 5 1 4 , 3 5 ->= 5 3 , 1 5 ->= 5 1 , 10 5 ->= 5 10 , 11 1 5 ->= 11 8 3 , 8 5 ->= 5 8 , 8 1 ->= 1 8 , 8 3 ->= 3 8 , 8 10 ->= 10 8 , 8 10 ->= 10 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 is interpreted by / \ | 1 1 | | 0 1 | \ / 1 is interpreted by / \ | 1 0 | | 0 1 | \ / 2 is interpreted by / \ | 1 0 | | 0 1 | \ / 3 is interpreted by / \ | 1 0 | | 0 1 | \ / 4 is interpreted by / \ | 1 1 | | 0 1 | \ / 5 is interpreted by / \ | 1 0 | | 0 1 | \ / 6 is interpreted by / \ | 1 1 | | 0 1 | \ / 7 is interpreted by / \ | 1 1 | | 0 1 | \ / 8 is interpreted by / \ | 1 0 | | 0 1 | \ / 9 is interpreted by / \ | 1 1 | | 0 1 | \ / 10 is interpreted by / \ | 1 1 | | 0 1 | \ / 11 is interpreted by / \ | 1 1 | | 0 1 | \ / After renaming modulo { 0->0, 1->1, 5->2, 2->3, 6->4, 7->5, 8->6, 3->7, 9->8, 4->9, 10->10, 11->11 }, it remains to prove termination of the 19-rule system { 0 1 -> 0 , 0 2 -> 0 , 3 2 -> 3 , 4 2 -> 4 , 5 1 2 -> 5 6 7 , 8 2 -> 8 , 8 1 -> 8 , 8 7 -> 8 , 7 1 ->= 1 7 , 7 9 ->= 2 1 9 , 7 2 ->= 2 7 , 1 2 ->= 2 1 , 10 2 ->= 2 10 , 11 1 2 ->= 11 6 7 , 6 2 ->= 2 6 , 6 1 ->= 1 6 , 6 7 ->= 7 6 , 6 10 ->= 10 6 , 6 10 ->= 10 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 is interpreted by / \ | 1 0 | | 0 1 | \ / 1 is interpreted by / \ | 1 1 | | 0 1 | \ / 2 is interpreted by / \ | 1 1 | | 0 1 | \ / 3 is interpreted by / \ | 1 0 | | 0 1 | \ / 4 is interpreted by / \ | 1 0 | | 0 1 | \ / 5 is interpreted by / \ | 1 0 | | 0 1 | \ / 6 is interpreted by / \ | 1 0 | | 0 1 | \ / 7 is interpreted by / \ | 1 2 | | 0 1 | \ / 8 is interpreted by / \ | 1 0 | | 0 1 | \ / 9 is interpreted by / \ | 1 0 | | 0 1 | \ / 10 is interpreted by / \ | 1 0 | | 0 1 | \ / 11 is interpreted by / \ | 1 0 | | 0 1 | \ / After renaming modulo { 5->0, 1->1, 2->2, 6->3, 7->4, 9->5, 10->6, 11->7 }, it remains to prove termination of the 12-rule system { 0 1 2 -> 0 3 4 , 4 1 ->= 1 4 , 4 5 ->= 2 1 5 , 4 2 ->= 2 4 , 1 2 ->= 2 1 , 6 2 ->= 2 6 , 7 1 2 ->= 7 3 4 , 3 2 ->= 2 3 , 3 1 ->= 1 3 , 3 4 ->= 4 3 , 3 6 ->= 6 3 , 3 6 ->= 6 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 3: 0 is interpreted by / \ | 1 0 1 | | 0 1 0 | | 0 0 0 | \ / 1 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 1 | \ / 2 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 1 | \ / 3 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 4 is interpreted by / \ | 1 0 1 | | 0 1 0 | | 0 0 1 | \ / 5 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 1 0 | \ / 6 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 7 is interpreted by / \ | 1 0 1 | | 0 1 0 | | 0 0 0 | \ / After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4, 6->5, 7->6 }, it remains to prove termination of the 11-rule system { 0 1 2 -> 0 3 4 , 4 1 ->= 1 4 , 4 2 ->= 2 4 , 1 2 ->= 2 1 , 5 2 ->= 2 5 , 6 1 2 ->= 6 3 4 , 3 2 ->= 2 3 , 3 1 ->= 1 3 , 3 4 ->= 4 3 , 3 5 ->= 5 3 , 3 5 ->= 5 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 is interpreted by / \ | 1 0 | | 0 1 | \ / 1 is interpreted by / \ | 1 1 | | 0 1 | \ / 2 is interpreted by / \ | 1 1 | | 0 1 | \ / 3 is interpreted by / \ | 1 1 | | 0 1 | \ / 4 is interpreted by / \ | 1 0 | | 0 1 | \ / 5 is interpreted by / \ | 1 0 | | 0 1 | \ / 6 is interpreted by / \ | 1 0 | | 0 1 | \ / After renaming modulo { 4->0, 1->1, 2->2, 5->3, 3->4 }, it remains to prove termination of the 8-rule system { 0 1 ->= 1 0 , 0 2 ->= 2 0 , 1 2 ->= 2 1 , 3 2 ->= 2 3 , 4 2 ->= 2 4 , 4 1 ->= 1 4 , 4 0 ->= 0 4 , 4 3 ->= 3 4 } The system is trivially terminating.