/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: sel(s(X),cons(Y,Z)) -> sel(X,Z) 2: sel(0(),cons(X,Z)) -> X 3: first(0(),Z) -> nil() 4: first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) 5: from(X) -> cons(X,from(s(X))) 6: sel1(s(X),cons(Y,Z)) -> sel1(X,Z) 7: sel1(0(),cons(X,Z)) -> quote(X) 8: first1(0(),Z) -> nil1() 9: first1(s(X),cons(Y,Z)) -> cons1(quote(Y),first1(X,Z)) 10: quote(0()) -> 01() 11: quote1(cons(X,Z)) -> cons1(quote(X),quote1(Z)) 12: quote1(nil()) -> nil1() 13: quote(s(X)) -> s1(quote(X)) 14: quote(sel(X,Z)) -> sel1(X,Z) 15: quote1(first(X,Z)) -> first1(X,Z) 16: unquote(01()) -> 0() 17: unquote(s1(X)) -> s(unquote(X)) 18: unquote1(nil1()) -> nil() 19: unquote1(cons1(X,Z)) -> fcons(unquote(X),unquote1(Z)) 20: fcons(X,Z) -> cons(X,Z) Number of strict rules: 20 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #sel1(s(X),cons(Y,Z)) -> #sel1(X,Z) #2: #quote(s(X)) -> #quote(X) #3: #first1(s(X),cons(Y,Z)) -> #quote(Y) #4: #first1(s(X),cons(Y,Z)) -> #first1(X,Z) #5: #quote1(cons(X,Z)) -> #quote(X) #6: #quote1(cons(X,Z)) -> #quote1(Z) #7: #quote(sel(X,Z)) -> #sel1(X,Z) #8: #sel1(0(),cons(X,Z)) -> #quote(X) #9: #from(X) -> #from(s(X)) #10: #unquote(s1(X)) -> #unquote(X) #11: #unquote1(cons1(X,Z)) -> #fcons(unquote(X),unquote1(Z)) #12: #unquote1(cons1(X,Z)) -> #unquote(X) #13: #unquote1(cons1(X,Z)) -> #unquote1(Z) #14: #sel(s(X),cons(Y,Z)) -> #sel(X,Z) #15: #quote1(first(X,Z)) -> #first1(X,Z) #16: #first(s(X),cons(Y,Z)) -> #first(X,Z) Number of SCCs: 8, DPs: 11 SCC { #9 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #from(X) -#9-> #from(s(X)) --->* #from(s(X)) Looping with: [ X := s(X); ]