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


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


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