/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: s(X) -> n__s(X) 11: dbl(X) -> n__dbl(X) 12: dbls(X) -> n__dbls(X) 13: sel(X1,X2) -> n__sel(X1,X2) 14: indx(X1,X2) -> n__indx(X1,X2) 15: from(X) -> n__from(X) 16: activate(n__s(X)) -> s(X) 17: activate(n__dbl(X)) -> dbl(activate(X)) 18: activate(n__dbls(X)) -> dbls(activate(X)) 19: activate(n__sel(X1,X2)) -> sel(activate(X1),activate(X2)) 20: activate(n__indx(X1,X2)) -> indx(activate(X1),X2) 21: activate(n__from(X)) -> from(X) 22: activate(X) -> X Number of strict rules: 22 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: #sel(s(X),cons(Y,Z)) -> #sel(activate(X),activate(Z)) #4: #sel(s(X),cons(Y,Z)) -> #activate(X) #5: #sel(s(X),cons(Y,Z)) -> #activate(Z) #6: #from(X) -> #activate(X) #7: #from(X) -> #activate(X) #8: #activate(n__indx(X1,X2)) -> #indx(activate(X1),X2) #9: #activate(n__indx(X1,X2)) -> #activate(X1) #10: #sel(0(),cons(X,Y)) -> #activate(X) #11: #activate(n__dbl(X)) -> #dbl(activate(X)) #12: #activate(n__dbl(X)) -> #activate(X) #13: #activate(n__sel(X1,X2)) -> #sel(activate(X1),activate(X2)) #14: #activate(n__sel(X1,X2)) -> #activate(X1) #15: #activate(n__sel(X1,X2)) -> #activate(X2) #16: #activate(n__from(X)) -> #from(X) #17: #activate(n__s(X)) -> #s(X) #18: #indx(cons(X,Y),Z) -> #activate(X) #19: #indx(cons(X,Y),Z) -> #activate(Z) #20: #indx(cons(X,Y),Z) -> #activate(Y) #21: #indx(cons(X,Y),Z) -> #activate(Z) #22: #dbls(cons(X,Y)) -> #activate(X) #23: #dbls(cons(X,Y)) -> #activate(Y) #24: #activate(n__dbls(X)) -> #dbls(activate(X)) #25: #activate(n__dbls(X)) -> #activate(X) Number of SCCs: 1, DPs: 23 SCC { #2..16 #18..25 } Sum... Max... succeeded. s(x1) w: (x1) dbls(x1) w: (11799 + x1) activate(x1) w: (x1) dbl(x1) w: (11799 + x1) indx(x1,x2) w: (max{39470 + x2, 39469 + x1}) n__indx(x1,x2) w: (max{39470 + x2, 39469 + x1}) n__from(x1) w: (8367 + x1) #dbl(x1) w: (1 + x1) #activate(x1) w: (x1) #dbls(x1) w: (5945 + x1) n__dbls(x1) w: (11799 + x1) n__s(x1) w: (x1) n__dbl(x1) w: (11799 + x1) 0() w: (10451) #sel(x1,x2) w: (max{x2, 30613 + x1}) #indx(x1,x2) w: (max{39470 + x2, 3139 + x1}) sel(x1,x2) w: (max{39470 + x2, 39469 + x1}) from(x1) w: (8367 + x1) #s(x1) w: (0) nil() w: (39471) n__sel(x1,x2) w: (max{39470 + x2, 39469 + x1}) #from(x1) w: (1 + x1) cons(x1,x2) w: (max{x2, x1}) USABLE RULES: { 1..22 } Removed DPs: #2 #4 #6 #7 #9 #11..16 #18..25 Number of SCCs: 1, DPs: 1 SCC { #3 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded. s(x1) 3[x1] w: (x1) dbls(x1) 1[] w: (39826 + x1) activate(x1) x1 w: (x1) dbl(x1) 4[x1] w: (39826 + x1) indx(x1,x2) 2[x2] w: (38146 + x2 + x1) n__indx(x1,x2) 2[x2] w: (38146 + x2 + x1) n__from(x1) 1[] w: (21239 + x1) #dbl(x1) 0[] w: (x1) #activate(x1) 0[] w: (1) #dbls(x1) 0[] w: (1) n__dbls(x1) 1[] w: (39826 + x1) n__s(x1) 3[x1] w: (x1) n__dbl(x1) 4[x1] w: (39826 + x1) 0() 0 w: (1) #sel(x1,x2) 3[x1] w: (21239 + x1) #indx(x1,x2) 0[x2,x1] w: (1 + x2 + x1) sel(x1,x2) 3[] w: (x2) from(x1) 1[] w: (21239 + x1) #s(x1) 0[] w: (1) nil() 2 w: (1) n__sel(x1,x2) 3[] w: (x2) #from(x1) 0[] w: (x1) cons(x1,x2) 1[] w: (max{x2, 21238 + x1}) USABLE RULES: { 1..22 } Removed DPs: #3 Number of SCCs: 0, DPs: 0