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


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


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