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


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


NO
Input TRS:
    1: a__zeros() -> cons(0(),zeros())
    2: a__U11(tt(),L) -> a__U12(tt(),L)
    3: a__U12(tt(),L) -> s(a__length(mark(L)))
    4: a__length(nil()) -> 0()
    5: a__length(cons(N,L)) -> a__U11(tt(),L)
    6: mark(zeros()) -> a__zeros()
    7: mark(U11(X1,X2)) -> a__U11(mark(X1),X2)
    8: mark(U12(X1,X2)) -> a__U12(mark(X1),X2)
    9: mark(length(X)) -> a__length(mark(X))
    10: mark(cons(X1,X2)) -> cons(mark(X1),X2)
    11: mark(0()) -> 0()
    12: mark(tt()) -> tt()
    13: mark(s(X)) -> s(mark(X))
    14: mark(nil()) -> nil()
    15: a__zeros() -> zeros()
    16: a__U11(X1,X2) -> U11(X1,X2)
    17: a__U12(X1,X2) -> U12(X1,X2)
    18: a__length(X) -> length(X)
Number of strict rules: 18
Direct POLO(bPol) ... removes: 4 15 14 12 11
      U11	w: x1 + x2 + 5
      s 	w: x1
      zeros	w: 1
      U12	w: x1 + x2 + 5
      0 	w: 0
      nil	w: 1
      mark	w: x1 + 6
      a__U11	w: x1 + x2 + 5
      a__U12	w: x1 + x2 + 5
      cons	w: x1 + x2 + 6
      tt	w: 4
      length	w: x1 + 3
      a__zeros	w: 7
      a__length	w: x1 + 3
Number of strict rules: 13
Direct POLO(bPol) ... removes: 18 10 9
      U11	w: x1 + x2
      s 	w: x1
      zeros	w: 1
      U12	w: x1 + x2
      0 	w: 0
      nil	w: 1
      mark	w: 2 * x1 + 1
      a__U11	w: x1 + 2 * x2
      a__U12	w: x1 + 2 * x2
      cons	w: x1 + 2 * x2 + 1
      tt	w: 4
      length	w: x1 + 2
      a__zeros	w: 3
      a__length	w: x1 + 3
Number of strict rules: 10
Direct POLO(bPol) ... removes: 8 16 17 7
      U11	w: 2 * x1 + x2 + 3
      s 	w: x1
      zeros	w: 1
      U12	w: 2 * x1 + x2 + 3
      0 	w: 0
      nil	w: 1
      mark	w: 2 * x1 + 1
      a__U11	w: 2 * x1 + 2 * x2 + 4
      a__U12	w: 2 * x1 + 2 * x2 + 4
      cons	w: x1 + 2 * x2 + 1
      tt	w: 0
      length	w: x1 + 2
      a__zeros	w: 3
      a__length	w: x1 + 3
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Uncurrying a__U12 a__U11
1: a__zeros() -> cons(0(),zeros())
2: a__U11^1_tt(L) -> a__U12^1_tt(L)
3: a__U12^1_tt(L) -> s(a__length(mark(L)))
5: a__length(cons(N,L)) -> a__U11^1_tt(L)
6: mark(zeros()) -> a__zeros()
13: mark(s(X)) -> s(mark(X))
19: a__U11(tt(),_1) ->= a__U11^1_tt(_1)
20: a__U12(tt(),_1) ->= a__U12^1_tt(_1)
Number of strict rules: 6
Direct POLO(bPol) ... removes: 19 20
      U11	w: x1 + x2
      s 	w: x1
      zeros	w: 1
      U12	w: x1 + x2
      0 	w: 0
      nil	w: 0
      a__U12^1_tt	w: x1 + 1
      mark	w: x1 + 1
      a__U11	w: 2 * x1 + 2 * x2 + 4
      a__U11^1_tt	w: x1 + 1
      a__U12	w: 2 * x1 + 2 * x2 + 3
      cons	w: x1 + x2 + 1
      tt	w: 1
      length	w: x1
      a__zeros	w: 2
      a__length	w: x1
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #a__U11^1_tt(L) -> #a__U12^1_tt(L)
   #2: #mark(zeros()) -> #a__zeros()
   #3: #mark(s(X)) -> #mark(X)
   #4: #a__length(cons(N,L)) -> #a__U11^1_tt(L)
   #5: #a__U12^1_tt(L) -> #a__length(mark(L))
   #6: #a__U12^1_tt(L) -> #mark(L)
Number of SCCs: 2, DPs: 4
  SCC { #3 }
POLO(Sum)... succeeded.
      U11	w: 0
      s 	w: x1 + 1
      #a__U12^1_tt	w: 0
      zeros	w: 0
      U12	w: 0
      #mark	w: x1
      0 	w: 0
      #a__zeros	w: 0
      nil	w: 0
      a__U12^1_tt	w: 0
      mark	w: 0
      a__U11	w: 0
      a__U11^1_tt	w: 0
      #a__length	w: 0
      a__U12	w: 0
      #a__U11^1_tt	w: 0
      cons	w: 0
      tt	w: 0
      length	w: 0
      a__zeros	w: 0
      a__length	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 3
  SCC { #1 #4 #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #a__length(cons(N,zeros()))	-#4->
  #a__U11^1_tt(zeros())	--->*
  #a__U11^1_tt(zeros())	-#1->
  #a__U12^1_tt(zeros())	--->*
  #a__U12^1_tt(zeros())	-#5->
  #a__length(mark(zeros()))	--->*
  #a__length(cons(0(),zeros()))
  Looping with: [ N := 0(); ]