/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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 poly ... removes: 4 U11(x1,x2) w: (12329 + x2 + 2 * x1) s(x1) w: (x1) activate(x1) w: (x1) n__zeros() w: (11650) zeros() w: (11650) U12(x1,x2) w: (12329 + x2 + 2 * x1) 0() w: (0) nil() w: (1) cons(x1,x2) w: (x2 + x1) tt() w: (1) length(x1) w: (12331 + x1) Number of strict rules: 7 Direct poly ... failed. Freezing 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 poly ... removes: 10 9 U11(x1,x2) w: (x2 + 2 * x1) s(x1) w: (x1) activate(x1) w: (x1) n__zeros() w: (12457) zeros() w: (12457) U12(x1,x2) w: (1 + x2 + x1) U11❆1_tt(x1) w: (1 + x1) 0() w: (0) nil() w: (0) cons(x1,x2) w: (x2 + x1) tt() w: (1) U12❆1_tt(x1) w: (1 + x1) length(x1) w: (1 + x1) Number of strict rules: 7 Direct poly ... 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 } 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())) -#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(); ]