YES

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

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


Applying the dependency pairs transformation.

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


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

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


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


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

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


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

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

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

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

The system is trivially terminating.