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