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