/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO
Input TRS:
    1: from(X) -> cons(X,from(s(X)))
    2: first(0(),Z) -> nil()
    3: first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
    4: sel(0(),cons(X,Z)) -> X
    5: sel(s(X),cons(Y,Z)) -> sel(X,Z)
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #sel(s(X),cons(Y,Z)) -> #sel(X,Z)
   #2: #first(s(X),cons(Y,Z)) -> #first(X,Z)
   #3: #from(X) -> #from(s(X))
Number of SCCs: 3, DPs: 3
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #from(X)	-#3->
  #from(s(X))	--->*
  #from(s(X))
  Looping with: [ X := s(X); ]