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


The system was reversed.

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


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 1 0 ,
  1 1 -> 1 2 1 }


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

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