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

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

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

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.