/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: eq(n__0(),n__0()) -> true() 2: eq(n__s(X),n__s(Y)) -> eq(activate(X),activate(Y)) 3: eq(X,Y) -> false() 4: inf(X) -> cons(X,n__inf(n__s(X))) 5: take(0(),X) -> nil() 6: take(s(X),cons(Y,L)) -> cons(activate(Y),n__take(activate(X),activate(L))) 7: length(nil()) -> 0() 8: length(cons(X,L)) -> s(n__length(activate(L))) 9: 0() -> n__0() 10: s(X) -> n__s(X) 11: inf(X) -> n__inf(X) 12: take(X1,X2) -> n__take(X1,X2) 13: length(X) -> n__length(X) 14: activate(n__0()) -> 0() 15: activate(n__s(X)) -> s(X) 16: activate(n__inf(X)) -> inf(activate(X)) 17: activate(n__take(X1,X2)) -> take(activate(X1),activate(X2)) 18: activate(n__length(X)) -> length(activate(X)) 19: activate(X) -> X Number of strict rules: 19 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #eq(n__s(X),n__s(Y)) -> #eq(activate(X),activate(Y)) #2: #eq(n__s(X),n__s(Y)) -> #activate(X) #3: #eq(n__s(X),n__s(Y)) -> #activate(Y) #4: #take(s(X),cons(Y,L)) -> #activate(Y) #5: #take(s(X),cons(Y,L)) -> #activate(X) #6: #take(s(X),cons(Y,L)) -> #activate(L) #7: #activate(n__0()) -> #0() #8: #length(nil()) -> #0() #9: #activate(n__take(X1,X2)) -> #take(activate(X1),activate(X2)) #10: #activate(n__take(X1,X2)) -> #activate(X1) #11: #activate(n__take(X1,X2)) -> #activate(X2) #12: #activate(n__inf(X)) -> #inf(activate(X)) #13: #activate(n__inf(X)) -> #activate(X) #14: #length(cons(X,L)) -> #s(n__length(activate(L))) #15: #length(cons(X,L)) -> #activate(L) #16: #activate(n__s(X)) -> #s(X) #17: #activate(n__length(X)) -> #length(activate(X)) #18: #activate(n__length(X)) -> #activate(X) Number of SCCs: 2, DPs: 11 SCC { #1 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.