/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

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


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

0 is interpreted by
 /           \
| 1 0 1 0 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 0 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 1 0 0 |
| 0 1 0 0 0 0 |
 \           /
1 is interpreted by
 /           \
| 1 0 0 0 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 0 0 0 |
| 0 0 0 0 1 0 |
| 0 0 0 0 0 0 |
| 0 1 0 0 0 0 |
 \           /
2 is interpreted by
 /           \
| 1 0 0 0 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 1 0 0 |
| 0 0 0 0 0 0 |
| 0 0 0 0 0 1 |
| 0 0 0 0 1 0 |
 \           /

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


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

0 is interpreted by
 /           \
| 1 0 1 0 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 1 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 0 0 0 |
| 0 1 0 0 0 0 |
 \           /
1 is interpreted by
 /           \
| 1 0 0 0 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 0 0 0 |
| 0 0 0 0 1 0 |
| 0 0 0 0 0 0 |
| 0 1 0 0 0 0 |
 \           /
2 is interpreted by
 /           \
| 1 0 0 0 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 0 0 0 |
| 0 0 0 0 0 0 |
| 0 0 0 0 0 1 |
| 0 0 1 0 1 0 |
 \           /

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


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

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

The system is trivially terminating.