/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: incr(nil()) -> nil() 2: incr(cons(X,L)) -> cons(s(X),n__incr(activate(L))) 3: adx(nil()) -> nil() 4: adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L)))) 5: nats() -> adx(zeros()) 6: zeros() -> cons(0(),n__zeros()) 7: head(cons(X,L)) -> X 8: tail(cons(X,L)) -> activate(L) 9: incr(X) -> n__incr(X) 10: adx(X) -> n__adx(X) 11: zeros() -> n__zeros() 12: activate(n__incr(X)) -> incr(activate(X)) 13: activate(n__adx(X)) -> adx(activate(X)) 14: activate(n__zeros()) -> zeros() 15: activate(X) -> X Number of strict rules: 15 Direct poly ... removes: 8 3 5 7 incr(x1) w: (x1) s(x1) w: (x1) n__adx(x1) w: (868 + x1) activate(x1) w: (x1) n__zeros() w: (6879) adx(x1) w: (868 + x1) zeros() w: (6879) tail(x1) w: (3 + x1) 0() w: (0) nil() w: (29534) nats() w: (7748) head(x1) w: (1 + x1) cons(x1,x2) w: (x2 + x1) n__incr(x1) w: (x1) Number of strict rules: 11 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #incr(cons(X,L)) -> #activate(L) #2: #activate(n__adx(X)) -> #adx(activate(X)) #3: #activate(n__adx(X)) -> #activate(X) #4: #activate(n__incr(X)) -> #incr(activate(X)) #5: #activate(n__incr(X)) -> #activate(X) #6: #activate(n__zeros()) -> #zeros() #7: #adx(cons(X,L)) -> #incr(cons(X,n__adx(activate(L)))) #8: #adx(cons(X,L)) -> #activate(L) Number of SCCs: 1, DPs: 7 SCC { #1..5 #7 #8 } Sum... succeeded. #adx(x1) w: (32531 + x1) incr(x1) w: (x1) s(x1) w: (1) n__adx(x1) w: (2438 + x1) activate(x1) w: (x1) n__zeros() w: (32286) #activate(x1) w: (30093 + x1) adx(x1) w: (2438 + x1) zeros() w: (32286) tail(x1) w: (0) 0() w: (1) #zeros() w: (0) nil() w: (20163) #incr(x1) w: (30093 + x1) nats() w: (0) head(x1) w: (0) cons(x1,x2) w: (x2) n__incr(x1) w: (x1) USABLE RULES: { 1 2 4 6 9..15 } Removed DPs: #3 #8 Number of SCCs: 1, DPs: 5 SCC { #1 #2 #4 #5 #7 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... succeeded. #adx(x1) w: (max{0, 1064}, -15447) incr(x1) w: (max{0, 20862 + x1_1}, 0) s(x1) w: (max{0, -15329}, -1) n__adx(x1) w: (max{0, 21925}, -1) activate(x1) w: (max{0, x1_1}, 0) n__zeros() w: (15081, -1) #activate(x1) w: (max{0, -20861 + x1_1}, -15447) adx(x1) w: (max{0, 21925}, 0) zeros() w: (15081, -1) tail(x1) w: (0, 0) 0() w: (1, -2) #zeros() w: (0, 0) nil() w: (0, -9048) #incr(x1) w: (max{0, 1 + x1_1}, -15447) nats() w: (0, 0) head(x1) w: (0, 0) cons(x1,x2) w: (max{0, -20862 + x2_1}, -23641 + x1_2) n__incr(x1) w: (max{0, 20862 + x1_1}, -1) USABLE RULES: { 1 2 4 6 9..15 } Removed DPs: #5 Number of SCCs: 1, DPs: 4 SCC { #1 #2 #4 #7 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... found. #adx(cons(X_{1},n__zeros())) -#7-> #incr(cons(X_{1},n__adx(activate(n__zeros())))) --->* #incr(cons(X_{1},n__adx(activate(n__zeros())))) -#1-> #activate(n__adx(activate(n__zeros()))) --->* #activate(n__adx(activate(n__zeros()))) -#2-> #adx(activate(activate(n__zeros()))) --->* #adx(cons(0(),n__zeros())) Looping with: [ X_{1} := 0(); ]