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

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

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

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

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

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

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

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

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

The system is trivially terminating.