/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: le(0(),y) -> true() 4: le(s(x),0()) -> false() 5: le(s(x),s(y)) -> le(x,y) 6: quot(x,s(y)) -> if_quot(le(s(y),x),x,s(y)) 7: if_quot(true(),x,y) -> s(quot(minus(x,y),y)) 8: if_quot(false(),x,y) -> 0() Number of strict rules: 8 Direct POLO(bPol) ... failed. Uncurrying le 1: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: le^1_0(y) -> true() 4: le^1_s(x,0()) -> false() 5: le^1_s(x,s(y)) -> le(x,y) 6: quot(x,s(y)) -> if_quot(le^1_s(y,x),x,s(y)) 7: if_quot(true(),x,y) -> s(quot(minus(x,y),y)) 8: if_quot(false(),x,y) -> 0() 9: le(0(),_1) ->= le^1_0(_1) 10: le(s(_1),_2) ->= le^1_s(_1,_2) Number of strict rules: 8 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #minus(s(x),s(y)) -> #minus(x,y) #2: #quot(x,s(y)) -> #if_quot(le^1_s(y,x),x,s(y)) #3: #quot(x,s(y)) -> #le^1_s(y,x) #4: #le(0(),_1) ->? #le^1_0(_1) #5: #if_quot(true(),x,y) -> #quot(minus(x,y),y) #6: #if_quot(true(),x,y) -> #minus(x,y) #7: #le(s(_1),_2) ->? #le^1_s(_1,_2) #8: #le^1_s(x,s(y)) -> #le(x,y) Number of SCCs: 3, DPs: 5 SCC { #1 } POLO(Sum)... succeeded. #le^1_s w: 0 le w: 0 le^1_s w: 0 s w: x1 + 1 #le w: 0 #le^1_0 w: 0 minus w: 0 #if_quot w: 0 false w: 0 true w: 0 0 w: 0 quot w: 0 #minus w: x1 + x2 le^1_0 w: 0 if_quot w: 0 #quot w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 4 SCC { #7 #8 } POLO(Sum)... succeeded. #le^1_s w: x2 le w: 0 le^1_s w: 0 s w: x1 + 2 #le w: x2 + 1 #le^1_0 w: 0 minus w: 0 #if_quot w: 0 false w: 0 true w: 0 0 w: 0 quot w: 0 #minus w: 0 le^1_0 w: 0 if_quot w: 0 #quot w: 0 USABLE RULES: { } Removed DPs: #7 #8 Number of SCCs: 1, DPs: 2 SCC { #2 #5 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.