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