/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: active(from(X)) -> from(active(X)) 5: active(cons(X1,X2)) -> cons(active(X1),X2) 6: active(s(X)) -> s(active(X)) 7: active(sel(X1,X2)) -> sel(active(X1),X2) 8: active(sel(X1,X2)) -> sel(X1,active(X2)) 9: from(mark(X)) -> mark(from(X)) 10: cons(mark(X1),X2) -> mark(cons(X1,X2)) 11: s(mark(X)) -> mark(s(X)) 12: sel(mark(X1),X2) -> mark(sel(X1,X2)) 13: sel(X1,mark(X2)) -> mark(sel(X1,X2)) 14: proper(from(X)) -> from(proper(X)) 15: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 16: proper(s(X)) -> s(proper(X)) 17: proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) 18: proper(0()) -> ok(0()) 19: from(ok(X)) -> ok(from(X)) 20: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 21: s(ok(X)) -> ok(s(X)) 22: sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) 23: top(mark(X)) -> top(proper(X)) 24: top(ok(X)) -> top(active(X)) Number of strict rules: 24 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #active(s(X)) -> #s(active(X)) #2: #active(s(X)) -> #active(X) #3: #sel(X1,mark(X2)) -> #sel(X1,X2) #4: #from(mark(X)) -> #from(X) #5: #s(mark(X)) -> #s(X) #6: #top(ok(X)) -> #top(active(X)) #7: #top(ok(X)) -> #active(X) #8: #top(mark(X)) -> #top(proper(X)) #9: #top(mark(X)) -> #proper(X) #10: #sel(mark(X1),X2) -> #sel(X1,X2) #11: #proper(from(X)) -> #from(proper(X)) #12: #proper(from(X)) -> #proper(X) #13: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #14: #active(sel(X1,X2)) -> #sel(active(X1),X2) #15: #active(sel(X1,X2)) -> #active(X1) #16: #cons(mark(X1),X2) -> #cons(X1,X2) #17: #active(cons(X1,X2)) -> #cons(active(X1),X2) #18: #active(cons(X1,X2)) -> #active(X1) #19: #sel(ok(X1),ok(X2)) -> #sel(X1,X2) #20: #proper(sel(X1,X2)) -> #sel(proper(X1),proper(X2)) #21: #proper(sel(X1,X2)) -> #proper(X1) #22: #proper(sel(X1,X2)) -> #proper(X2) #23: #from(ok(X)) -> #from(X) #24: #s(ok(X)) -> #s(X) #25: #proper(s(X)) -> #s(proper(X)) #26: #proper(s(X)) -> #proper(X) #27: #active(sel(s(X),cons(Y,Z))) -> #sel(X,Z) #28: #active(from(X)) -> #cons(X,from(s(X))) #29: #active(from(X)) -> #from(s(X)) #30: #active(from(X)) -> #s(X) #31: #active(sel(X1,X2)) -> #sel(X1,active(X2)) #32: #active(sel(X1,X2)) -> #active(X2) #33: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #34: #proper(cons(X1,X2)) -> #proper(X1) #35: #proper(cons(X1,X2)) -> #proper(X2) #36: #active(from(X)) -> #from(active(X)) #37: #active(from(X)) -> #active(X) Number of SCCs: 7, DPs: 22 SCC { #5 #24 } Sum... succeeded. #cons(x1,x2) w: (0) s(x1) w: (0) top(x1) w: (0) #top(x1) w: (0) proper(x1) w: (0) ok(x1) w: (1 + x1) 0() w: (0) #sel(x1,x2) w: (0) from(x1) w: (0) sel(x1,x2) w: (0) #s(x1) w: (x1) mark(x1) w: (1 + x1) #proper(x1) w: (0) #from(x1) w: (0) active(x1) w: (0) cons(x1,x2) w: (0) #active(x1) w: (0) USABLE RULES: { } Removed DPs: #5 #24 Number of SCCs: 6, DPs: 20 SCC { #4 #23 } Sum... succeeded. #cons(x1,x2) w: (0) s(x1) w: (0) top(x1) w: (0) #top(x1) w: (0) proper(x1) w: (0) ok(x1) w: (1 + x1) 0() w: (0) #sel(x1,x2) w: (0) from(x1) w: (0) sel(x1,x2) w: (0) #s(x1) w: (0) mark(x1) w: (1 + x1) #proper(x1) w: (0) #from(x1) w: (x1) active(x1) w: (0) cons(x1,x2) w: (0) #active(x1) w: (0) USABLE RULES: { } Removed DPs: #4 #23 Number of SCCs: 5, DPs: 18 SCC { #6 #8 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded. #cons(x1,x2) 0[] w: (max{0, x1}) s(x1) 4[x1] w: (x1) top(x1) 0[] w: (1) #top(x1) 0[x1] w: (x1) proper(x1) x1 w: (x1) ok(x1) x1 w: (x1) 0() 1 w: (20538) #sel(x1,x2) 0[] w: (x2) from(x1) 6[x1] w: (15924 + x1) sel(x1,x2) 6[x1,x2] w: (15922 + x2 + x1) #s(x1) 0[] w: (1) mark(x1) 4[x1] w: (x1) #proper(x1) 0[] w: (x1) #from(x1) 0[] w: (x1) active(x1) x1 w: (x1) cons(x1,x2) 5[x1] w: (max{x2, 15923 + x1}) #active(x1) 0[] w: (1) USABLE RULES: { 1..22 } Removed DPs: #8 Number of SCCs: 5, DPs: 17 SCC { #6 } Sum... succeeded. #cons(x1,x2) w: (0) s(x1) w: (1 + x1) top(x1) w: (0) #top(x1) w: (x1) proper(x1) w: (3 + x1) ok(x1) w: (3 + x1) 0() w: (31892) #sel(x1,x2) w: (0) from(x1) w: (26286 + x1) sel(x1,x2) w: (1 + x1) #s(x1) w: (0) mark(x1) w: (1) #proper(x1) w: (0) #from(x1) w: (0) active(x1) w: (2 + x1) cons(x1,x2) w: (17678 + x1) #active(x1) w: (0) USABLE RULES: { 1..22 } Removed DPs: #6 Number of SCCs: 4, DPs: 16 SCC { #13 #16 } Sum... succeeded. #cons(x1,x2) w: (12617 + x2) s(x1) w: (21238 + x1) top(x1) w: (0) #top(x1) w: (x1) proper(x1) w: (1 + x1) ok(x1) w: (1 + x1) 0() w: (23612) #sel(x1,x2) w: (0) from(x1) w: (26286 + x1) sel(x1,x2) w: (1 + x1) #s(x1) w: (0) mark(x1) w: (1) #proper(x1) w: (0) #from(x1) w: (0) active(x1) w: (16908 + x1) cons(x1,x2) w: (1 + x1) #active(x1) w: (0) USABLE RULES: { 1..22 } Removed DPs: #13 Number of SCCs: 4, DPs: 15 SCC { #16 } Sum... succeeded. #cons(x1,x2) w: (12617 + x1) s(x1) w: (29405 + x1) top(x1) w: (0) #top(x1) w: (0) proper(x1) w: (1 + x1) ok(x1) w: (2 + x1) 0() w: (12280) #sel(x1,x2) w: (0) from(x1) w: (1 + x1) sel(x1,x2) w: (1 + x1) #s(x1) w: (0) mark(x1) w: (1 + x1) #proper(x1) w: (0) #from(x1) w: (0) active(x1) w: (1 + x1) cons(x1,x2) w: (x1) #active(x1) w: (0) USABLE RULES: { 1 9..11 19..21 } Removed DPs: #16 Number of SCCs: 3, DPs: 14 SCC { #3 #10 #19 } Sum... succeeded. #cons(x1,x2) w: (12617) s(x1) w: (1 + x1) top(x1) w: (0) #top(x1) w: (0) proper(x1) w: (1 + x1) ok(x1) w: (2 + x1) 0() w: (1) #sel(x1,x2) w: (x2) from(x1) w: (1 + x1) sel(x1,x2) w: (21653 + x1) #s(x1) w: (0) mark(x1) w: (1 + x1) #proper(x1) w: (0) #from(x1) w: (0) active(x1) w: (1 + x1) cons(x1,x2) w: (x1) #active(x1) w: (0) USABLE RULES: { 1 9..11 19..21 } Removed DPs: #3 #19 Number of SCCs: 3, DPs: 12 SCC { #10 } Sum... succeeded. #cons(x1,x2) w: (12617) s(x1) w: (1 + x1) top(x1) w: (0) #top(x1) w: (0) proper(x1) w: (1 + x1) ok(x1) w: (16705 + x1) 0() w: (1) #sel(x1,x2) w: (x1) from(x1) w: (1 + x1) sel(x1,x2) w: (4684 + x1) #s(x1) w: (0) mark(x1) w: (1 + x1) #proper(x1) w: (0) #from(x1) w: (0) active(x1) w: (13214 + x1) cons(x1,x2) w: (x1) #active(x1) w: (0) USABLE RULES: { 1 9..11 19..21 } Removed DPs: #10 Number of SCCs: 2, DPs: 11 SCC { #2 #15 #18 #32 #37 } Sum... succeeded. #cons(x1,x2) w: (12617) s(x1) w: (1 + x1) top(x1) w: (0) #top(x1) w: (0) proper(x1) w: (x1) ok(x1) w: (3) 0() w: (2) #sel(x1,x2) w: (0) from(x1) w: (240 + x1) sel(x1,x2) w: (1 + x2 + x1) #s(x1) w: (0) mark(x1) w: (9031) #proper(x1) w: (0) #from(x1) w: (0) active(x1) w: (13214 + x1) cons(x1,x2) w: (1 + x1) #active(x1) w: (x1) USABLE RULES: { 1 9..11 19..21 } Removed DPs: #2 #15 #18 #32 #37 Number of SCCs: 1, DPs: 6 SCC { #12 #21 #22 #26 #34 #35 } Sum... succeeded. #cons(x1,x2) w: (12617) s(x1) w: (1 + x1) top(x1) w: (0) #top(x1) w: (0) proper(x1) w: (x1) ok(x1) w: (21395) 0() w: (21394) #sel(x1,x2) w: (0) from(x1) w: (1 + x1) sel(x1,x2) w: (1 + x2 + x1) #s(x1) w: (0) mark(x1) w: (1) #proper(x1) w: (x1) #from(x1) w: (0) active(x1) w: (1 + x1) cons(x1,x2) w: (1 + x2 + x1) #active(x1) w: (0) USABLE RULES: { 1 9..11 19..21 } Removed DPs: #12 #21 #22 #26 #34 #35 Number of SCCs: 0, DPs: 0