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