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


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


YES

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

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


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

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

After renaming modulo { 0->0, 2->1 }, 
it remains to prove termination of the 1-rule system
{ 0 1 -> 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
{ }