/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: quot(0(),s(y)) -> 0() 4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) 5: plus(0(),y) -> y 6: plus(s(x),y) -> s(plus(x,y)) 7: minus(minus(x,y),z) -> minus(x,plus(y,z)) 8: rand(x) ->= x 9: rand(x) ->= rand(s(x)) Number of strict rules: 7 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(s(x),s(y)) -> #minus(x,y) #2: #plus(s(x),y) -> #plus(x,y) #3: #minus(minus(x,y),z) -> #minus(x,plus(y,z)) #4: #minus(minus(x,y),z) -> #plus(y,z) #5: #quot(s(x),s(y)) -> #quot(minus(x,y),s(y)) #6: #quot(s(x),s(y)) -> #minus(x,y) Number of SCCs: 3, DPs: 4 SCC { #2 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. s s: [1] p: 0 w: x1 minus s: 1 #plus s: [2,1] p: 1 w: max(x1 + 1, x2 + 2) rand s: [] p: 0 w: x1 + 1 0 s: [] p: 1 w: 1 quot s: [1] p: 1 w: max(x1 + 1) #minus s: [1] p: 0 w: max(x1) plus s: [2,1] p: 1 w: max(x1 + 2, x2 + 1) #quot s: [] p: 0 w: max(x2) Removed DPs: #2 Number of SCCs: 2, DPs: 3 SCC { #5 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. s s: [1] p: 0 w: x1 minus s: 1 #plus s: [2,1] p: 1 w: max(x1 + 1, x2 + 2) rand s: [] p: 0 w: x1 + 1 0 s: [] p: 1 w: 1 quot s: [1] p: 1 w: max(x1 + 1) #minus s: [1] p: 0 w: max(x1) plus s: [2,1] p: 1 w: max(x1 + 2, x2 + 1) #quot s: [1,2] p: 1 w: max(x1 + 1, x2) Removed DPs: #5 Number of SCCs: 1, DPs: 2 SCC { #1 #3 } POLO(Sum)... succeeded. s w: x1 minus w: x1 + x2 + 2 #plus w: 0 rand w: x1 0 w: 1 quot w: 1 #minus w: x1 + x2 plus w: x2 + 1 #quot w: 0 Removed DPs: #3 Number of SCCs: 1, DPs: 1 SCC { #1 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. s s: [1] p: 0 w: x1 minus s: 1 #plus s: [2,1] p: 1 w: max(x1 + 1, x2 + 2) rand s: [] p: 0 w: x1 + 1 0 s: [] p: 1 w: 1 quot s: [1] p: 1 w: max(x1 + 1) #minus s: [1] p: 1 w: max(x1) plus s: [2,1] p: 1 w: max(x1 + 2, x2 + 1) #quot s: [1,2] p: 1 w: max(x1 + 1, x2) Removed DPs: #1 Number of SCCs: 0, DPs: 0