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

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

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

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

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

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

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

The system is trivially terminating.