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


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


NO
Input TRS:
    1: pairNs() -> cons(0(),n__incr(oddNs()))
    2: oddNs() -> incr(pairNs())
    3: incr(cons(X,XS)) -> cons(s(X),n__incr(activate(XS)))
    4: take(0(),XS) -> nil()
    5: take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS)))
    6: zip(nil(),XS) -> nil()
    7: zip(X,nil()) -> nil()
    8: zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),n__zip(activate(XS),activate(YS)))
    9: tail(cons(X,XS)) -> activate(XS)
    10: repItems(nil()) -> nil()
    11: repItems(cons(X,XS)) -> cons(X,n__cons(X,n__repItems(activate(XS))))
    12: incr(X) -> n__incr(X)
    13: take(X1,X2) -> n__take(X1,X2)
    14: zip(X1,X2) -> n__zip(X1,X2)
    15: cons(X1,X2) -> n__cons(X1,X2)
    16: repItems(X) -> n__repItems(X)
    17: activate(n__incr(X)) -> incr(X)
    18: activate(n__take(X1,X2)) -> take(X1,X2)
    19: activate(n__zip(X1,X2)) -> zip(X1,X2)
    20: activate(n__cons(X1,X2)) -> cons(X1,X2)
    21: activate(n__repItems(X)) -> repItems(X)
    22: activate(X) -> X
Number of strict rules: 22
Direct POLO(bPol) ... removes: 18 4 8 16 21 19 5 10 7 14 11 9 13 6
      repItems	w: 2 * x1 + 3
      incr	w: 2 * x1
      s 	w: 2 * x1
      activate	w: 2 * x1
      take	w: 2 * x1 + 2 * x2 + 3
      pair	w: x1 + x2 + 1
      tail	w: 2 * x1 + 1
      0 	w: 0
      n__take	w: x1 + x2 + 2
      n__cons	w: x1 + x2
      nil	w: 1
      n__zip	w: x1 + x2 + 3
      pairNs	w: 0
      oddNs	w: 0
      n__repItems	w: x1 + 2
      cons	w: x1 + x2
      n__incr	w: x1
      zip	w: 2 * x1 + 2 * x2 + 5
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #oddNs() -> #incr(pairNs())
   #2: #oddNs() -> #pairNs()
   #3: #activate(n__cons(X1,X2)) -> #cons(X1,X2)
   #4: #activate(n__incr(X)) -> #incr(X)
   #5: #incr(cons(X,XS)) -> #cons(s(X),n__incr(activate(XS)))
   #6: #incr(cons(X,XS)) -> #activate(XS)
   #7: #pairNs() -> #cons(0(),n__incr(oddNs()))
   #8: #pairNs() -> #oddNs()
Number of SCCs: 2, DPs: 4
  SCC { #2 #8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #pairNs()	-#8->
  #oddNs()	--->*
  #oddNs()	-#2->
  #pairNs()	--->*
  #pairNs()
  Looping with: [ ]