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