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


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


YES

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

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

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

The system was filtered by the following matrix interpretation
of type E_J with J = {1,...,2} and dimension 2:

0 ↦ ⎛     ⎞
    ⎜ 1 1 ⎟
    ⎜ 0 1 ⎟
    ⎝     ⎠

1 ↦ ⎛     ⎞
    ⎜ 1 0 ⎟
    ⎜ 0 1 ⎟
    ⎝     ⎠

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

The system is trivially terminating.