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


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


MAYBE
Input TRS:
    1: f(node(s(n),xs)) -> f(addchild(select(xs),node(n,xs)))
    2: select(cons(ap,xs)) -> ap
    3: select(cons(ap,xs)) -> select(xs)
    4: addchild(node(y,ys),node(n,xs)) -> node(y,cons(node(n,xs),ys))
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #select(cons(ap,xs)) -> #select(xs)
   #2: #f(node(s(n),xs)) -> #f(addchild(select(xs),node(n,xs)))
   #3: #f(node(s(n),xs)) -> #addchild(select(xs),node(n,xs))
   #4: #f(node(s(n),xs)) -> #select(xs)
Number of SCCs: 2, DPs: 2
  SCC { #1 }
POLO(Sum)... succeeded.
      addchild	w: 0
      s 	w: 0
      #select	w: x1
      select	w: 0
      f 	w: 0
      #f 	w: 0
      #addchild	w: 0
      cons	w: x2 + 1
      node	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.