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


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


NO
Input TRS:
    1: f(X) -> cons(X,f(g(X)))
    2: g(0()) -> s(0())
    3: g(s(X)) -> s(s(g(X)))
    4: sel(0(),cons(X,Y)) -> 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: #g(s(X)) -> #g(X)
   #3: #f(X) -> #f(g(X))
   #4: #f(X) -> #g(X)
Number of SCCs: 3, DPs: 3
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #f(X)	-#3->
  #f(g(X))	--->*
  #f(g(X))
  Looping with: [ X := g(X); ]