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


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


YES

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

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


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

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


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

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


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

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