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


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


YES

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

The system was reversed.

After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1 },
it remains to prove termination of the 3-rule system
{ 0 0 ⟶ 0 1 0 ,
  1 1 ⟶ 0 0 ,
  0 1 1 0 ⟶ }

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

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

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

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

The system is trivially terminating.