/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: f(true(),xs) -> f(isList(xs),append(cons(a(),nil()),xs)) 2: isList(nil()) -> true() 3: isList(cons(x,xs)) -> isList(xs) 4: append(xs,ys) -> appendAkk(reverse(xs),ys) 5: appendAkk(nil(),ys) -> ys 6: appendAkk(cons(x,xs),ys) -> appendAkk(xs,cons(x,ys)) 7: reverse(nil()) -> nil() 8: reverse(cons(x,xs)) -> append(reverse(xs),cons(x,nil())) Number of strict rules: 8 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #appendAkk(cons(x,xs),ys) -> #appendAkk(xs,cons(x,ys)) #2: #isList(cons(x,xs)) -> #isList(xs) #3: #f(true(),xs) -> #f(isList(xs),append(cons(a(),nil()),xs)) #4: #f(true(),xs) -> #isList(xs) #5: #f(true(),xs) -> #append(cons(a(),nil()),xs) #6: #reverse(cons(x,xs)) -> #append(reverse(xs),cons(x,nil())) #7: #reverse(cons(x,xs)) -> #reverse(xs) #8: #append(xs,ys) -> #appendAkk(reverse(xs),ys) #9: #append(xs,ys) -> #reverse(xs) Number of SCCs: 4, DPs: 6 SCC { #2 } Sum... succeeded. a() w: (0) #append(x1,x2) w: (0) #reverse(x1) w: (0) appendAkk(x1,x2) w: (0) reverse(x1) w: (0) true() w: (0) f(x1,x2) w: (0) append(x1,x2) w: (0) isList(x1) w: (0) nil() w: (0) #f(x1,x2) w: (0) #isList(x1) w: (x1) cons(x1,x2) w: (1 + x2) #appendAkk(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #2 Number of SCCs: 3, DPs: 5 SCC { #1 } Sum... succeeded. a() w: (0) #append(x1,x2) w: (0) #reverse(x1) w: (0) appendAkk(x1,x2) w: (0) reverse(x1) w: (0) true() w: (0) f(x1,x2) w: (0) append(x1,x2) w: (0) isList(x1) w: (0) nil() w: (0) #f(x1,x2) w: (0) #isList(x1) w: (0) cons(x1,x2) w: (1 + x2 + x1) #appendAkk(x1,x2) w: (x1) USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 4 SCC { #3 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed.