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


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


YES
Input TRS:
    1: from(X) -> cons(X,n__from(n__s(X)))
    2: sel(0(),cons(X,XS)) -> X
    3: sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
    4: minus(X,0()) -> 0()
    5: minus(s(X),s(Y)) -> minus(X,Y)
    6: quot(0(),s(Y)) -> 0()
    7: quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
    8: zWquot(XS,nil()) -> nil()
    9: zWquot(nil(),XS) -> nil()
    10: zWquot(cons(X,XS),cons(Y,YS)) -> cons(quot(X,Y),n__zWquot(activate(XS),activate(YS)))
    11: from(X) -> n__from(X)
    12: s(X) -> n__s(X)
    13: zWquot(X1,X2) -> n__zWquot(X1,X2)
    14: activate(n__from(X)) -> from(activate(X))
    15: activate(n__s(X)) -> s(activate(X))
    16: activate(n__zWquot(X1,X2)) -> zWquot(activate(X1),activate(X2))
    17: activate(X) -> X
Number of strict rules: 17
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #activate(n__from(X)) -> #from(activate(X))
   #2: #activate(n__from(X)) -> #activate(X)
   #3: #quot(s(X),s(Y)) -> #s(quot(minus(X,Y),s(Y)))
   #4: #quot(s(X),s(Y)) -> #quot(minus(X,Y),s(Y))
   #5: #quot(s(X),s(Y)) -> #minus(X,Y)
   #6: #zWquot(cons(X,XS),cons(Y,YS)) -> #quot(X,Y)
   #7: #zWquot(cons(X,XS),cons(Y,YS)) -> #activate(XS)
   #8: #zWquot(cons(X,XS),cons(Y,YS)) -> #activate(YS)
   #9: #minus(s(X),s(Y)) -> #minus(X,Y)
   #10: #activate(n__zWquot(X1,X2)) -> #zWquot(activate(X1),activate(X2))
   #11: #activate(n__zWquot(X1,X2)) -> #activate(X1)
   #12: #activate(n__zWquot(X1,X2)) -> #activate(X2)
   #13: #sel(s(N),cons(X,XS)) -> #sel(N,activate(XS))
   #14: #sel(s(N),cons(X,XS)) -> #activate(XS)
   #15: #activate(n__s(X)) -> #s(activate(X))
   #16: #activate(n__s(X)) -> #activate(X)
Number of SCCs: 3, DPs: 9
  SCC { #9 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #zWquot	w: 0
      minus	w: 0
      activate	w: 0
      n__from	w: 0
      #activate	w: 0
      zWquot	w: 0
      n__zWquot	w: 0
      n__s	w: 0
      0 	w: 0
      quot	w: 0
      #sel	w: 0
      from	w: 0
      sel	w: 0
      #s 	w: 0
      nil	w: 0
      #minus	w: x1 + x2
      #from	w: 0
      cons	w: 0
      #quot	w: 0
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 2, DPs: 8
  SCC { #13 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #zWquot	w: 0
      minus	w: x1
      activate	w: x1 + 1
      n__from	w: 1
      #activate	w: 0
      zWquot	w: 2
      n__zWquot	w: 1
      n__s	w: x1 + 1
      0 	w: 1
      quot	w: x1 + x2 + 1
      #sel	w: x1 + x2
      from	w: 2
      sel	w: 0
      #s 	w: 0
      nil	w: 2
      #minus	w: 0
      #from	w: 0
      cons	w: x2 + 1
      #quot	w: 0
    USABLE RULES: { 1 8..17 }
    Removed DPs: #13
Number of SCCs: 1, DPs: 7
  SCC { #2 #7 #8 #10..12 #16 }
POLO(Sum)... succeeded.
      s 	w: x1
      #zWquot	w: x1 + x2 + 1
      minus	w: 1
      activate	w: x1
      n__from	w: x1 + 1
      #activate	w: x1
      zWquot	w: x1 + x2 + 2
      n__zWquot	w: x1 + x2 + 2
      n__s	w: x1
      0 	w: 2
      quot	w: x2 + 2
      #sel	w: 0
      from	w: x1 + 1
      sel	w: 0
      #s 	w: 0
      nil	w: 0
      #minus	w: 0
      #from	w: 0
      cons	w: x2
      #quot	w: 0
    USABLE RULES: { 1 8..17 }
    Removed DPs: #2 #7 #8 #10..12
Number of SCCs: 1, DPs: 1
  SCC { #16 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #zWquot	w: x1 + x2 + 1
      minus	w: 0
      activate	w: x1
      n__from	w: x1 + 1
      #activate	w: x1
      zWquot	w: x1 + x2 + 2
      n__zWquot	w: x1 + x2 + 2
      n__s	w: x1 + 1
      0 	w: 1
      quot	w: x1 + x2 + 1
      #sel	w: 0
      from	w: x1 + 1
      sel	w: 0
      #s 	w: 0
      nil	w: 0
      #minus	w: 0
      #from	w: 0
      cons	w: 0
      #quot	w: 0
    USABLE RULES: { 1 8..17 }
    Removed DPs: #16
Number of SCCs: 0, DPs: 0