/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 { P ↦ 0, Q ↦ 1, p ↦ 2, q ↦ 3 },
it remains to prove termination of the 9-rule system
{ 0 ⟶ 1 1 2 ,
  2 2 ⟶ 3 3 ,
  2 1 1 ⟶ 1 1 2 ,
  1 2 3 ⟶ 3 2 1 ,
  3 3 2 ⟶ 2 3 3 ,
  3 1 ⟶ ,
  1 3 ⟶ ,
  2 0 ⟶ ,
  0 2 ⟶ }

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 ⎟
    ⎝     ⎠

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

After renaming modulo the bijection { 2 ↦ 0, 3 ↦ 1, 1 ↦ 2 },
it remains to prove termination of the 6-rule system
{ 0 0 ⟶ 1 1 ,
  0 2 2 ⟶ 2 2 0 ,
  2 0 1 ⟶ 1 0 2 ,
  1 1 0 ⟶ 0 1 1 ,
  1 2 ⟶ ,
  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 1 ⎟
    ⎜ 0 1 ⎟
    ⎝     ⎠

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

The system is trivially terminating.