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


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


YES
Input TRS:
    1: 2nd(cons1(X,cons(Y,Z))) -> Y
    2: 2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
    3: from(X) -> cons(X,n__from(n__s(X)))
    4: from(X) -> n__from(X)
    5: s(X) -> n__s(X)
    6: activate(n__from(X)) -> from(activate(X))
    7: activate(n__s(X)) -> s(activate(X))
    8: activate(X) -> X
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying 2nd
1: 2nd^1_cons1(X,cons(Y,Z)) -> Y
2: 2nd^1_cons(X,X1) -> 2nd^1_cons1(X,activate(X1))
3: from(X) -> cons(X,n__from(n__s(X)))
4: from(X) -> n__from(X)
5: s(X) -> n__s(X)
6: activate(n__from(X)) -> from(activate(X))
7: activate(n__s(X)) -> s(activate(X))
8: activate(X) -> X
9: 2nd(cons(_1,_2)) ->= 2nd^1_cons(_1,_2)
10: 2nd(cons1(_1,_2)) ->= 2nd^1_cons1(_1,_2)
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #2nd^1_cons(X,X1) -> #2nd^1_cons1(X,activate(X1))
   #2: #2nd^1_cons(X,X1) -> #activate(X1)
   #3: #activate(n__from(X)) -> #from(activate(X))
   #4: #activate(n__from(X)) -> #activate(X)
   #5: #2nd(cons(_1,_2)) ->? #2nd^1_cons(_1,_2)
   #6: #activate(n__s(X)) -> #s(activate(X))
   #7: #activate(n__s(X)) -> #activate(X)
   #8: #2nd(cons1(_1,_2)) ->? #2nd^1_cons1(_1,_2)
Number of SCCs: 1, DPs: 2
  SCC { #4 #7 }
POLO(Sum)... succeeded.
      s 	w: 0
      activate	w: 0
      n__from	w: x1 + 1
      #activate	w: x1
      2nd	w: 0
      #2nd^1_cons1	w: 0
      n__s	w: x1 + 1
      cons1	w: 0
      2nd^1_cons	w: 0
      from	w: 0
      #s 	w: 0
      #2nd	w: 0
      #2nd^1_cons	w: 0
      #from	w: 0
      cons	w: 0
      2nd^1_cons1	w: 0
    USABLE RULES: { }
    Removed DPs: #4 #7
Number of SCCs: 0, DPs: 0