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

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

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

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

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

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

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

Applying sparse untiling TRFCU(2) [Geser/Hofbauer/Waldmann, FSCD 2019].

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

The system is trivially terminating.