/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES


The dependency pairs transformation was applied.

Remains to prove termination of the 3-rule system
{ (c,true) (a,false) (b,false) (a,false) (b,false) -> (c,true) (a,false) (b,false) (c,false) (a,false) ,
  (c,true) (a,false) (b,false) (a,false) (b,false) -> (c,true) (a,false) ,
  (c,false) (a,false) (b,false) (a,false) (b,false) ->= (a,false) (b,false) (a,false) (b,false) (b,false) (a,false) (b,false) (b,false) (c,false) (a,false) (b,false) (c,false) (a,false) }




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

(c,true) is interpreted by
 /           \
| 1 0 1 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 |
 \           /
(a,false) is interpreted by
 /           \
| 1 0 0 0 0 0 |
| 0 1 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 |
 \           /
(b,false) is interpreted by
 /           \
| 1 0 0 0 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 0 0 0 |
| 0 0 0 0 1 0 |
| 0 0 0 0 0 0 |
| 0 1 0 1 0 0 |
 \           /
(c,false) is interpreted by
 /           \
| 1 0 0 0 0 0 |
| 0 1 0 0 0 0 |
| 0 3 0 0 0 0 |
| 0 0 0 0 0 0 |
| 0 1 0 0 0 0 |
| 0 0 0 0 0 0 |
 \           /

Remains to prove termination of the 2-rule system
{ (c,true) (a,false) (b,false) (a,false) (b,false) -> (c,true) (a,false) (b,false) (c,false) (a,false) ,
  (c,false) (a,false) (b,false) (a,false) (b,false) ->= (a,false) (b,false) (a,false) (b,false) (b,false) (a,false) (b,false) (b,false) (c,false) (a,false) (b,false) (c,false) (a,false) }


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

(c,true) is interpreted by
 /                   \
| 1 0 1 0 0 0 1 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 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 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 |
 \                   /
(a,false) is interpreted by
 /                   \
| 1 0 0 0 0 0 0 0 0 0 |
| 0 1 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 1 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 1 |
| 0 0 0 0 0 0 0 0 0 0 |
 \                   /
(b,false) is interpreted by
 /                   \
| 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 1 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 1 0 |
| 0 0 0 0 0 0 0 0 0 0 |
| 0 0 0 1 0 0 0 0 0 0 |
 \                   /
(c,false) is interpreted by
 /                   \
| 1 0 0 0 0 0 0 0 0 0 |
| 0 1 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 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 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 0 |
 \                   /

Remains to prove termination of the 1-rule system
{ (c,false) (a,false) (b,false) (a,false) (b,false) ->= (a,false) (b,false) (a,false) (b,false) (b,false) (a,false) (b,false) (b,false) (c,false) (a,false) (b,false) (c,false) (a,false) }


The system is trivially terminating.