YES

After renaming modulo { a->0, b->1, c->2 }, 
it remains to prove termination of the 3-rule system
{ 0 0 1 -> 2 ,
  0 2 -> 1 2 0 0 ,
  1 2 -> }


The system was reversed.

After renaming modulo { 1->0, 0->1, 2->2 }, 
it remains to prove termination of the 3-rule system
{ 0 1 1 -> 2 ,
  2 1 -> 1 1 2 0 ,
  2 0 -> }


Applying sparse 2-tiling [Hofbauer/Geser/Waldmann, FSCD 2019].

After renaming modulo { (2,0)->0, (0,1)->1, (1,1)->2, (2,2)->3, (2,1)->4, (1,2)->5, (1,4)->6, (2,4)->7, (0,2)->8, (0,4)->9, (3,2)->10, (3,1)->11, (3,4)->12 },
it remains to prove termination of the 27-rule system
{ 0 1 2 2 -> 3 4 ,
  0 1 2 5 -> 3 3 ,
  0 1 2 6 -> 3 7 ,
  8 4 2 -> 1 2 5 0 1 ,
  8 4 5 -> 1 2 5 0 8 ,
  8 4 6 -> 1 2 5 0 9 ,
  5 4 2 -> 2 2 5 0 1 ,
  5 4 5 -> 2 2 5 0 8 ,
  5 4 6 -> 2 2 5 0 9 ,
  3 4 2 -> 4 2 5 0 1 ,
  3 4 5 -> 4 2 5 0 8 ,
  3 4 6 -> 4 2 5 0 9 ,
  10 4 2 -> 11 2 5 0 1 ,
  10 4 5 -> 11 2 5 0 8 ,
  10 4 6 -> 11 2 5 0 9 ,
  8 0 1 -> 1 ,
  8 0 8 -> 8 ,
  8 0 9 -> 9 ,
  5 0 1 -> 2 ,
  5 0 8 -> 5 ,
  5 0 9 -> 6 ,
  3 0 1 -> 4 ,
  3 0 8 -> 3 ,
  3 0 9 -> 7 ,
  10 0 1 -> 11 ,
  10 0 8 -> 10 ,
  10 0 9 -> 12 }


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 0 |
| 0 1 |
 \   /
5 is interpreted by
 /   \
| 1 0 |
| 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 0 |
| 0 1 |
 \   /
10 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /
11 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /
12 is interpreted by
 /   \
| 1 0 |
| 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 }, 
it remains to prove termination of the 22-rule system
{ 0 1 2 2 -> 3 4 ,
  0 1 2 5 -> 3 3 ,
  0 1 2 6 -> 3 7 ,
  8 4 2 -> 1 2 5 0 1 ,
  8 4 5 -> 1 2 5 0 8 ,
  8 4 6 -> 1 2 5 0 9 ,
  5 4 2 -> 2 2 5 0 1 ,
  5 4 5 -> 2 2 5 0 8 ,
  5 4 6 -> 2 2 5 0 9 ,
  3 4 2 -> 4 2 5 0 1 ,
  3 4 5 -> 4 2 5 0 8 ,
  3 4 6 -> 4 2 5 0 9 ,
  8 0 1 -> 1 ,
  8 0 8 -> 8 ,
  8 0 9 -> 9 ,
  5 0 1 -> 2 ,
  5 0 8 -> 5 ,
  5 0 9 -> 6 ,
  3 0 1 -> 4 ,
  3 0 8 -> 3 ,
  3 0 9 -> 7 ,
  10 0 8 -> 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 0 |
| 0 1 |
 \   /
5 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /
6 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /
7 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /
8 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /
9 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /
10 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /

After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4, 5->5, 8->6, 6->7, 9->8, 10->9 }, 
it remains to prove termination of the 20-rule system
{ 0 1 2 2 -> 3 4 ,
  0 1 2 5 -> 3 3 ,
  6 4 2 -> 1 2 5 0 1 ,
  6 4 5 -> 1 2 5 0 6 ,
  6 4 7 -> 1 2 5 0 8 ,
  5 4 2 -> 2 2 5 0 1 ,
  5 4 5 -> 2 2 5 0 6 ,
  5 4 7 -> 2 2 5 0 8 ,
  3 4 2 -> 4 2 5 0 1 ,
  3 4 5 -> 4 2 5 0 6 ,
  3 4 7 -> 4 2 5 0 8 ,
  6 0 1 -> 1 ,
  6 0 6 -> 6 ,
  6 0 8 -> 8 ,
  5 0 1 -> 2 ,
  5 0 6 -> 5 ,
  5 0 8 -> 7 ,
  3 0 1 -> 4 ,
  3 0 6 -> 3 ,
  9 0 6 -> 9 }


Applying the dependency pairs transformation.

After renaming modulo { (0,true)->0, (1,false)->1, (2,false)->2, (3,true)->3, (4,false)->4, (5,false)->5, (3,false)->6, (6,true)->7, (5,true)->8, (0,false)->9, (6,false)->10, (7,false)->11, (8,false)->12, (9,true)->13, (9,false)->14 },
it remains to prove termination of the 48-rule system
{ 0 1 2 2 -> 3 4 ,
  0 1 2 5 -> 3 6 ,
  0 1 2 5 -> 3 ,
  7 4 2 -> 8 9 1 ,
  7 4 2 -> 0 1 ,
  7 4 5 -> 8 9 10 ,
  7 4 5 -> 0 10 ,
  7 4 5 -> 7 ,
  7 4 11 -> 8 9 12 ,
  7 4 11 -> 0 12 ,
  8 4 2 -> 8 9 1 ,
  8 4 2 -> 0 1 ,
  8 4 5 -> 8 9 10 ,
  8 4 5 -> 0 10 ,
  8 4 5 -> 7 ,
  8 4 11 -> 8 9 12 ,
  8 4 11 -> 0 12 ,
  3 4 2 -> 8 9 1 ,
  3 4 2 -> 0 1 ,
  3 4 5 -> 8 9 10 ,
  3 4 5 -> 0 10 ,
  3 4 5 -> 7 ,
  3 4 11 -> 8 9 12 ,
  3 4 11 -> 0 12 ,
  7 9 10 -> 7 ,
  8 9 10 -> 8 ,
  3 9 10 -> 3 ,
  13 9 10 -> 13 ,
  9 1 2 2 ->= 6 4 ,
  9 1 2 5 ->= 6 6 ,
  10 4 2 ->= 1 2 5 9 1 ,
  10 4 5 ->= 1 2 5 9 10 ,
  10 4 11 ->= 1 2 5 9 12 ,
  5 4 2 ->= 2 2 5 9 1 ,
  5 4 5 ->= 2 2 5 9 10 ,
  5 4 11 ->= 2 2 5 9 12 ,
  6 4 2 ->= 4 2 5 9 1 ,
  6 4 5 ->= 4 2 5 9 10 ,
  6 4 11 ->= 4 2 5 9 12 ,
  10 9 1 ->= 1 ,
  10 9 10 ->= 10 ,
  10 9 12 ->= 12 ,
  5 9 1 ->= 2 ,
  5 9 10 ->= 5 ,
  5 9 12 ->= 11 ,
  6 9 1 ->= 4 ,
  6 9 10 ->= 6 ,
  14 9 10 ->= 14 }


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 0 |
| 0 1 |
 \   /
4 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /
5 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /
6 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /
7 is interpreted by
 /   \
| 1 0 |
| 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 0 |
| 0 1 |
 \   /
14 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /

After renaming modulo { 7->0, 9->1, 10->2, 8->3, 3->4, 13->5, 1->6, 2->7, 6->8, 4->9, 5->10, 11->11, 12->12, 14->13 }, 
it remains to prove termination of the 24-rule system
{ 0 1 2 -> 0 ,
  3 1 2 -> 3 ,
  4 1 2 -> 4 ,
  5 1 2 -> 5 ,
  1 6 7 7 ->= 8 9 ,
  1 6 7 10 ->= 8 8 ,
  2 9 7 ->= 6 7 10 1 6 ,
  2 9 10 ->= 6 7 10 1 2 ,
  2 9 11 ->= 6 7 10 1 12 ,
  10 9 7 ->= 7 7 10 1 6 ,
  10 9 10 ->= 7 7 10 1 2 ,
  10 9 11 ->= 7 7 10 1 12 ,
  8 9 7 ->= 9 7 10 1 6 ,
  8 9 10 ->= 9 7 10 1 2 ,
  8 9 11 ->= 9 7 10 1 12 ,
  2 1 6 ->= 6 ,
  2 1 2 ->= 2 ,
  2 1 12 ->= 12 ,
  10 1 6 ->= 7 ,
  10 1 2 ->= 10 ,
  10 1 12 ->= 11 ,
  8 1 6 ->= 9 ,
  8 1 2 ->= 8 ,
  13 1 2 ->= 13 }


The system was filtered by the following matrix interpretation
of type E_J with J = {1,...,2} and dimension 4:

0 is interpreted by
 /       \
| 1 0 1 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
1 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 1 |
| 0 0 0 0 |
 \       /
2 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 1 1 0 |
 \       /
3 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
4 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
5 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
6 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
7 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
8 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
9 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
10 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
11 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
12 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
13 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /

After renaming modulo { 3->0, 1->1, 2->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 23-rule system
{ 0 1 2 -> 0 ,
  3 1 2 -> 3 ,
  4 1 2 -> 4 ,
  1 5 6 6 ->= 7 8 ,
  1 5 6 9 ->= 7 7 ,
  2 8 6 ->= 5 6 9 1 5 ,
  2 8 9 ->= 5 6 9 1 2 ,
  2 8 10 ->= 5 6 9 1 11 ,
  9 8 6 ->= 6 6 9 1 5 ,
  9 8 9 ->= 6 6 9 1 2 ,
  9 8 10 ->= 6 6 9 1 11 ,
  7 8 6 ->= 8 6 9 1 5 ,
  7 8 9 ->= 8 6 9 1 2 ,
  7 8 10 ->= 8 6 9 1 11 ,
  2 1 5 ->= 5 ,
  2 1 2 ->= 2 ,
  2 1 11 ->= 11 ,
  9 1 5 ->= 6 ,
  9 1 2 ->= 9 ,
  9 1 11 ->= 10 ,
  7 1 5 ->= 8 ,
  7 1 2 ->= 7 ,
  12 1 2 ->= 12 }


The system was filtered by the following matrix interpretation
of type E_J with J = {1,...,2} and dimension 4:

0 is interpreted by
 /       \
| 1 0 1 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
1 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 1 |
| 0 0 0 0 |
 \       /
2 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 1 1 0 |
 \       /
3 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
4 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
5 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
6 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
7 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
8 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
9 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
10 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
11 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
12 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /

After renaming modulo { 3->0, 1->1, 2->2, 4->3, 5->4, 6->5, 7->6, 8->7, 9->8, 10->9, 11->10, 12->11 }, 
it remains to prove termination of the 22-rule system
{ 0 1 2 -> 0 ,
  3 1 2 -> 3 ,
  1 4 5 5 ->= 6 7 ,
  1 4 5 8 ->= 6 6 ,
  2 7 5 ->= 4 5 8 1 4 ,
  2 7 8 ->= 4 5 8 1 2 ,
  2 7 9 ->= 4 5 8 1 10 ,
  8 7 5 ->= 5 5 8 1 4 ,
  8 7 8 ->= 5 5 8 1 2 ,
  8 7 9 ->= 5 5 8 1 10 ,
  6 7 5 ->= 7 5 8 1 4 ,
  6 7 8 ->= 7 5 8 1 2 ,
  6 7 9 ->= 7 5 8 1 10 ,
  2 1 4 ->= 4 ,
  2 1 2 ->= 2 ,
  2 1 10 ->= 10 ,
  8 1 4 ->= 5 ,
  8 1 2 ->= 8 ,
  8 1 10 ->= 9 ,
  6 1 4 ->= 7 ,
  6 1 2 ->= 6 ,
  11 1 2 ->= 11 }


The system was filtered by the following matrix interpretation
of type E_J with J = {1,...,2} and dimension 4:

0 is interpreted by
 /       \
| 1 0 1 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
1 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 1 |
| 0 0 0 0 |
 \       /
2 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 1 1 0 |
 \       /
3 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
4 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
5 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
6 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
7 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
8 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
9 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
10 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
11 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /

After renaming modulo { 3->0, 1->1, 2->2, 4->3, 5->4, 6->5, 7->6, 8->7, 9->8, 10->9, 11->10 }, 
it remains to prove termination of the 21-rule system
{ 0 1 2 -> 0 ,
  1 3 4 4 ->= 5 6 ,
  1 3 4 7 ->= 5 5 ,
  2 6 4 ->= 3 4 7 1 3 ,
  2 6 7 ->= 3 4 7 1 2 ,
  2 6 8 ->= 3 4 7 1 9 ,
  7 6 4 ->= 4 4 7 1 3 ,
  7 6 7 ->= 4 4 7 1 2 ,
  7 6 8 ->= 4 4 7 1 9 ,
  5 6 4 ->= 6 4 7 1 3 ,
  5 6 7 ->= 6 4 7 1 2 ,
  5 6 8 ->= 6 4 7 1 9 ,
  2 1 3 ->= 3 ,
  2 1 2 ->= 2 ,
  2 1 9 ->= 9 ,
  7 1 3 ->= 4 ,
  7 1 2 ->= 7 ,
  7 1 9 ->= 8 ,
  5 1 3 ->= 6 ,
  5 1 2 ->= 5 ,
  10 1 2 ->= 10 }


The system was filtered by the following matrix interpretation
of type E_J with J = {1,...,2} and dimension 4:

0 is interpreted by
 /       \
| 1 0 1 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
1 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 1 |
| 0 0 0 0 |
 \       /
2 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 1 1 0 |
 \       /
3 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
4 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
5 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
6 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
7 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
8 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
9 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /
10 is interpreted by
 /       \
| 1 0 0 0 |
| 0 1 0 0 |
| 0 0 0 0 |
| 0 0 0 0 |
 \       /

After renaming modulo { 1->0, 3->1, 4->2, 5->3, 6->4, 7->5, 2->6, 8->7, 9->8, 10->9 }, 
it remains to prove termination of the 20-rule system
{ 0 1 2 2 ->= 3 4 ,
  0 1 2 5 ->= 3 3 ,
  6 4 2 ->= 1 2 5 0 1 ,
  6 4 5 ->= 1 2 5 0 6 ,
  6 4 7 ->= 1 2 5 0 8 ,
  5 4 2 ->= 2 2 5 0 1 ,
  5 4 5 ->= 2 2 5 0 6 ,
  5 4 7 ->= 2 2 5 0 8 ,
  3 4 2 ->= 4 2 5 0 1 ,
  3 4 5 ->= 4 2 5 0 6 ,
  3 4 7 ->= 4 2 5 0 8 ,
  6 0 1 ->= 1 ,
  6 0 6 ->= 6 ,
  6 0 8 ->= 8 ,
  5 0 1 ->= 2 ,
  5 0 6 ->= 5 ,
  5 0 8 ->= 7 ,
  3 0 1 ->= 4 ,
  3 0 6 ->= 3 ,
  9 0 6 ->= 9 }

The system is trivially terminating.