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


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


YES

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


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 27 |
|  0  1 |
 \     /
1 is interpreted by
 /     \
|  1 24 |
|  0  1 |
 \     /
2 is interpreted by
 /     \
|  1 29 |
|  0  1 |
 \     /
3 is interpreted by
 /     \
|  1 19 |
|  0  1 |
 \     /
4 is interpreted by
 /     \
|  1 24 |
|  0  1 |
 \     /

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


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

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