YES

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


The system was reversed.

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


Applying the dependency pairs transformation.

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

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


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

0 is interpreted by
 /         \
| 1 0 0 0 0 |
| 0 1 0 0 0 |
| 0 0 0 0 0 |
| 0 0 0 0 0 |
| 0 0 0 0 0 |
 \         /
1 is interpreted by
 /         \
| 1 0 0 0 0 |
| 0 1 0 0 0 |
| 0 0 0 1 0 |
| 0 1 0 0 0 |
| 0 0 0 0 0 |
 \         /
2 is interpreted by
 /         \
| 1 0 1 0 0 |
| 0 1 0 0 0 |
| 0 0 0 0 0 |
| 0 0 0 0 0 |
| 0 0 0 0 0 |
 \         /
3 is interpreted by
 /         \
| 1 0 0 0 0 |
| 0 1 0 0 0 |
| 0 0 0 0 0 |
| 0 0 0 0 1 |
| 0 1 0 0 0 |
 \         /
4 is interpreted by
 /         \
| 1 0 0 0 0 |
| 0 1 0 0 0 |
| 0 1 0 0 0 |
| 0 0 0 0 0 |
| 0 0 1 0 0 |
 \         /
5 is interpreted by
 /         \
| 1 0 0 0 0 |
| 0 1 0 0 0 |
| 0 0 0 0 0 |
| 0 0 0 0 0 |
| 0 0 0 0 0 |
 \         /

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

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


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

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

The system is trivially terminating.