/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: cond1(true(),x,y) -> cond2(gr(x,y),x,y) 2: cond2(true(),x,y) -> cond1(neq(x,0()),y,y) 3: cond2(false(),x,y) -> cond1(neq(x,0()),p(x),y) 4: gr(0(),x) -> false() 5: gr(s(x),0()) -> true() 6: gr(s(x),s(y)) -> gr(x,y) 7: neq(0(),0()) -> false() 8: neq(0(),s(x)) -> true() 9: neq(s(x),0()) -> true() 10: neq(s(x),s(y)) -> neq(x,y) 11: p(0()) -> 0() 12: p(s(x)) -> x Number of strict rules: 12 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #cond2(true(),x,y) -> #cond1(neq(x,0()),y,y) #2: #cond2(true(),x,y) -> #neq(x,0()) #3: #gr(s(x),s(y)) -> #gr(x,y) #4: #neq(s(x),s(y)) -> #neq(x,y) #5: #cond2(false(),x,y) -> #cond1(neq(x,0()),p(x),y) #6: #cond2(false(),x,y) -> #neq(x,0()) #7: #cond2(false(),x,y) -> #p(x) #8: #cond1(true(),x,y) -> #cond2(gr(x,y),x,y) #9: #cond1(true(),x,y) -> #gr(x,y) Number of SCCs: 3, DPs: 5 SCC { #4 } Sum... succeeded. neq(x1,x2) w: (0) cond2(x1,x2,x3) w: (0) s(x1) w: (1 + x1) #cond1(x1,x2,x3) w: (0) false() w: (0) #p(x1) w: (0) true() w: (0) cond1(x1,x2,x3) w: (0) p(x1) w: (0) 0() w: (0) #gr(x1,x2) w: (0) #neq(x1,x2) w: (x2 + x1) #cond2(x1,x2,x3) w: (0) gr(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #4 Number of SCCs: 2, DPs: 4 SCC { #3 } Sum... succeeded. neq(x1,x2) w: (0) cond2(x1,x2,x3) w: (0) s(x1) w: (1 + x1) #cond1(x1,x2,x3) w: (0) false() w: (0) #p(x1) w: (0) true() w: (0) cond1(x1,x2,x3) w: (0) p(x1) w: (0) 0() w: (0) #gr(x1,x2) w: (x2) #neq(x1,x2) w: (0) #cond2(x1,x2,x3) w: (0) gr(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #3 Number of SCCs: 1, DPs: 3 SCC { #1 #5 #8 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed.