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