/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES

Problem:
 from(X) -> cons(X,n__from(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)
 take(X1,X2) -> n__take(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(n__take(X1,X2)) -> take(X1,X2)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   2nd#(cons(X,XS)) -> activate#(XS)
   2nd#(cons(X,XS)) -> head#(activate(XS))
   take#(s(N),cons(X,XS)) -> activate#(XS)
   sel#(s(N),cons(X,XS)) -> activate#(XS)
   sel#(s(N),cons(X,XS)) -> sel#(N,activate(XS))
   activate#(n__from(X)) -> from#(X)
   activate#(n__take(X1,X2)) -> take#(X1,X2)
  TRS:
   from(X) -> cons(X,n__from(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)
   take(X1,X2) -> n__take(X1,X2)
   activate(n__from(X)) -> from(X)
   activate(n__take(X1,X2)) -> take(X1,X2)
   activate(X) -> X
  TDG Processor:
   DPs:
    2nd#(cons(X,XS)) -> activate#(XS)
    2nd#(cons(X,XS)) -> head#(activate(XS))
    take#(s(N),cons(X,XS)) -> activate#(XS)
    sel#(s(N),cons(X,XS)) -> activate#(XS)
    sel#(s(N),cons(X,XS)) -> sel#(N,activate(XS))
    activate#(n__from(X)) -> from#(X)
    activate#(n__take(X1,X2)) -> take#(X1,X2)
   TRS:
    from(X) -> cons(X,n__from(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)
    take(X1,X2) -> n__take(X1,X2)
    activate(n__from(X)) -> from(X)
    activate(n__take(X1,X2)) -> take(X1,X2)
    activate(X) -> X
   graph:
    sel#(s(N),cons(X,XS)) -> sel#(N,activate(XS)) ->
    sel#(s(N),cons(X,XS)) -> sel#(N,activate(XS))
    sel#(s(N),cons(X,XS)) -> sel#(N,activate(XS)) ->
    sel#(s(N),cons(X,XS)) -> activate#(XS)
    sel#(s(N),cons(X,XS)) -> activate#(XS) ->
    activate#(n__take(X1,X2)) -> take#(X1,X2)
    sel#(s(N),cons(X,XS)) -> activate#(XS) ->
    activate#(n__from(X)) -> from#(X)
    take#(s(N),cons(X,XS)) -> activate#(XS) ->
    activate#(n__take(X1,X2)) -> take#(X1,X2)
    take#(s(N),cons(X,XS)) -> activate#(XS) ->
    activate#(n__from(X)) -> from#(X)
    activate#(n__take(X1,X2)) -> take#(X1,X2) ->
    take#(s(N),cons(X,XS)) -> activate#(XS)
    2nd#(cons(X,XS)) -> activate#(XS) ->
    activate#(n__take(X1,X2)) -> take#(X1,X2)
    2nd#(cons(X,XS)) -> activate#(XS) -> activate#(n__from(X)) -> from#(X)
   SCC Processor:
    #sccs: 2
    #rules: 3
    #arcs: 9/49
    DPs:
     sel#(s(N),cons(X,XS)) -> sel#(N,activate(XS))
    TRS:
     from(X) -> cons(X,n__from(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)
     take(X1,X2) -> n__take(X1,X2)
     activate(n__from(X)) -> from(X)
     activate(n__take(X1,X2)) -> take(X1,X2)
     activate(X) -> X
    Subterm Criterion Processor:
     simple projection:
      pi(sel#) = 0
     problem:
      DPs:
       
      TRS:
       from(X) -> cons(X,n__from(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)
       take(X1,X2) -> n__take(X1,X2)
       activate(n__from(X)) -> from(X)
       activate(n__take(X1,X2)) -> take(X1,X2)
       activate(X) -> X
     Qed
    
    DPs:
     activate#(n__take(X1,X2)) -> take#(X1,X2)
     take#(s(N),cons(X,XS)) -> activate#(XS)
    TRS:
     from(X) -> cons(X,n__from(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)
     take(X1,X2) -> n__take(X1,X2)
     activate(n__from(X)) -> from(X)
     activate(n__take(X1,X2)) -> take(X1,X2)
     activate(X) -> X
    Subterm Criterion Processor:
     simple projection:
      pi(activate#) = 0
      pi(take#) = 1
     problem:
      DPs:
       
      TRS:
       from(X) -> cons(X,n__from(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)
       take(X1,X2) -> n__take(X1,X2)
       activate(n__from(X)) -> from(X)
       activate(n__take(X1,X2)) -> take(X1,X2)
       activate(X) -> X
     Qed