YES

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

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

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

The system is trivially terminating.