YES

After renaming modulo { d->0, n->1, o->2, u->3, t->4, c->5, f->6, g->7 }, 
it remains to prove termination of the 16-rule system
{ 0 1 -> 0 ,
  0 2 -> 0 ,
  2 3 -> 3 ,
  4 3 ->= 4 5 0 ,
  0 6 ->= 6 0 ,
  0 7 ->= 3 7 ,
  6 3 ->= 3 6 ,
  1 3 ->= 3 ,
  6 ->= 6 1 ,
  4 ->= 4 5 1 ,
  5 1 ->= 1 5 ,
  5 2 ->= 2 5 ,
  5 2 ->= 2 ,
  5 6 ->= 6 5 ,
  5 3 ->= 3 5 ,
  5 0 ->= 0 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 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 0 |
| 0 1 |
 \   /
6 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /
7 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /

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


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

After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4, 5->5, 7->6 }, 
it remains to prove termination of the 13-rule system
{ 0 1 -> 0 ,
  2 3 ->= 2 4 0 ,
  0 5 ->= 5 0 ,
  5 3 ->= 3 5 ,
  1 3 ->= 3 ,
  5 ->= 5 1 ,
  2 ->= 2 4 1 ,
  4 1 ->= 1 4 ,
  4 6 ->= 6 4 ,
  4 6 ->= 6 ,
  4 5 ->= 5 4 ,
  4 3 ->= 3 4 ,
  4 0 ->= 0 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 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 1 |
| 0 1 |
 \   /

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


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

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 -> 0 ,
  2 3 ->= 3 2 ,
  1 3 ->= 3 ,
  2 ->= 2 1 ,
  4 ->= 4 5 1 ,
  5 1 ->= 1 5 ,
  5 6 ->= 6 5 ,
  5 6 ->= 6 ,
  5 2 ->= 2 5 ,
  5 3 ->= 3 5 ,
  5 0 ->= 0 5 }


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

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

The system is trivially terminating.