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


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


YES

Problem:
 from(X) -> cons(X,n__from(n__s(X)))
 head(cons(X,XS)) -> X
 2nd(cons(X,XS)) -> head(activate(XS))
 take(0(),XS) -> nil()
 take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS)))
 sel(0(),cons(X,XS)) -> X
 sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
 from(X) -> n__from(X)
 s(X) -> n__s(X)
 take(X1,X2) -> n__take(X1,X2)
 activate(n__from(X)) -> from(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(n__take(X1,X2)) -> take(activate(X1),activate(X2))
 activate(X) -> X

Proof:
 WPO Processor:
  algebra: Max
  weight function:
   w0 = 0
   w(sel) = w(0) = 4
   w(nil) = 1
   w(n__take) = w(s) = w(take) = w(activate) = w(2nd) = w(head) = w(cons) = w(
   n__from) = w(n__s) = w(from) = 0
  status function:
   st(cons) = [1, 0]
   st(sel) = st(n__take) = [0, 1]
   st(s) = [0]
   st(nil) = []
   st(take) = [0, 1]
   st(0) = []
   st(activate) = st(2nd) = st(head) = st(n__from) = st(n__s) = st(from) = [0]
  subterm penalty function:
   sp(sel, 1) = sp(n__take, 1) = sp(take, 1) = 4
   sp(n__take, 0) = sp(take, 0) = 2
   sp(sel, 0) = sp(s, 0) = sp(activate, 0) = sp(2nd, 0) = sp(head, 0) = sp(
   cons, 1) = sp(cons, 0) = sp(n__from, 0) = sp(n__s, 0) = sp(from, 0) = 0
  precedence:
   2nd > activate > s > from > take > sel ~ n__take ~ nil ~ 0 ~ head ~ cons ~ n__from ~ n__s
  problem:
   
  Qed