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


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


NO
Input TRS:
    1: zeros() -> cons(0(),n__zeros())
    2: U11(tt(),L) -> U12(tt(),activate(L))
    3: U12(tt(),L) -> s(length(activate(L)))
    4: length(nil()) -> 0()
    5: length(cons(N,L)) -> U11(tt(),activate(L))
    6: zeros() -> n__zeros()
    7: activate(n__zeros()) -> zeros()
    8: activate(X) -> X
Number of strict rules: 8
Direct POLO(bPol) ... removes: 4
      U11	w: x1 + x2 + 1
      s 	w: x1
      activate	w: x1
      n__zeros	w: 1
      zeros	w: 1
      U12	w: x1 + x2 + 1
      0 	w: 0
      nil	w: 1
      cons	w: x1 + x2
      tt	w: 6
      length	w: x1 + 7
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying U12 U11
1: zeros() -> cons(0(),n__zeros())
2: U11^1_tt(L) -> U12^1_tt(activate(L))
3: U12^1_tt(L) -> s(length(activate(L)))
5: length(cons(N,L)) -> U11^1_tt(activate(L))
6: zeros() -> n__zeros()
7: activate(n__zeros()) -> zeros()
8: activate(X) -> X
9: U11(tt(),_1) ->= U11^1_tt(_1)
10: U12(tt(),_1) ->= U12^1_tt(_1)
Number of strict rules: 7
Direct POLO(bPol) ... removes: 10 9
      U11	w: 2 * x1 + 2 * x2 + 9
      s 	w: x1
      activate	w: x1
      n__zeros	w: 1
      zeros	w: 1
      U12	w: 2 * x1 + 2 * x2 + 8
      0 	w: 0
      nil	w: 0
      U11^1_tt	w: x1 + 2
      U12^1_tt	w: x1 + 2
      cons	w: x1 + x2
      tt	w: 1
      length	w: x1 + 2
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #U11^1_tt(L) -> #U12^1_tt(activate(L))
   #2: #U11^1_tt(L) -> #activate(L)
   #3: #activate(n__zeros()) -> #zeros()
   #4: #length(cons(N,L)) -> #U11^1_tt(activate(L))
   #5: #length(cons(N,L)) -> #activate(L)
   #6: #U12^1_tt(L) -> #length(activate(L))
   #7: #U12^1_tt(L) -> #activate(L)
Number of SCCs: 1, DPs: 3
  SCC { #1 #4 #6 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #length(cons(N,n__zeros()))	-#4->
  #U11^1_tt(activate(n__zeros()))	--->*
  #U11^1_tt(activate(n__zeros()))	-#1->
  #U12^1_tt(activate(activate(n__zeros())))	--->*
  #U12^1_tt(activate(activate(n__zeros())))	-#6->
  #length(activate(activate(activate(n__zeros()))))	--->*
  #length(cons(0(),n__zeros()))
  Looping with: [ N := 0(); ]