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


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


YES

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


The system was reversed.

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


Applying the dependency pairs transformation.

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


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

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

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

The system is trivially terminating.