/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: U21(tt(),IL,M,N) -> U22(tt(),activate(IL),activate(M),activate(N))
    5: U22(tt(),IL,M,N) -> U23(tt(),activate(IL),activate(M),activate(N))
    6: U23(tt(),IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL)))
    7: length(nil()) -> 0()
    8: length(cons(N,L)) -> U11(tt(),activate(L))
    9: take(0(),IL) -> nil()
    10: take(s(M),cons(N,IL)) -> U21(tt(),activate(IL),M,N)
    11: zeros() -> n__zeros()
    12: take(X1,X2) -> n__take(X1,X2)
    13: activate(n__zeros()) -> zeros()
    14: activate(n__take(X1,X2)) -> take(X1,X2)
    15: activate(X) -> X
Number of strict rules: 15
Direct poly ... removes: 7 9
  U21(x1,x2,x3,x4)		w: (14136 + x4 + x3 + x2 + x1)
  U11(x1,x2)		w: (x2 + 2 * x1)
  s(x1)		w: (x1)
  activate(x1)		w: (x1)
  take(x1,x2)		w: (16336 + x2 + x1)
  n__zeros()		w: (17525)
  U23(x1,x2,x3,x4)		w: (11936 + x4 + x3 + x2 + 2 * x1)
  zeros()		w: (17525)
  U12(x1,x2)		w: (x2 + 2 * x1)
  0()		w: (0)
  n__take(x1,x2)		w: (16336 + x2 + x1)
  nil()		w: (16335)
  cons(x1,x2)		w: (x2 + x1)
  tt()		w: (2200)
  U22(x1,x2,x3,x4)		w: (14136 + x4 + x3 + x2 + x1)
  length(x1)		w: (4400 + x1)
Number of strict rules: 13
Direct poly ... failed.
Freezing U12 U22 U23 U11 U21
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)))
4: U21❆1_tt(IL,M,N) -> U22❆1_tt(activate(IL),activate(M),activate(N))
5: U22❆1_tt(IL,M,N) -> U23❆1_tt(activate(IL),activate(M),activate(N))
6: U23❆1_tt(IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL)))
8: length(cons(N,L)) -> U11❆1_tt(activate(L))
10: take(s(M),cons(N,IL)) -> U21❆1_tt(activate(IL),M,N)
11: zeros() -> n__zeros()
12: take(X1,X2) -> n__take(X1,X2)
13: activate(n__zeros()) -> zeros()
14: activate(n__take(X1,X2)) -> take(X1,X2)
15: activate(X) -> X
16: U21(tt(),_3,_4,_5) ->= U21❆1_tt(_3,_4,_5)
17: U11(tt(),_1) ->= U11❆1_tt(_1)
18: U23(tt(),_3,_4,_5) ->= U23❆1_tt(_3,_4,_5)
19: U22(tt(),_3,_4,_5) ->= U22❆1_tt(_3,_4,_5)
20: U12(tt(),_1) ->= U12❆1_tt(_1)
Number of strict rules: 13
Direct poly ... removes: 18 16 19 17 20
  U21(x1,x2,x3,x4)		w: (24168 + x4 + 2 * x3 + x2 + 2 * x1)
  U11(x1,x2)		w: (14 + 2 * x2 + x1)
  s(x1)		w: (x1)
  activate(x1)		w: (x1)
  take(x1,x2)		w: (2 + x2 + 2 * x1)
  n__zeros()		w: (12831)
  U21❆1_tt(x1,x2,x3)		w: (2 + x3 + 2 * x2 + x1)
  U23(x1,x2,x3,x4)		w: (2 + x4 + 2 * x3 + x2 + x1)
  zeros()		w: (12831)
  U12(x1,x2)		w: (12236 + 2 * x2 + 2 * x1)
  U11❆1_tt(x1)		w: (2 + 2 * x1)
  U22❆1_tt(x1,x2,x3)		w: (2 + x3 + 2 * x2 + x1)
  0()		w: (0)
  n__take(x1,x2)		w: (2 + x2 + 2 * x1)
  nil()		w: (0)
  cons(x1,x2)		w: (x2 + x1)
  tt()		w: (1)
  U23❆1_tt(x1,x2,x3)		w: (2 + x3 + 2 * x2 + x1)
  U12❆1_tt(x1)		w: (2 + 2 * x1)
  U22(x1,x2,x3,x4)		w: (2 + x4 + 2 * x3 + x2 + x1)
  length(x1)		w: (2 + 2 * x1)
Number of strict rules: 13
Direct poly ... failed.
Dependency Pairs:
   #1: #U11❆1_tt(L) -> #U12❆1_tt(activate(L))
   #2: #U11❆1_tt(L) -> #activate(L)
   #3: #U23❆1_tt(IL,M,N) -> #activate(N)
   #4: #U23❆1_tt(IL,M,N) -> #activate(M)
   #5: #U23❆1_tt(IL,M,N) -> #activate(IL)
   #6: #activate(n__zeros()) -> #zeros()
   #7: #activate(n__take(X1,X2)) -> #take(X1,X2)
   #8: #take(s(M),cons(N,IL)) -> #U21❆1_tt(activate(IL),M,N)
   #9: #take(s(M),cons(N,IL)) -> #activate(IL)
   #10: #U22❆1_tt(IL,M,N) -> #U23❆1_tt(activate(IL),activate(M),activate(N))
   #11: #U22❆1_tt(IL,M,N) -> #activate(IL)
   #12: #U22❆1_tt(IL,M,N) -> #activate(M)
   #13: #U22❆1_tt(IL,M,N) -> #activate(N)
   #14: #U12❆1_tt(L) -> #length(activate(L))
   #15: #U12❆1_tt(L) -> #activate(L)
   #16: #length(cons(N,L)) -> #U11❆1_tt(activate(L))
   #17: #length(cons(N,L)) -> #activate(L)
   #18: #U21❆1_tt(IL,M,N) -> #U22❆1_tt(activate(IL),activate(M),activate(N))
   #19: #U21❆1_tt(IL,M,N) -> #activate(IL)
   #20: #U21❆1_tt(IL,M,N) -> #activate(M)
   #21: #U21❆1_tt(IL,M,N) -> #activate(N)
Number of SCCs: 2, DPs: 17
	SCC { #1 #14 #16 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  found.
  #length(cons(N,n__zeros()))	-#16->
  #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())))	-#14->
  #length(activate(activate(activate(n__zeros()))))	--->*
  #length(cons(0(),n__zeros()))
  Looping with: [ N := 0(); ]