/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(from(X)) -> mark(cons(X,from(s(X)))) 2: active(head(cons(X,XS))) -> mark(X) 3: active(2nd(cons(X,XS))) -> mark(head(XS)) 4: active(take(0(),XS)) -> mark(nil()) 5: active(take(s(N),cons(X,XS))) -> mark(cons(X,take(N,XS))) 6: active(sel(0(),cons(X,XS))) -> mark(X) 7: active(sel(s(N),cons(X,XS))) -> mark(sel(N,XS)) 8: mark(from(X)) -> active(from(mark(X))) 9: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 10: mark(s(X)) -> active(s(mark(X))) 11: mark(head(X)) -> active(head(mark(X))) 12: mark(2nd(X)) -> active(2nd(mark(X))) 13: mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) 14: mark(0()) -> active(0()) 15: mark(nil()) -> active(nil()) 16: mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) 17: from(mark(X)) -> from(X) 18: from(active(X)) -> from(X) 19: cons(mark(X1),X2) -> cons(X1,X2) 20: cons(X1,mark(X2)) -> cons(X1,X2) 21: cons(active(X1),X2) -> cons(X1,X2) 22: cons(X1,active(X2)) -> cons(X1,X2) 23: s(mark(X)) -> s(X) 24: s(active(X)) -> s(X) 25: head(mark(X)) -> head(X) 26: head(active(X)) -> head(X) 27: 2nd(mark(X)) -> 2nd(X) 28: 2nd(active(X)) -> 2nd(X) 29: take(mark(X1),X2) -> take(X1,X2) 30: take(X1,mark(X2)) -> take(X1,X2) 31: take(active(X1),X2) -> take(X1,X2) 32: take(X1,active(X2)) -> take(X1,X2) 33: sel(mark(X1),X2) -> sel(X1,X2) 34: sel(X1,mark(X2)) -> sel(X1,X2) 35: sel(active(X1),X2) -> sel(X1,X2) 36: sel(X1,active(X2)) -> sel(X1,X2) Number of strict rules: 36 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(head(cons(X,XS))) -> #mark(X) #2: #take(mark(X1),X2) -> #take(X1,X2) #3: #sel(active(X1),X2) -> #sel(X1,X2) #4: #active(sel(0(),cons(X,XS))) -> #mark(X) #5: #mark(take(X1,X2)) -> #active(take(mark(X1),mark(X2))) #6: #mark(take(X1,X2)) -> #take(mark(X1),mark(X2)) #7: #mark(take(X1,X2)) -> #mark(X1) #8: #mark(take(X1,X2)) -> #mark(X2) #9: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #10: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #11: #mark(cons(X1,X2)) -> #mark(X1) #12: #mark(head(X)) -> #active(head(mark(X))) #13: #mark(head(X)) -> #head(mark(X)) #14: #mark(head(X)) -> #mark(X) #15: #s(active(X)) -> #s(X) #16: #s(mark(X)) -> #s(X) #17: #mark(2nd(X)) -> #active(2nd(mark(X))) #18: #mark(2nd(X)) -> #2nd(mark(X)) #19: #mark(2nd(X)) -> #mark(X) #20: #take(active(X1),X2) -> #take(X1,X2) #21: #mark(0()) -> #active(0()) #22: #take(X1,mark(X2)) -> #take(X1,X2) #23: #head(mark(X)) -> #head(X) #24: #cons(X1,mark(X2)) -> #cons(X1,X2) #25: #active(sel(s(N),cons(X,XS))) -> #mark(sel(N,XS)) #26: #active(sel(s(N),cons(X,XS))) -> #sel(N,XS) #27: #mark(s(X)) -> #active(s(mark(X))) #28: #mark(s(X)) -> #s(mark(X)) #29: #mark(s(X)) -> #mark(X) #30: #sel(mark(X1),X2) -> #sel(X1,X2) #31: #active(take(s(N),cons(X,XS))) -> #mark(cons(X,take(N,XS))) #32: #active(take(s(N),cons(X,XS))) -> #cons(X,take(N,XS)) #33: #active(take(s(N),cons(X,XS))) -> #take(N,XS) #34: #2nd(active(X)) -> #2nd(X) #35: #cons(X1,active(X2)) -> #cons(X1,X2) #36: #sel(X1,mark(X2)) -> #sel(X1,X2) #37: #2nd(mark(X)) -> #2nd(X) #38: #from(mark(X)) -> #from(X) #39: #take(X1,active(X2)) -> #take(X1,X2) #40: #cons(mark(X1),X2) -> #cons(X1,X2) #41: #head(active(X)) -> #head(X) #42: #sel(X1,active(X2)) -> #sel(X1,X2) #43: #cons(active(X1),X2) -> #cons(X1,X2) #44: #mark(sel(X1,X2)) -> #active(sel(mark(X1),mark(X2))) #45: #mark(sel(X1,X2)) -> #sel(mark(X1),mark(X2)) #46: #mark(sel(X1,X2)) -> #mark(X1) #47: #mark(sel(X1,X2)) -> #mark(X2) #48: #active(2nd(cons(X,XS))) -> #mark(head(XS)) #49: #active(2nd(cons(X,XS))) -> #head(XS) #50: #active(from(X)) -> #mark(cons(X,from(s(X)))) #51: #active(from(X)) -> #cons(X,from(s(X))) #52: #active(from(X)) -> #from(s(X)) #53: #active(from(X)) -> #s(X) #54: #mark(from(X)) -> #active(from(mark(X))) #55: #mark(from(X)) -> #from(mark(X)) #56: #mark(from(X)) -> #mark(X) #57: #mark(nil()) -> #active(nil()) #58: #active(take(0(),XS)) -> #mark(nil()) #59: #from(active(X)) -> #from(X) Number of SCCs: 8, DPs: 40 SCC { #23 #41 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 2nd w: 0 #head w: x1 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 nil w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #23 #41 Number of SCCs: 7, DPs: 38 SCC { #34 #37 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 2nd w: 0 #head w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 nil w: 0 #2nd w: x1 mark w: x1 + 1 #from w: 0 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #34 #37 Number of SCCs: 6, DPs: 36 SCC { #15 #16 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 2nd w: 0 #head w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: x1 nil w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #15 #16 Number of SCCs: 5, DPs: 34 SCC { #38 #59 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 2nd w: 0 #head w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 nil w: 0 #2nd w: 0 mark w: x1 + 1 #from w: x1 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #38 #59 Number of SCCs: 4, DPs: 32 SCC { #3 #30 #36 #42 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 2nd w: 0 #head w: 0 #mark w: 0 0 w: 0 #sel w: x1 from w: 0 sel w: 0 #s w: 0 nil w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #3 #30 Number of SCCs: 4, DPs: 30 SCC { #36 #42 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: 0 take w: 0 2nd w: 0 #head w: 0 #mark w: 0 0 w: 0 #sel w: x2 from w: 0 sel w: 0 #s w: 0 nil w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #36 #42 Number of SCCs: 3, DPs: 28 SCC { #24 #35 #40 #43 } POLO(Sum)... succeeded. #cons w: x2 s w: 0 #take w: 0 take w: 0 2nd w: 0 #head w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 nil w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #24 #35 Number of SCCs: 3, DPs: 26 SCC { #40 #43 } POLO(Sum)... succeeded. #cons w: x1 s w: 0 #take w: 0 take w: 0 2nd w: 0 #head w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 nil w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #40 #43 Number of SCCs: 2, DPs: 24 SCC { #2 #20 #22 #39 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: x2 take w: 0 2nd w: 0 #head w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 nil w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #22 #39 Number of SCCs: 2, DPs: 22 SCC { #2 #20 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #take w: x1 take w: 0 2nd w: 0 #head w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 nil w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 head w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #2 #20 Number of SCCs: 1, DPs: 20 SCC { #1 #4 #5 #7 #8 #11 #12 #14 #17 #19 #25 #29 #31 #44 #46..48 #50 #54 #56 } POLO(Sum)... POLO(max)... succeeded. #cons w: 0 s w: x1 #take w: 0 take w: max(x1 + 2, x2 + 4) 2nd w: x1 + 2 #head w: 0 #mark w: x1 + 1 0 w: 1 #sel w: 0 from w: x1 + 2 sel w: max(x1 + 1, x2 + 2) #s w: 0 nil w: 4 #2nd w: 0 mark w: x1 #from w: 0 active w: x1 head w: x1 + 1 cons w: max(x1 + 1, x2) #active w: x1 + 1 USABLE RULES: { 1..36 } Removed DPs: #1 #4 #7 #8 #11 #14 #19 #46..48 #56 Number of SCCs: 2, DPs: 3 SCC { #29 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 + 1 #take w: 0 take w: x1 + 1 2nd w: 4 #head w: 0 #mark w: x1 + 1 0 w: 4 #sel w: 0 from w: 1 sel w: 4 #s w: 0 nil w: 4 #2nd w: 0 mark w: 4 #from w: 0 active w: x1 + 1 head w: 4 cons w: 1 #active w: 0 USABLE RULES: { 19..22 25 26 33..36 } Removed DPs: #29 Number of SCCs: 1, DPs: 2 SCC { #25 #44 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. #cons s: [1,2] p: 0 w: max(x1, x2 + 1) s s: [1] p: 0 w: x1 #take s: [1] p: 0 w: x1 take s: [1] p: 0 w: x1 + x2 2nd s: [] p: 1 w: x1 + 2 #head s: [] p: 0 w: 1 #mark s: [1] p: 2 w: x1 + 3 0 s: [] p: 3 w: 2 #sel s: [2,1] p: 0 w: x1 + x2 from s: [] p: 1 w: x1 + 2 sel s: [1] p: 2 w: x1 + x2 + 3 #s s: [] p: 0 w: 0 nil s: [] p: 0 w: 1 #2nd s: [] p: 0 w: 0 mark s: 1 #from s: [] p: 0 w: 0 active s: 1 head s: [] p: 2 w: x1 + 1 cons s: [] p: 0 w: max(x1 + 2, x2) #active s: [1] p: 2 w: x1 + 3 USABLE RULES: { 1..36 } Removed DPs: #25 Number of SCCs: 0, DPs: 0