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


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


YES
Input TRS:
    1: and(tt(),X) -> activate(X)
    2: plus(N,0()) -> N
    3: plus(N,s(M)) -> s(plus(N,M))
    4: x(N,0()) -> 0()
    5: x(N,s(M)) -> plus(x(N,M),N)
    6: activate(X) -> X
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #x(N,s(M)) -> #plus(x(N,M),N)
   #2: #x(N,s(M)) -> #x(N,M)
   #3: #plus(N,s(M)) -> #plus(N,M)
   #4: #and(tt(),X) -> #activate(X)
Number of SCCs: 2, DPs: 2
  SCC { #2 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      activate	w: 0
      and	w: 0
      #plus	w: 0
      #activate	w: 0
      x 	w: 0
      0 	w: 0
      #x 	w: x2
      plus	w: 0
      tt	w: 0
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      activate	w: 0
      and	w: 0
      #plus	w: x2
      #activate	w: 0
      x 	w: 0
      0 	w: 0
      #x 	w: 0
      plus	w: 0
      tt	w: 0
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 0, DPs: 0