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


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


YES

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


The length-preserving system was inverted.

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