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


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


NO
Input TRS:
    1: zeros() -> cons(0(),n__zeros())
    2: and(tt(),X) -> activate(X)
    3: length(nil()) -> 0()
    4: length(cons(N,L)) -> s(length(activate(L)))
    5: zeros() -> n__zeros()
    6: activate(n__zeros()) -> zeros()
    7: activate(X) -> X
Number of strict rules: 7
Direct POLO(bPol) ... removes: 3 5 7 2
      s 	w: x1
      activate	w: x1 + 4
      and	w: 2 * x1 + 2 * x2 + 3
      n__zeros	w: 1
      zeros	w: 5
      0 	w: 0
      nil	w: 2
      cons	w: x1 + x2 + 4
      tt	w: 1
      length	w: x1
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #activate(n__zeros()) -> #zeros()
   #2: #length(cons(N,L)) -> #length(activate(L))
   #3: #length(cons(N,L)) -> #activate(L)
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #length(cons(N,n__zeros()))	-#2->
  #length(activate(n__zeros()))	--->*
  #length(cons(0(),n__zeros()))
  Looping with: [ N := 0(); ]