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

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

0 ↦ ⎛                         ⎞
    ⎜ 1 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 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 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 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 0 0 0 0 0 0 0 0 0 0 ⎟
    ⎝                         ⎠

1 ↦ ⎛                         ⎞
    ⎜ 1 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 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 0 ⎟
    ⎜ 0 0 0 0 0 0 0 1 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 1 0 0 0 0 0 0 2 0 ⎟
    ⎜ 0 0 0 0 0 0 0 0 0 0 0 0 ⎟
    ⎜ 0 1 1 0 0 0 0 0 0 1 0 0 ⎟
    ⎝                         ⎠

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

The system is trivially terminating.