/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


NO
Input TRS:
    1: g(X) -> h(activate(X))
    2: c() -> d()
    3: h(n__d()) -> g(n__c())
    4: d() -> n__d()
    5: c() -> n__c()
    6: activate(n__d()) -> d()
    7: activate(n__c()) -> c()
    8: activate(X) -> X
Number of strict rules: 8
Direct POLO(bPol) ... removes: 8 5 6
      h 	w: x1
      d 	w: 5
      activate	w: x1 + 1
      n__c	w: 4
      c 	w: 5
      n__d	w: 5
      g 	w: x1 + 1
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #c() -> #d()
   #2: #activate(n__c()) -> #c()
   #3: #h(n__d()) -> #g(n__c())
   #4: #g(X) -> #h(activate(X))
   #5: #g(X) -> #activate(X)
Number of SCCs: 1, DPs: 2
  SCC { #3 #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #g(n__c())	-#4->
  #h(activate(n__c()))	--->*
  #h(n__d())	-#3->
  #g(n__c())	--->*
  #g(n__c())
  Looping with: [ ]