/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(first(0(),Z)) -> mark(nil()) 3: active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) 4: active(sel(0(),cons(X,Z))) -> mark(X) 5: active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) 6: mark(from(X)) -> active(from(mark(X))) 7: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 8: mark(s(X)) -> active(s(mark(X))) 9: mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) 10: mark(0()) -> active(0()) 11: mark(nil()) -> active(nil()) 12: mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) 13: from(mark(X)) -> from(X) 14: from(active(X)) -> from(X) 15: cons(mark(X1),X2) -> cons(X1,X2) 16: cons(X1,mark(X2)) -> cons(X1,X2) 17: cons(active(X1),X2) -> cons(X1,X2) 18: cons(X1,active(X2)) -> cons(X1,X2) 19: s(mark(X)) -> s(X) 20: s(active(X)) -> s(X) 21: first(mark(X1),X2) -> first(X1,X2) 22: first(X1,mark(X2)) -> first(X1,X2) 23: first(active(X1),X2) -> first(X1,X2) 24: first(X1,active(X2)) -> first(X1,X2) 25: sel(mark(X1),X2) -> sel(X1,X2) 26: sel(X1,mark(X2)) -> sel(X1,X2) 27: sel(active(X1),X2) -> sel(X1,X2) 28: sel(X1,active(X2)) -> sel(X1,X2) Number of strict rules: 28 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(first(0(),Z)) -> #mark(nil()) #2: #mark(from(X)) -> #active(from(mark(X))) #3: #mark(from(X)) -> #from(mark(X)) #4: #mark(from(X)) -> #mark(X) #5: #from(mark(X)) -> #from(X) #6: #mark(first(X1,X2)) -> #active(first(mark(X1),mark(X2))) #7: #mark(first(X1,X2)) -> #first(mark(X1),mark(X2)) #8: #mark(first(X1,X2)) -> #mark(X1) #9: #mark(first(X1,X2)) -> #mark(X2) #10: #mark(nil()) -> #active(nil()) #11: #first(X1,active(X2)) -> #first(X1,X2) #12: #first(active(X1),X2) -> #first(X1,X2) #13: #mark(sel(X1,X2)) -> #active(sel(mark(X1),mark(X2))) #14: #mark(sel(X1,X2)) -> #sel(mark(X1),mark(X2)) #15: #mark(sel(X1,X2)) -> #mark(X1) #16: #mark(sel(X1,X2)) -> #mark(X2) #17: #from(active(X)) -> #from(X) #18: #sel(mark(X1),X2) -> #sel(X1,X2) #19: #s(active(X)) -> #s(X) #20: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #21: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #22: #mark(cons(X1,X2)) -> #mark(X1) #23: #mark(0()) -> #active(0()) #24: #active(sel(s(X),cons(Y,Z))) -> #mark(sel(X,Z)) #25: #active(sel(s(X),cons(Y,Z))) -> #sel(X,Z) #26: #sel(X1,active(X2)) -> #sel(X1,X2) #27: #first(X1,mark(X2)) -> #first(X1,X2) #28: #sel(active(X1),X2) -> #sel(X1,X2) #29: #cons(active(X1),X2) -> #cons(X1,X2) #30: #s(mark(X)) -> #s(X) #31: #sel(X1,mark(X2)) -> #sel(X1,X2) #32: #first(mark(X1),X2) -> #first(X1,X2) #33: #cons(X1,mark(X2)) -> #cons(X1,X2) #34: #active(first(s(X),cons(Y,Z))) -> #mark(cons(Y,first(X,Z))) #35: #active(first(s(X),cons(Y,Z))) -> #cons(Y,first(X,Z)) #36: #active(first(s(X),cons(Y,Z))) -> #first(X,Z) #37: #active(from(X)) -> #mark(cons(X,from(s(X)))) #38: #active(from(X)) -> #cons(X,from(s(X))) #39: #active(from(X)) -> #from(s(X)) #40: #active(from(X)) -> #s(X) #41: #mark(s(X)) -> #active(s(mark(X))) #42: #mark(s(X)) -> #s(mark(X)) #43: #mark(s(X)) -> #mark(X) #44: #cons(mark(X1),X2) -> #cons(X1,X2) #45: #active(sel(0(),cons(X,Z))) -> #mark(X) #46: #cons(X1,active(X2)) -> #cons(X1,X2) Number of SCCs: 6, DPs: 30 SCC { #5 #17 } 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 #first w: 0 nil w: 0 mark w: x1 + 1 first w: 0 #from w: x1 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #5 #17 Number of SCCs: 5, DPs: 28 SCC { #19 #30 } 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 #first w: 0 nil w: 0 mark w: x1 + 1 first w: 0 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #19 #30 Number of SCCs: 4, DPs: 26 SCC { #11 #12 #27 #32 } 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 #first w: x1 nil w: 0 mark w: x1 + 1 first w: 0 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #12 #32 Number of SCCs: 4, DPs: 24 SCC { #11 #27 } 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 #first w: x2 nil w: 0 mark w: x1 + 1 first w: 0 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #11 #27 Number of SCCs: 3, DPs: 22 SCC { #18 #26 #28 #31 } 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 #first w: 0 nil w: 0 mark w: x1 + 1 first w: 0 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #26 #31 Number of SCCs: 3, DPs: 20 SCC { #18 #28 } 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 #first w: 0 nil w: 0 mark w: x1 + 1 first w: 0 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #18 #28 Number of SCCs: 2, DPs: 18 SCC { #29 #33 #44 #46 } 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 #first w: 0 nil w: 0 mark w: x1 + 1 first w: 0 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #33 #46 Number of SCCs: 2, DPs: 16 SCC { #29 #44 } 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 #first w: 0 nil w: 0 mark w: x1 + 1 first w: 0 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #29 #44 Number of SCCs: 1, DPs: 14 SCC { #2 #4 #6 #8 #9 #13 #15 #16 #22 #24 #34 #37 #43 #45 } POLO(Sum)... POLO(max)... succeeded. #cons w: 0 s w: x1 #mark w: x1 + 1 0 w: 1 #sel w: 0 from w: x1 + 3 sel w: max(x1 + 1, x2 + 2) #s w: 0 #first w: 0 nil w: 4 mark w: x1 first w: max(x1 + 4, x2 + 3) #from w: 0 active w: x1 cons w: max(x1 + 2, x2) #active w: x1 + 1 USABLE RULES: { 1..28 } Removed DPs: #4 #8 #9 #15 #16 #22 #45 Number of SCCs: 2, DPs: 3 SCC { #43 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 + 1 #mark w: x1 + 1 0 w: 1 #sel w: 0 from w: x1 + 1 sel w: 1 #s w: 0 #first w: 0 nil w: 1 mark w: 1 first w: 1 #from w: 0 active w: 2 cons w: 1 #active w: 0 USABLE RULES: { 15..18 21..28 } Removed DPs: #43 Number of SCCs: 1, DPs: 2 SCC { #13 #24 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. #cons s: [] p: 0 w: max(x2) s s: [1] p: 0 w: x1 #mark s: 1 0 s: [] p: 3 w: 1 #sel s: [1] p: 0 w: x1 from s: [] p: 2 w: x1 sel s: [1] p: 2 w: x1 + x2 + 1 #s s: [] p: 0 w: 1 #first s: [] p: 0 w: x2 nil s: [] p: 4 w: 0 mark s: 1 first s: [] p: 1 w: x2 + 1 #from s: [] p: 0 w: 0 active s: 1 cons s: [] p: 1 w: max(x1, x2) #active s: 1 USABLE RULES: { 1..28 } Removed DPs: #24 Number of SCCs: 0, DPs: 0