/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 { t ↦ 0, o ↦ 1, m ↦ 2, a ↦ 3, e ↦ 4, n ↦ 5, s ↦ 6, l ↦ 7 }, it remains to prove termination of the 6-rule system { 0 1 ⟶ 2 3 , 0 4 ⟶ 5 6 , 3 7 ⟶ 3 0 , 1 2 3 ⟶ 0 4 5 , 6 3 ⟶ 7 3 0 1 2 3 0 4 , 5 6 ⟶ 3 7 3 0 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 8: 0 ↦ ⎛ ⎞ ⎜ 1 0 0 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 1 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 1 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 0 0 0 0 1 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 1 0 0 0 0 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 0 0 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 1 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 0 0 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 1 1 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 1 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 0 1 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎝ ⎠ 5 ↦ ⎛ ⎞ ⎜ 1 0 0 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 1 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎝ ⎠ 6 ↦ ⎛ ⎞ ⎜ 1 0 1 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎝ ⎠ 7 ↦ ⎛ ⎞ ⎜ 1 0 0 0 0 0 0 0 ⎟ ⎜ 0 1 0 0 1 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 0 0 0 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3, 4 ↦ 4, 5 ↦ 5, 6 ↦ 6, 7 ↦ 7 }, it remains to prove termination of the 5-rule system { 0 1 ⟶ 2 3 , 0 4 ⟶ 5 6 , 3 7 ⟶ 3 0 , 1 2 3 ⟶ 0 4 5 , 5 6 ⟶ 3 7 3 0 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 5 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 6 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 7 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 4 ↦ 1, 5 ↦ 2, 6 ↦ 3, 3 ↦ 4, 7 ↦ 5 }, it remains to prove termination of the 3-rule system { 0 1 ⟶ 2 3 , 4 5 ⟶ 4 0 , 2 3 ⟶ 4 5 4 0 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 5 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 4 ↦ 0, 5 ↦ 1, 0 ↦ 2, 2 ↦ 3, 3 ↦ 4 }, it remains to prove termination of the 2-rule system { 0 1 ⟶ 0 2 , 3 4 ⟶ 0 1 0 2 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { }, it remains to prove termination of the 0-rule system { } The system is trivially terminating.