/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: active(zeros()) -> mark(cons(0(),zeros())) 2: active(and(tt(),X)) -> mark(X) 3: active(length(nil())) -> mark(0()) 4: active(length(cons(N,L))) -> mark(s(length(L))) 5: active(take(0(),IL)) -> mark(nil()) 6: active(take(s(M),cons(N,IL))) -> mark(cons(N,take(M,IL))) 7: mark(zeros()) -> active(zeros()) 8: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 9: mark(0()) -> active(0()) 10: mark(and(X1,X2)) -> active(and(mark(X1),X2)) 11: mark(tt()) -> active(tt()) 12: mark(length(X)) -> active(length(mark(X))) 13: mark(nil()) -> active(nil()) 14: mark(s(X)) -> active(s(mark(X))) 15: mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) 16: cons(mark(X1),X2) -> cons(X1,X2) 17: cons(X1,mark(X2)) -> cons(X1,X2) 18: cons(active(X1),X2) -> cons(X1,X2) 19: cons(X1,active(X2)) -> cons(X1,X2) 20: and(mark(X1),X2) -> and(X1,X2) 21: and(X1,mark(X2)) -> and(X1,X2) 22: and(active(X1),X2) -> and(X1,X2) 23: and(X1,active(X2)) -> and(X1,X2) 24: length(mark(X)) -> length(X) 25: length(active(X)) -> length(X) 26: s(mark(X)) -> s(X) 27: s(active(X)) -> s(X) 28: take(mark(X1),X2) -> take(X1,X2) 29: take(X1,mark(X2)) -> take(X1,X2) 30: take(active(X1),X2) -> take(X1,X2) 31: take(X1,active(X2)) -> take(X1,X2) Number of strict rules: 31 Direct POLO(bPol) ... removes: 3 5 2 s w: x1 take w: x1 + x2 + 2 and w: x1 + x2 + 4 zeros w: 1 0 w: 0 nil w: 1 mark w: x1 active w: x1 cons w: x1 + x2 tt w: 1 length w: x1 + 1 Number of strict rules: 28 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #take(X1,mark(X2)) -> #take(X1,X2) #2: #active(take(s(M),cons(N,IL))) -> #mark(cons(N,take(M,IL))) #3: #active(take(s(M),cons(N,IL))) -> #cons(N,take(M,IL)) #4: #active(take(s(M),cons(N,IL))) -> #take(M,IL) #5: #mark(nil()) -> #active(nil()) #6: #mark(0()) -> #active(0()) #7: #mark(tt()) -> #active(tt()) #8: #length(mark(X)) -> #length(X) #9: #and(X1,active(X2)) -> #and(X1,X2) #10: #mark(length(X)) -> #active(length(mark(X))) #11: #mark(length(X)) -> #length(mark(X)) #12: #mark(length(X)) -> #mark(X) #13: #take(X1,active(X2)) -> #take(X1,X2) #14: #mark(s(X)) -> #active(s(mark(X))) #15: #mark(s(X)) -> #s(mark(X)) #16: #mark(s(X)) -> #mark(X) #17: #take(active(X1),X2) -> #take(X1,X2) #18: #length(active(X)) -> #length(X) #19: #and(mark(X1),X2) -> #and(X1,X2) #20: #mark(zeros()) -> #active(zeros()) #21: #mark(and(X1,X2)) -> #active(and(mark(X1),X2)) #22: #mark(and(X1,X2)) -> #and(mark(X1),X2) #23: #mark(and(X1,X2)) -> #mark(X1) #24: #take(mark(X1),X2) -> #take(X1,X2) #25: #and(active(X1),X2) -> #and(X1,X2) #26: #s(active(X)) -> #s(X) #27: #cons(X1,mark(X2)) -> #cons(X1,X2) #28: #cons(X1,active(X2)) -> #cons(X1,X2) #29: #s(mark(X)) -> #s(X) #30: #and(X1,mark(X2)) -> #and(X1,X2) #31: #cons(mark(X1),X2) -> #cons(X1,X2) #32: #active(zeros()) -> #mark(cons(0(),zeros())) #33: #active(zeros()) -> #cons(0(),zeros()) #34: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #35: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #36: #mark(cons(X1,X2)) -> #mark(X1) #37: #mark(take(X1,X2)) -> #active(take(mark(X1),mark(X2))) #38: #mark(take(X1,X2)) -> #take(mark(X1),mark(X2)) #39: #mark(take(X1,X2)) -> #mark(X1) #40: #mark(take(X1,X2)) -> #mark(X2) #41: #active(length(cons(N,L))) -> #mark(s(length(L))) #42: #active(length(cons(N,L))) -> #s(length(L)) #43: #active(length(cons(N,L))) -> #length(L) #44: #cons(active(X1),X2) -> #cons(X1,X2) Number of SCCs: 6, DPs: 28 SCC { #8 #18 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 and w: 0 zeros w: 0 #mark w: 0 0 w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 active w: x1 + 1 cons w: 0 #active w: 0 tt w: 0 length w: 0 #length w: x1 #and w: 0 USABLE RULES: { } Removed DPs: #8 #18 Number of SCCs: 5, DPs: 26 SCC { #26 #29 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 and w: 0 zeros w: 0 #mark w: 0 0 w: 0 #s w: x1 nil w: 0 mark w: x1 + 1 active w: x1 + 1 cons w: 0 #active w: 0 tt w: 0 length w: 0 #length w: 0 #and w: 0 USABLE RULES: { } Removed DPs: #26 #29 Number of SCCs: 4, DPs: 24 SCC { #9 #19 #25 #30 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 and w: 0 zeros w: 0 #mark w: 0 0 w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 active w: x1 + 1 cons w: 0 #active w: 0 tt w: 0 length w: 0 #length w: 0 #and w: x2 USABLE RULES: { } Removed DPs: #9 #30 Number of SCCs: 4, DPs: 22 SCC { #19 #25 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 and w: 0 zeros w: 0 #mark w: 0 0 w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 active w: x1 + 1 cons w: 0 #active w: 0 tt w: 0 length w: 0 #length w: 0 #and w: x1 USABLE RULES: { } Removed DPs: #19 #25 Number of SCCs: 3, DPs: 20 SCC { #27 #28 #31 #44 } POLO(Sum)... succeeded. #cons w: x2 s w: 0 #take w: 0 take w: 0 and w: 0 zeros w: 0 #mark w: 0 0 w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 active w: x1 + 1 cons w: 0 #active w: 0 tt w: 0 length w: 0 #length w: 0 #and w: 0 USABLE RULES: { } Removed DPs: #27 #28 Number of SCCs: 3, DPs: 18 SCC { #31 #44 } POLO(Sum)... succeeded. #cons w: x1 s w: 0 #take w: 0 take w: 0 and w: 0 zeros w: 0 #mark w: 0 0 w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 active w: x1 + 1 cons w: 0 #active w: 0 tt w: 0 length w: 0 #length w: 0 #and w: 0 USABLE RULES: { } Removed DPs: #31 #44 Number of SCCs: 2, DPs: 16 SCC { #1 #13 #17 #24 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: x2 take w: 0 and w: 0 zeros w: 0 #mark w: 0 0 w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 active w: x1 + 1 cons w: 0 #active w: 0 tt w: 0 length w: 0 #length w: 0 #and w: 0 USABLE RULES: { } Removed DPs: #1 #13 Number of SCCs: 2, DPs: 14 SCC { #17 #24 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: x1 take w: 0 and w: 0 zeros w: 0 #mark w: 0 0 w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 active w: x1 + 1 cons w: 0 #active w: 0 tt w: 0 length w: 0 #length w: 0 #and w: 0 USABLE RULES: { } Removed DPs: #17 #24 Number of SCCs: 1, DPs: 12 SCC { #2 #10 #12 #16 #20 #23 #32 #36 #37 #39..41 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 #take w: 0 take w: x1 + x2 + 1 and w: x1 + 1 zeros w: 1 #mark w: x1 0 w: 0 #s w: 0 nil w: 1 mark w: x1 active w: x1 cons w: x1 + x2 #active w: x1 tt w: 1 length w: x1 + 1 #length w: 0 #and w: 0 USABLE RULES: { 1 4 6..31 } Removed DPs: #12 #23 #39 #40 Number of SCCs: 1, DPs: 8 SCC { #2 #10 #16 #20 #32 #36 #37 #41 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 #take w: 0 take w: x1 + x2 + 1 and w: x1 + 1 zeros w: 1 #mark w: x1 0 w: 0 #s w: 0 nil w: 1 mark w: x1 active w: x1 cons w: x1 #active w: x1 tt w: 1 length w: 1 #length w: 0 #and w: 0 USABLE RULES: { 1 4 6..31 } Removed DPs: #2 #32 Number of SCCs: 1, DPs: 4 SCC { #10 #16 #36 #41 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 #take w: 0 take w: 1 and w: x2 + 1 zeros w: 1 #mark w: x1 0 w: 0 #s w: 0 nil w: 1 mark w: x1 + 1 active w: x1 cons w: x1 + x2 + 1 #active w: 1 tt w: 1 length w: 1 #length w: 0 #and w: 0 USABLE RULES: { 16..25 28..31 } Removed DPs: #36 Number of SCCs: 1, DPs: 3 SCC { #10 #16 #41 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.