/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: ge(x,0()) -> true() 2: ge(0(),s(y)) -> false() 3: ge(s(x),s(y)) -> ge(x,y) 4: minus(x,0()) -> x 5: minus(0(),y) -> 0() 6: minus(s(x),s(y)) -> minus(x,y) 7: id_inc(x) -> x 8: id_inc(x) -> s(x) 9: quot(x,y) -> div(x,y,0()) 10: div(x,y,z) -> if(ge(y,s(0())),ge(x,y),x,y,z) 11: if(false(),b,x,y,z) -> div_by_zero() 12: if(true(),false(),x,y,z) -> z 13: if(true(),true(),x,y,z) -> div(minus(x,y),y,id_inc(z)) Number of strict rules: 13 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(s(x),s(y)) -> #minus(x,y) #2: #if(true(),true(),x,y,z) -> #div(minus(x,y),y,id_inc(z)) #3: #if(true(),true(),x,y,z) -> #minus(x,y) #4: #if(true(),true(),x,y,z) -> #id_inc(z) #5: #quot(x,y) -> #div(x,y,0()) #6: #div(x,y,z) -> #if(ge(y,s(0())),ge(x,y),x,y,z) #7: #div(x,y,z) -> #ge(y,s(0())) #8: #div(x,y,z) -> #ge(x,y) #9: #ge(s(x),s(y)) -> #ge(x,y) Number of SCCs: 3, DPs: 4 SCC { #1 } POLO(Sum)... succeeded. #div w: 0 s w: x1 + 1 minus w: 0 div_by_zero w: 0 false w: 0 div w: 0 #ge w: 0 true w: 0 #id_inc w: 0 0 w: 0 if w: 0 quot w: 0 ge w: 0 #minus w: x1 + x2 id_inc w: 0 #if w: 0 #quot w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 3 SCC { #9 } POLO(Sum)... succeeded. #div w: 0 s w: x1 + 1 minus w: 0 div_by_zero w: 0 false w: 0 div w: 0 #ge w: x2 true w: 0 #id_inc w: 0 0 w: 0 if w: 0 quot w: 0 ge w: 0 #minus w: 0 id_inc w: 0 #if w: 0 #quot w: 0 USABLE RULES: { } Removed DPs: #9 Number of SCCs: 1, DPs: 2 SCC { #2 #6 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.