/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: dbl(0()) -> 0() 2: dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) 3: dbls(nil()) -> nil() 4: dbls(cons(X,Y)) -> cons(n__dbl(activate(X)),n__dbls(activate(Y))) 5: sel(0(),cons(X,Y)) -> activate(X) 6: sel(s(X),cons(Y,Z)) -> sel(activate(X),activate(Z)) 7: indx(nil(),X) -> nil() 8: indx(cons(X,Y),Z) -> cons(n__sel(activate(X),activate(Z)),n__indx(activate(Y),activate(Z))) 9: from(X) -> cons(activate(X),n__from(n__s(activate(X)))) 10: dbl1(0()) -> 01() 11: dbl1(s(X)) -> s1(s1(dbl1(activate(X)))) 12: sel1(0(),cons(X,Y)) -> activate(X) 13: sel1(s(X),cons(Y,Z)) -> sel1(activate(X),activate(Z)) 14: quote(0()) -> 01() 15: quote(s(X)) -> s1(quote(activate(X))) 16: quote(dbl(X)) -> dbl1(X) 17: quote(sel(X,Y)) -> sel1(X,Y) 18: s(X) -> n__s(X) 19: dbl(X) -> n__dbl(X) 20: dbls(X) -> n__dbls(X) 21: sel(X1,X2) -> n__sel(X1,X2) 22: indx(X1,X2) -> n__indx(X1,X2) 23: from(X) -> n__from(X) 24: activate(n__s(X)) -> s(X) 25: activate(n__dbl(X)) -> dbl(X) 26: activate(n__dbls(X)) -> dbls(X) 27: activate(n__sel(X1,X2)) -> sel(X1,X2) 28: activate(n__indx(X1,X2)) -> indx(X1,X2) 29: activate(n__from(X)) -> from(X) 30: activate(X) -> X Number of strict rules: 30 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #dbl(s(X)) -> #s(n__s(n__dbl(activate(X)))) #2: #dbl(s(X)) -> #activate(X) #3: #activate(n__from(X)) -> #from(X) #4: #sel(s(X),cons(Y,Z)) -> #sel(activate(X),activate(Z)) #5: #sel(s(X),cons(Y,Z)) -> #activate(X) #6: #sel(s(X),cons(Y,Z)) -> #activate(Z) #7: #sel1(s(X),cons(Y,Z)) -> #sel1(activate(X),activate(Z)) #8: #sel1(s(X),cons(Y,Z)) -> #activate(X) #9: #sel1(s(X),cons(Y,Z)) -> #activate(Z) #10: #from(X) -> #activate(X) #11: #from(X) -> #activate(X) #12: #dbl1(s(X)) -> #dbl1(activate(X)) #13: #dbl1(s(X)) -> #activate(X) #14: #activate(n__s(X)) -> #s(X) #15: #sel1(0(),cons(X,Y)) -> #activate(X) #16: #activate(n__dbl(X)) -> #dbl(X) #17: #sel(0(),cons(X,Y)) -> #activate(X) #18: #activate(n__indx(X1,X2)) -> #indx(X1,X2) #19: #activate(n__sel(X1,X2)) -> #sel(X1,X2) #20: #quote(sel(X,Y)) -> #sel1(X,Y) #21: #activate(n__dbls(X)) -> #dbls(X) #22: #quote(dbl(X)) -> #dbl1(X) #23: #indx(cons(X,Y),Z) -> #activate(X) #24: #indx(cons(X,Y),Z) -> #activate(Z) #25: #indx(cons(X,Y),Z) -> #activate(Y) #26: #indx(cons(X,Y),Z) -> #activate(Z) #27: #quote(s(X)) -> #quote(activate(X)) #28: #quote(s(X)) -> #activate(X) #29: #dbls(cons(X,Y)) -> #activate(X) #30: #dbls(cons(X,Y)) -> #activate(Y) Number of SCCs: 4, DPs: 21 SCC { #27 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded. #dbl1(x1) 0[] w: (1) 01() 0 w: (0) s(x1) 5[x1] w: (x1) dbls(x1) 2[] w: (52387 + x1) activate(x1) 3[x1] w: (x1) dbl(x1) 6[x1] w: (36462 + x1) indx(x1,x2) 2[] w: (31848 + x2) n__indx(x1,x2) 1[] w: (31848 + x2) n__from(x1) 0[] w: (15925 + x1) #dbl(x1) 0[] w: (1) #activate(x1) 0[] w: (x1) #dbls(x1) 0[] w: (x1) n__dbls(x1) 0[] w: (52387 + x1) n__s(x1) 5[x1] w: (x1) n__dbl(x1) 6[x1] w: (36462 + x1) 0() 0 w: (1) #sel(x1,x2) 0[] w: (1) #indx(x1,x2) 0[x2,x1] w: (1 + x2 + x1) sel(x1,x2) 4[] w: (15923 + x2) from(x1) 2[] w: (15925 + x1) #s(x1) 0[] w: (1) nil() 2 w: (1) dbl1(x1) 0[] w: (1) #sel1(x1,x2) 0[x2,x1] w: (1 + x2 + x1) n__sel(x1,x2) 4[] w: (15923 + x2) #from(x1) 0[] w: (x1) quote(x1) 0[] w: (1) cons(x1,x2) 1[x1,x2] w: (max{x2, 15924 + x1}) #quote(x1) 0[x1] w: (1 + x1) sel1(x1,x2) 0[] w: (1) s1(x1) 0[] w: (x1) USABLE RULES: { 1..9 18..30 } Removed DPs: #27 Number of SCCs: 3, DPs: 20 SCC { #12 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded. #dbl1(x1) 0[x1] w: (1 + x1) 01() 0 w: (0) s(x1) 5[x1] w: (x1) dbls(x1) 2[] w: (3003 + x1) activate(x1) 3[x1] w: (x1) dbl(x1) 6[x1] w: (3 + x1) indx(x1,x2) 2[] w: (31848 + x2) n__indx(x1,x2) 1[] w: (31848 + x2) n__from(x1) 0[] w: (14683 + x1) #dbl(x1) 0[] w: (1) #activate(x1) 0[] w: (x1) #dbls(x1) 0[] w: (x1) n__dbls(x1) 0[] w: (3003 + x1) n__s(x1) 5[x1] w: (x1) n__dbl(x1) 6[x1] w: (3 + x1) 0() 0 w: (1) #sel(x1,x2) 0[] w: (1) #indx(x1,x2) 0[x2,x1] w: (1 + x2 + x1) sel(x1,x2) 4[] w: (1 + x2) from(x1) 2[] w: (14683 + x1) #s(x1) 0[] w: (1) nil() 2 w: (1) dbl1(x1) 0[] w: (1) #sel1(x1,x2) 0[x2,x1] w: (1 + x2 + x1) n__sel(x1,x2) 4[] w: (1 + x2) #from(x1) 0[] w: (x1) quote(x1) 0[] w: (1) cons(x1,x2) 1[x1,x2] w: (max{x2, 2 + x1}) #quote(x1) 0[x1] w: (1 + x1) sel1(x1,x2) 0[] w: (1) s1(x1) 0[] w: (x1) USABLE RULES: { 1..9 18..30 } Removed DPs: #12 Number of SCCs: 2, DPs: 19 SCC { #7 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded. #dbl1(x1) 0[] w: (1) 01() 0 w: (0) s(x1) 4[x1] w: (x1) dbls(x1) 2[] w: (28225 + x1) activate(x1) 1[x1] w: (x1) dbl(x1) 5[x1] w: (x1) indx(x1,x2) 2[] w: (56449 + x2) n__indx(x1,x2) 2[] w: (56449 + x2) n__from(x1) 3[] w: (28225 + x1) #dbl(x1) 0[] w: (1) #activate(x1) 0[] w: (x1) #dbls(x1) 0[] w: (x1) n__dbls(x1) 2[] w: (28225 + x1) n__s(x1) 4[x1] w: (x1) n__dbl(x1) 5[x1] w: (x1) 0() 0 w: (17888) #sel(x1,x2) 0[] w: (1) #indx(x1,x2) 0[x2,x1] w: (1 + x2 + x1) sel(x1,x2) 3[] w: (28224 + x2) from(x1) 3[] w: (28225 + x1) #s(x1) 0[] w: (1) nil() 1 w: (1) dbl1(x1) 0[] w: (1) #sel1(x1,x2) 3[x1] w: (x1) n__sel(x1,x2) 3[] w: (28224 + x2) #from(x1) 0[] w: (x1) quote(x1) 0[] w: (1) cons(x1,x2) 2[] w: (max{x2, 28224 + x1}) #quote(x1) 0[] w: (1) sel1(x1,x2) 0[] w: (1) s1(x1) 0[] w: (x1) USABLE RULES: { 1..9 18..30 } Removed DPs: #7 Number of SCCs: 1, DPs: 18 SCC { #2..6 #10 #11 #16..19 #21 #23..26 #29 #30 } Sum... Max... succeeded. #dbl1(x1) w: (0) 01() w: (0) s(x1) w: (x1) dbls(x1) w: (268 + x1) activate(x1) w: (x1) dbl(x1) w: (134 + x1) indx(x1,x2) w: (max{20827 + x2, 20825 + x1}) n__indx(x1,x2) w: (max{20827 + x2, 20825 + x1}) n__from(x1) w: (284 + x1) #dbl(x1) w: (1275 + x1) #activate(x1) w: (1142 + x1) #dbls(x1) w: (1143 + x1) n__dbls(x1) w: (268 + x1) n__s(x1) w: (x1) n__dbl(x1) w: (134 + x1) 0() w: (1) #sel(x1,x2) w: (max{1144 + x2, 1143 + x1}) #indx(x1,x2) w: (max{21968 + x2, 1143 + x1}) sel(x1,x2) w: (max{20540 + x2, 20825 + x1}) from(x1) w: (284 + x1) #s(x1) w: (0) nil() w: (20828) dbl1(x1) w: (0) #sel1(x1,x2) w: (0) n__sel(x1,x2) w: (max{20540 + x2, 20825 + x1}) #from(x1) w: (1143 + x1) quote(x1) w: (0) cons(x1,x2) w: (max{x2, 284 + x1}) #quote(x1) w: (0) sel1(x1,x2) w: (0) s1(x1) w: (0) USABLE RULES: { 1..9 18..30 } Removed DPs: #2 #3 #5 #6 #10 #11 #16..19 #21 #23..26 #29 #30 Number of SCCs: 1, DPs: 1 SCC { #4 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded. #dbl1(x1) 0[] w: (1) 01() 0 w: (0) s(x1) 5[x1] w: (x1) dbls(x1) 1[x1] w: (243 + x1) activate(x1) x1 w: (x1) dbl(x1) 6[x1] w: (241 + x1) indx(x1,x2) 3[] w: (23990 + x2 + x1) n__indx(x1,x2) 3[] w: (23990 + x2 + x1) n__from(x1) 2[] w: (243 + x1) #dbl(x1) 0[] w: (1) #activate(x1) 0[] w: (x1) #dbls(x1) 0[] w: (x1) n__dbls(x1) 1[x1] w: (243 + x1) n__s(x1) 5[x1] w: (x1) n__dbl(x1) 6[x1] w: (241 + x1) 0() 0 w: (17888) #sel(x1,x2) 4[x1] w: (241 + x1) #indx(x1,x2) 0[x2,x1] w: (1 + x2 + x1) sel(x1,x2) 4[] w: (23747 + x2) from(x1) 2[] w: (243 + x1) #s(x1) 0[] w: (1) nil() 0 w: (1) dbl1(x1) 0[] w: (1) #sel1(x1,x2) 3[] w: (0) n__sel(x1,x2) 4[] w: (23747 + x2) #from(x1) 0[] w: (x1) quote(x1) 0[] w: (1) cons(x1,x2) 1[] w: (max{x2, 242 + x1}) #quote(x1) 0[] w: (1) sel1(x1,x2) 0[] w: (1) s1(x1) 0[] w: (x1) USABLE RULES: { 1..9 18..30 } Removed DPs: #4 Number of SCCs: 0, DPs: 0