YES After renaming modulo { a->0, b->1, c->2 }, it remains to prove termination of the 5-rule system { 0 -> , 0 0 -> 1 2 , 1 -> , 2 -> , 2 1 -> 0 1 2 } Applying sparse 2-tiling [Hofbauer/Geser/Waldmann, FSCD 2019]. After renaming modulo { (0,0)->0, (0,1)->1, (0,2)->2, (0,4)->3, (1,0)->4, (1,1)->5, (1,2)->6, (1,4)->7, (2,0)->8, (2,1)->9, (2,2)->10, (2,4)->11, (3,0)->12, (3,1)->13, (3,2)->14, (3,4)->15 }, it remains to prove termination of the 80-rule system { 0 0 -> 0 , 0 1 -> 1 , 0 2 -> 2 , 0 3 -> 3 , 4 0 -> 4 , 4 1 -> 5 , 4 2 -> 6 , 4 3 -> 7 , 8 0 -> 8 , 8 1 -> 9 , 8 2 -> 10 , 8 3 -> 11 , 12 0 -> 12 , 12 1 -> 13 , 12 2 -> 14 , 12 3 -> 15 , 0 0 0 -> 1 6 8 , 0 0 1 -> 1 6 9 , 0 0 2 -> 1 6 10 , 0 0 3 -> 1 6 11 , 4 0 0 -> 5 6 8 , 4 0 1 -> 5 6 9 , 4 0 2 -> 5 6 10 , 4 0 3 -> 5 6 11 , 8 0 0 -> 9 6 8 , 8 0 1 -> 9 6 9 , 8 0 2 -> 9 6 10 , 8 0 3 -> 9 6 11 , 12 0 0 -> 13 6 8 , 12 0 1 -> 13 6 9 , 12 0 2 -> 13 6 10 , 12 0 3 -> 13 6 11 , 1 4 -> 0 , 1 5 -> 1 , 1 6 -> 2 , 1 7 -> 3 , 5 4 -> 4 , 5 5 -> 5 , 5 6 -> 6 , 5 7 -> 7 , 9 4 -> 8 , 9 5 -> 9 , 9 6 -> 10 , 9 7 -> 11 , 13 4 -> 12 , 13 5 -> 13 , 13 6 -> 14 , 13 7 -> 15 , 2 8 -> 0 , 2 9 -> 1 , 2 10 -> 2 , 2 11 -> 3 , 6 8 -> 4 , 6 9 -> 5 , 6 10 -> 6 , 6 11 -> 7 , 10 8 -> 8 , 10 9 -> 9 , 10 10 -> 10 , 10 11 -> 11 , 14 8 -> 12 , 14 9 -> 13 , 14 10 -> 14 , 14 11 -> 15 , 2 9 4 -> 0 1 6 8 , 2 9 5 -> 0 1 6 9 , 2 9 6 -> 0 1 6 10 , 2 9 7 -> 0 1 6 11 , 6 9 4 -> 4 1 6 8 , 6 9 5 -> 4 1 6 9 , 6 9 6 -> 4 1 6 10 , 6 9 7 -> 4 1 6 11 , 10 9 4 -> 8 1 6 8 , 10 9 5 -> 8 1 6 9 , 10 9 6 -> 8 1 6 10 , 10 9 7 -> 8 1 6 11 , 14 9 4 -> 12 1 6 8 , 14 9 5 -> 12 1 6 9 , 14 9 6 -> 12 1 6 10 , 14 9 7 -> 12 1 6 11 } 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 3 | | 0 1 | \ / 1 is interpreted by / \ | 1 3 | | 0 1 | \ / 2 is interpreted by / \ | 1 3 | | 0 1 | \ / 3 is interpreted by / \ | 1 1 | | 0 1 | \ / 4 is interpreted by / \ | 1 0 | | 0 1 | \ / 5 is interpreted by / \ | 1 3 | | 0 1 | \ / 6 is interpreted by / \ | 1 0 | | 0 1 | \ / 7 is interpreted by / \ | 1 0 | | 0 1 | \ / 8 is interpreted by / \ | 1 0 | | 0 1 | \ / 9 is interpreted by / \ | 1 3 | | 0 1 | \ / 10 is interpreted by / \ | 1 0 | | 0 1 | \ / 11 is interpreted by / \ | 1 0 | | 0 1 | \ / 12 is interpreted by / \ | 1 0 | | 0 1 | \ / 13 is interpreted by / \ | 1 2 | | 0 1 | \ / 14 is interpreted by / \ | 1 1 | | 0 1 | \ / 15 is interpreted by / \ | 1 0 | | 0 1 | \ / After renaming modulo { 4->0, 1->1, 5->2, 8->3, 9->4, 0->5, 6->6, 2->7, 10->8, 11->9, 7->10, 14->11 }, it remains to prove termination of the 29-rule system { 0 1 -> 2 , 3 1 -> 4 , 0 5 1 -> 2 6 4 , 3 5 1 -> 4 6 4 , 1 0 -> 5 , 1 6 -> 7 , 7 3 -> 5 , 7 8 -> 7 , 6 3 -> 0 , 6 4 -> 2 , 6 8 -> 6 , 6 9 -> 10 , 8 3 -> 3 , 8 4 -> 4 , 8 8 -> 8 , 8 9 -> 9 , 11 8 -> 11 , 7 4 0 -> 5 1 6 3 , 7 4 2 -> 5 1 6 4 , 7 4 6 -> 5 1 6 8 , 7 4 10 -> 5 1 6 9 , 6 4 0 -> 0 1 6 3 , 6 4 2 -> 0 1 6 4 , 6 4 6 -> 0 1 6 8 , 6 4 10 -> 0 1 6 9 , 8 4 0 -> 3 1 6 3 , 8 4 2 -> 3 1 6 4 , 8 4 6 -> 3 1 6 8 , 8 4 10 -> 3 1 6 9 } Applying the dependency pairs transformation. After renaming modulo { (0,true)->0, (5,false)->1, (1,false)->2, (6,true)->3, (4,false)->4, (3,true)->5, (1,true)->6, (6,false)->7, (7,true)->8, (8,false)->9, (3,false)->10, (8,true)->11, (11,true)->12, (0,false)->13, (2,false)->14, (10,false)->15, (9,false)->16, (7,false)->17, (11,false)->18 }, it remains to prove termination of the 76-rule system { 0 1 2 -> 3 4 , 5 1 2 -> 3 4 , 6 7 -> 8 , 8 9 -> 8 , 3 10 -> 0 , 3 9 -> 3 , 11 10 -> 5 , 11 9 -> 11 , 12 9 -> 12 , 8 4 13 -> 6 7 10 , 8 4 13 -> 3 10 , 8 4 13 -> 5 , 8 4 14 -> 6 7 4 , 8 4 14 -> 3 4 , 8 4 7 -> 6 7 9 , 8 4 7 -> 3 9 , 8 4 7 -> 11 , 8 4 15 -> 6 7 16 , 8 4 15 -> 3 16 , 3 4 13 -> 0 2 7 10 , 3 4 13 -> 6 7 10 , 3 4 13 -> 3 10 , 3 4 13 -> 5 , 3 4 14 -> 0 2 7 4 , 3 4 14 -> 6 7 4 , 3 4 14 -> 3 4 , 3 4 7 -> 0 2 7 9 , 3 4 7 -> 6 7 9 , 3 4 7 -> 3 9 , 3 4 7 -> 11 , 3 4 15 -> 0 2 7 16 , 3 4 15 -> 6 7 16 , 3 4 15 -> 3 16 , 11 4 13 -> 5 2 7 10 , 11 4 13 -> 6 7 10 , 11 4 13 -> 3 10 , 11 4 13 -> 5 , 11 4 14 -> 5 2 7 4 , 11 4 14 -> 6 7 4 , 11 4 14 -> 3 4 , 11 4 7 -> 5 2 7 9 , 11 4 7 -> 6 7 9 , 11 4 7 -> 3 9 , 11 4 7 -> 11 , 11 4 15 -> 5 2 7 16 , 11 4 15 -> 6 7 16 , 11 4 15 -> 3 16 , 13 2 ->= 14 , 10 2 ->= 4 , 13 1 2 ->= 14 7 4 , 10 1 2 ->= 4 7 4 , 2 13 ->= 1 , 2 7 ->= 17 , 17 10 ->= 1 , 17 9 ->= 17 , 7 10 ->= 13 , 7 4 ->= 14 , 7 9 ->= 7 , 7 16 ->= 15 , 9 10 ->= 10 , 9 4 ->= 4 , 9 9 ->= 9 , 9 16 ->= 16 , 18 9 ->= 18 , 17 4 13 ->= 1 2 7 10 , 17 4 14 ->= 1 2 7 4 , 17 4 7 ->= 1 2 7 9 , 17 4 15 ->= 1 2 7 16 , 7 4 13 ->= 13 2 7 10 , 7 4 14 ->= 13 2 7 4 , 7 4 7 ->= 13 2 7 9 , 7 4 15 ->= 13 2 7 16 , 9 4 13 ->= 10 2 7 10 , 9 4 14 ->= 10 2 7 4 , 9 4 7 ->= 10 2 7 9 , 9 4 15 ->= 10 2 7 16 } 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 2 | | 0 1 | \ / 2 is interpreted by / \ | 1 1 | | 0 1 | \ / 3 is interpreted by / \ | 1 1 | | 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 0 | | 0 1 | \ / 11 is interpreted by / \ | 1 1 | | 0 1 | \ / 12 is interpreted by / \ | 1 0 | | 0 1 | \ / 13 is interpreted by / \ | 1 1 | | 0 1 | \ / 14 is interpreted by / \ | 1 2 | | 0 1 | \ / 15 is interpreted by / \ | 1 1 | | 0 1 | \ / 16 is interpreted by / \ | 1 0 | | 0 1 | \ / 17 is interpreted by / \ | 1 2 | | 0 1 | \ / 18 is interpreted by / \ | 1 0 | | 0 1 | \ / After renaming modulo { 8->0, 9->1, 3->2, 11->3, 12->4, 13->5, 2->6, 14->7, 10->8, 4->9, 1->10, 7->11, 17->12, 16->13, 15->14, 18->15 }, it remains to prove termination of the 33-rule system { 0 1 -> 0 , 2 1 -> 2 , 3 1 -> 3 , 4 1 -> 4 , 5 6 ->= 7 , 8 6 ->= 9 , 5 10 6 ->= 7 11 9 , 8 10 6 ->= 9 11 9 , 6 5 ->= 10 , 6 11 ->= 12 , 12 8 ->= 10 , 12 1 ->= 12 , 11 8 ->= 5 , 11 9 ->= 7 , 11 1 ->= 11 , 11 13 ->= 14 , 1 8 ->= 8 , 1 9 ->= 9 , 1 1 ->= 1 , 1 13 ->= 13 , 15 1 ->= 15 , 12 9 5 ->= 10 6 11 8 , 12 9 7 ->= 10 6 11 9 , 12 9 11 ->= 10 6 11 1 , 12 9 14 ->= 10 6 11 13 , 11 9 5 ->= 5 6 11 8 , 11 9 7 ->= 5 6 11 9 , 11 9 11 ->= 5 6 11 1 , 11 9 14 ->= 5 6 11 13 , 1 9 5 ->= 8 6 11 8 , 1 9 7 ->= 8 6 11 9 , 1 9 11 ->= 8 6 11 1 , 1 9 14 ->= 8 6 11 13 } 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 1 1 | \ / 2 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 3 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 4 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 5 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 6 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 7 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 8 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 9 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 10 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 11 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 12 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 13 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 14 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 15 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / After renaming modulo { 2->0, 1->1, 3->2, 4->3, 5->4, 6->5, 7->6, 8->7, 9->8, 10->9, 11->10, 12->11, 13->12, 14->13, 15->14 }, it remains to prove termination of the 32-rule system { 0 1 -> 0 , 2 1 -> 2 , 3 1 -> 3 , 4 5 ->= 6 , 7 5 ->= 8 , 4 9 5 ->= 6 10 8 , 7 9 5 ->= 8 10 8 , 5 4 ->= 9 , 5 10 ->= 11 , 11 7 ->= 9 , 11 1 ->= 11 , 10 7 ->= 4 , 10 8 ->= 6 , 10 1 ->= 10 , 10 12 ->= 13 , 1 7 ->= 7 , 1 8 ->= 8 , 1 1 ->= 1 , 1 12 ->= 12 , 14 1 ->= 14 , 11 8 4 ->= 9 5 10 7 , 11 8 6 ->= 9 5 10 8 , 11 8 10 ->= 9 5 10 1 , 11 8 13 ->= 9 5 10 12 , 10 8 4 ->= 4 5 10 7 , 10 8 6 ->= 4 5 10 8 , 10 8 10 ->= 4 5 10 1 , 10 8 13 ->= 4 5 10 12 , 1 8 4 ->= 7 5 10 7 , 1 8 6 ->= 7 5 10 8 , 1 8 10 ->= 7 5 10 1 , 1 8 13 ->= 7 5 10 12 } 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 1 1 | \ / 2 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 3 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 4 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 5 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 6 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 7 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 8 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 9 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 10 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 11 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 12 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 13 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 14 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / After renaming modulo { 2->0, 1->1, 3->2, 4->3, 5->4, 6->5, 7->6, 8->7, 9->8, 10->9, 11->10, 12->11, 13->12, 14->13 }, it remains to prove termination of the 31-rule system { 0 1 -> 0 , 2 1 -> 2 , 3 4 ->= 5 , 6 4 ->= 7 , 3 8 4 ->= 5 9 7 , 6 8 4 ->= 7 9 7 , 4 3 ->= 8 , 4 9 ->= 10 , 10 6 ->= 8 , 10 1 ->= 10 , 9 6 ->= 3 , 9 7 ->= 5 , 9 1 ->= 9 , 9 11 ->= 12 , 1 6 ->= 6 , 1 7 ->= 7 , 1 1 ->= 1 , 1 11 ->= 11 , 13 1 ->= 13 , 10 7 3 ->= 8 4 9 6 , 10 7 5 ->= 8 4 9 7 , 10 7 9 ->= 8 4 9 1 , 10 7 12 ->= 8 4 9 11 , 9 7 3 ->= 3 4 9 6 , 9 7 5 ->= 3 4 9 7 , 9 7 9 ->= 3 4 9 1 , 9 7 12 ->= 3 4 9 11 , 1 7 3 ->= 6 4 9 6 , 1 7 5 ->= 6 4 9 7 , 1 7 9 ->= 6 4 9 1 , 1 7 12 ->= 6 4 9 11 } 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 1 1 | \ / 2 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 3 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 4 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 5 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 6 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 7 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 8 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 9 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 10 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 11 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 12 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 13 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / After renaming modulo { 2->0, 1->1, 3->2, 4->3, 5->4, 6->5, 7->6, 8->7, 9->8, 10->9, 11->10, 12->11, 13->12 }, it remains to prove termination of the 30-rule system { 0 1 -> 0 , 2 3 ->= 4 , 5 3 ->= 6 , 2 7 3 ->= 4 8 6 , 5 7 3 ->= 6 8 6 , 3 2 ->= 7 , 3 8 ->= 9 , 9 5 ->= 7 , 9 1 ->= 9 , 8 5 ->= 2 , 8 6 ->= 4 , 8 1 ->= 8 , 8 10 ->= 11 , 1 5 ->= 5 , 1 6 ->= 6 , 1 1 ->= 1 , 1 10 ->= 10 , 12 1 ->= 12 , 9 6 2 ->= 7 3 8 5 , 9 6 4 ->= 7 3 8 6 , 9 6 8 ->= 7 3 8 1 , 9 6 11 ->= 7 3 8 10 , 8 6 2 ->= 2 3 8 5 , 8 6 4 ->= 2 3 8 6 , 8 6 8 ->= 2 3 8 1 , 8 6 11 ->= 2 3 8 10 , 1 6 2 ->= 5 3 8 5 , 1 6 4 ->= 5 3 8 6 , 1 6 8 ->= 5 3 8 1 , 1 6 11 ->= 5 3 8 10 } 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 1 1 | \ / 2 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 3 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 4 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 5 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 6 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 7 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 8 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 9 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 10 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 11 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / 12 is interpreted by / \ | 1 0 0 | | 0 1 0 | | 0 0 0 | \ / After renaming modulo { 2->0, 3->1, 4->2, 5->3, 6->4, 7->5, 8->6, 9->7, 1->8, 10->9, 11->10, 12->11 }, it remains to prove termination of the 29-rule system { 0 1 ->= 2 , 3 1 ->= 4 , 0 5 1 ->= 2 6 4 , 3 5 1 ->= 4 6 4 , 1 0 ->= 5 , 1 6 ->= 7 , 7 3 ->= 5 , 7 8 ->= 7 , 6 3 ->= 0 , 6 4 ->= 2 , 6 8 ->= 6 , 6 9 ->= 10 , 8 3 ->= 3 , 8 4 ->= 4 , 8 8 ->= 8 , 8 9 ->= 9 , 11 8 ->= 11 , 7 4 0 ->= 5 1 6 3 , 7 4 2 ->= 5 1 6 4 , 7 4 6 ->= 5 1 6 8 , 7 4 10 ->= 5 1 6 9 , 6 4 0 ->= 0 1 6 3 , 6 4 2 ->= 0 1 6 4 , 6 4 6 ->= 0 1 6 8 , 6 4 10 ->= 0 1 6 9 , 8 4 0 ->= 3 1 6 3 , 8 4 2 ->= 3 1 6 4 , 8 4 6 ->= 3 1 6 8 , 8 4 10 ->= 3 1 6 9 } The system is trivially terminating.