/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(from(X)) -> mark(cons(X,from(s(X)))) 2: active(sel(0(),cons(X,Y))) -> mark(X) 3: active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) 4: mark(from(X)) -> active(from(mark(X))) 5: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 6: mark(s(X)) -> active(s(mark(X))) 7: mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) 8: mark(0()) -> active(0()) 9: from(mark(X)) -> from(X) 10: from(active(X)) -> from(X) 11: cons(mark(X1),X2) -> cons(X1,X2) 12: cons(X1,mark(X2)) -> cons(X1,X2) 13: cons(active(X1),X2) -> cons(X1,X2) 14: cons(X1,active(X2)) -> cons(X1,X2) 15: s(mark(X)) -> s(X) 16: s(active(X)) -> s(X) 17: sel(mark(X1),X2) -> sel(X1,X2) 18: sel(X1,mark(X2)) -> sel(X1,X2) 19: sel(active(X1),X2) -> sel(X1,X2) 20: sel(X1,active(X2)) -> sel(X1,X2) Number of strict rules: 20 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(sel(0(),cons(X,Y))) -> #mark(X) #2: #mark(s(X)) -> #active(s(mark(X))) #3: #mark(s(X)) -> #s(mark(X)) #4: #mark(s(X)) -> #mark(X) #5: #cons(active(X1),X2) -> #cons(X1,X2) #6: #from(mark(X)) -> #from(X) #7: #cons(mark(X1),X2) -> #cons(X1,X2) #8: #cons(X1,mark(X2)) -> #cons(X1,X2) #9: #cons(X1,active(X2)) -> #cons(X1,X2) #10: #sel(X1,active(X2)) -> #sel(X1,X2) #11: #mark(sel(X1,X2)) -> #active(sel(mark(X1),mark(X2))) #12: #mark(sel(X1,X2)) -> #sel(mark(X1),mark(X2)) #13: #mark(sel(X1,X2)) -> #mark(X1) #14: #mark(sel(X1,X2)) -> #mark(X2) #15: #from(active(X)) -> #from(X) #16: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #17: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #18: #mark(cons(X1,X2)) -> #mark(X1) #19: #sel(mark(X1),X2) -> #sel(X1,X2) #20: #sel(active(X1),X2) -> #sel(X1,X2) #21: #s(active(X)) -> #s(X) #22: #active(sel(s(X),cons(Y,Z))) -> #mark(sel(X,Z)) #23: #active(sel(s(X),cons(Y,Z))) -> #sel(X,Z) #24: #active(from(X)) -> #mark(cons(X,from(s(X)))) #25: #active(from(X)) -> #cons(X,from(s(X))) #26: #active(from(X)) -> #from(s(X)) #27: #active(from(X)) -> #s(X) #28: #mark(0()) -> #active(0()) #29: #s(mark(X)) -> #s(X) #30: #mark(from(X)) -> #active(from(mark(X))) #31: #mark(from(X)) -> #from(mark(X)) #32: #mark(from(X)) -> #mark(X) #33: #sel(X1,mark(X2)) -> #sel(X1,X2) Number of SCCs: 5, DPs: 22 SCC { #6 #15 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 mark w: x1 + 1 #from w: x1 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #6 #15 Number of SCCs: 4, DPs: 20 SCC { #21 #29 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: x1 mark w: x1 + 1 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #21 #29 Number of SCCs: 3, DPs: 18 SCC { #5 #7..9 } POLO(Sum)... succeeded. #cons w: x2 s w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #8 #9 Number of SCCs: 3, DPs: 16 SCC { #5 #7 } POLO(Sum)... succeeded. #cons w: x1 s w: 0 #mark w: 0 0 w: 0 #sel w: 0 from w: 0 sel w: 0 #s w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #5 #7 Number of SCCs: 2, DPs: 14 SCC { #10 #19 #20 #33 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #mark w: 0 0 w: 0 #sel w: x2 from w: 0 sel w: 0 #s w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #10 #33 Number of SCCs: 2, DPs: 12 SCC { #19 #20 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #mark w: 0 0 w: 0 #sel w: x1 from w: 0 sel w: 0 #s w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #19 #20 Number of SCCs: 1, DPs: 10 SCC { #1 #4 #11 #13 #14 #18 #22 #24 #30 #32 } POLO(Sum)... POLO(max)... succeeded. #cons w: 0 s w: x1 #mark w: x1 0 w: 1 #sel w: 0 from w: x1 + 3 sel w: max(x1 + 2, x2 + 1) #s w: 0 mark w: x1 #from w: 0 active w: x1 cons w: max(x1 + 2, x2) #active w: x1 USABLE RULES: { 1..20 } Removed DPs: #1 #13 #14 #18 #32 Number of SCCs: 2, DPs: 3 SCC { #4 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 + 1 #mark w: x1 + 1 0 w: 1 #sel w: 0 from w: 1 sel w: 1 #s w: 0 mark w: 0 #from w: 0 active w: 0 cons w: 1 #active w: 0 USABLE RULES: { 1..14 17..20 } Removed DPs: #4 Number of SCCs: 1, DPs: 2 SCC { #11 #22 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. #cons s: [1] p: 0 w: max(x1 + 1) s s: [1] p: 0 w: x1 #mark s: 1 0 s: [] p: 0 w: 1 #sel s: [2] p: 0 w: x2 + 1 from s: [1] p: 3 w: x1 + 2 sel s: [1] p: 0 w: x1 + x2 + 2 #s s: [] p: 0 w: 1 mark s: 1 #from s: [] p: 0 w: 0 active s: 1 cons s: [] p: 3 w: max(x1 + 1, x2) #active s: 1 USABLE RULES: { 1..20 } Removed DPs: #22 Number of SCCs: 0, DPs: 0