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