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