/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: and(tt(),X) -> activate(X) 3: length(nil()) -> 0() 4: length(cons(N,L)) -> s(length(activate(L))) 5: take(0(),IL) -> nil() 6: take(s(M),cons(N,IL)) -> cons(N,n__take(M,activate(IL))) 7: zeros() -> n__zeros() 8: take(X1,X2) -> n__take(X1,X2) 9: activate(n__zeros()) -> zeros() 10: activate(n__take(X1,X2)) -> take(activate(X1),activate(X2)) 11: activate(X) -> X Number of strict rules: 11 Direct poly ... removes: 3 5 2 s(x1) w: (x1) activate(x1) w: (x1) take(x1,x2) w: (21657 + x2 + x1) and(x1,x2) w: (x2 + x1) n__zeros() w: (31892) zeros() w: (31892) 0() w: (0) n__take(x1,x2) w: (21657 + x2 + x1) nil() w: (1) cons(x1,x2) w: (x2 + x1) tt() w: (1) length(x1) w: (1 + x1) Number of strict rules: 8 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #take(s(M),cons(N,IL)) -> #activate(IL) #2: #activate(n__zeros()) -> #zeros() #3: #activate(n__take(X1,X2)) -> #take(activate(X1),activate(X2)) #4: #activate(n__take(X1,X2)) -> #activate(X1) #5: #activate(n__take(X1,X2)) -> #activate(X2) #6: #length(cons(N,L)) -> #length(activate(L)) #7: #length(cons(N,L)) -> #activate(L) Number of SCCs: 2, DPs: 5 SCC { #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())) -#6-> #length(activate(n__zeros())) --->* #length(cons(0(),n__zeros())) Looping with: [ N := 0(); ]