/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, d->3 }, 
it remains to prove termination of the 5-rule system
{ 0 0 -> 1 1 1 ,
  1 -> 2 2 3 ,
  2 -> 3 3 3 ,
  1 2 -> 2 1 ,
  1 2 3 -> 0 }


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

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


Applying sparse untiling TRFCU(2) [Geser/Hofbauer/Waldmann, FSCD 2019].

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