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


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


NO

Problem 1: 

(VAR IL L M N)
(STRATEGY CONTEXTSENSITIVE
(U11 1)
(U12 1)
(U21 1)
(U22 1)
(U23 1)
(length 1)
(take 1 2)
(zeros)
(0)
(cons 1)
(nil)
(s 1)
(tt)
)
(RULES
U11(tt,L) -> U12(tt,L)
U12(tt,L) -> s(length(L))
U21(tt,IL,M,N) -> U22(tt,IL,M,N)
U22(tt,IL,M,N) -> U23(tt,IL,M,N)
U23(tt,IL,M,N) -> cons(N,take(M,IL))
length(cons(N,L)) -> U11(tt,L)
length(nil) -> 0
take(0,IL) -> nil
take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
zeros -> cons(0,zeros)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 U11#(tt,L) -> U12#(tt,L)
 U12#(tt,L) -> LENGTH(L)
 U12#(tt,L) -> L
 U21#(tt,IL,M,N) -> U22#(tt,IL,M,N)
 U22#(tt,IL,M,N) -> U23#(tt,IL,M,N)
 U23#(tt,IL,M,N) -> N
 LENGTH(cons(N,L)) -> U11#(tt,L)
 TAKE(s(M),cons(N,IL)) -> U21#(tt,IL,M,N)
-> Rules:
 U11(tt,L) -> U12(tt,L)
 U12(tt,L) -> s(length(L))
 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
 U23(tt,IL,M,N) -> cons(N,take(M,IL))
 length(cons(N,L)) -> U11(tt,L)
 length(nil) -> 0
 take(0,IL) -> nil
 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
 zeros -> cons(0,zeros)
-> Unhiding Rules:
 take(M,IL) -> TAKE(M,IL)
 take(M,x4) -> x4
 take(x4,IL) -> x4
 zeros -> ZEROS

Problem 1: 

SCC Processor:
-> Pairs:
 U11#(tt,L) -> U12#(tt,L)
 U12#(tt,L) -> LENGTH(L)
 U12#(tt,L) -> L
 U21#(tt,IL,M,N) -> U22#(tt,IL,M,N)
 U22#(tt,IL,M,N) -> U23#(tt,IL,M,N)
 U23#(tt,IL,M,N) -> N
 LENGTH(cons(N,L)) -> U11#(tt,L)
 TAKE(s(M),cons(N,IL)) -> U21#(tt,IL,M,N)
-> Rules:
 U11(tt,L) -> U12(tt,L)
 U12(tt,L) -> s(length(L))
 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
 U23(tt,IL,M,N) -> cons(N,take(M,IL))
 length(cons(N,L)) -> U11(tt,L)
 length(nil) -> 0
 take(0,IL) -> nil
 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
 zeros -> cons(0,zeros)
-> Unhiding rules:
 take(M,IL) -> TAKE(M,IL)
 take(M,x4) -> x4
 take(x4,IL) -> x4
 zeros -> ZEROS
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 U21#(tt,IL,M,N) -> U22#(tt,IL,M,N)
 U22#(tt,IL,M,N) -> U23#(tt,IL,M,N)
 U23#(tt,IL,M,N) -> N
 TAKE(s(M),cons(N,IL)) -> U21#(tt,IL,M,N)
->->-> Rules:
 U11(tt,L) -> U12(tt,L)
 U12(tt,L) -> s(length(L))
 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
 U23(tt,IL,M,N) -> cons(N,take(M,IL))
 length(cons(N,L)) -> U11(tt,L)
 length(nil) -> 0
 take(0,IL) -> nil
 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
 zeros -> cons(0,zeros)
->->-> Unhiding rules:
 take(M,IL) -> TAKE(M,IL)
 take(M,x4) -> x4
 take(x4,IL) -> x4
->->Cycle:
->->-> Pairs:
 U11#(tt,L) -> U12#(tt,L)
 U12#(tt,L) -> LENGTH(L)
 LENGTH(cons(N,L)) -> U11#(tt,L)
->->-> Rules:
 U11(tt,L) -> U12(tt,L)
 U12(tt,L) -> s(length(L))
 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
 U23(tt,IL,M,N) -> cons(N,take(M,IL))
 length(cons(N,L)) -> U11(tt,L)
 length(nil) -> 0
 take(0,IL) -> nil
 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
 zeros -> cons(0,zeros)
->->-> Unhiding rules:
 Empty

Problem 1: 

Basic Processor:
-> Pairs:
 U11#(tt,L) -> U12#(tt,L)
 U12#(tt,L) -> LENGTH(L)
 LENGTH(cons(N,L)) -> U11#(tt,L)
-> Rules:
 U11(tt,L) -> U12(tt,L)
 U12(tt,L) -> s(length(L))
 U21(tt,IL,M,N) -> U22(tt,IL,M,N)
 U22(tt,IL,M,N) -> U23(tt,IL,M,N)
 U23(tt,IL,M,N) -> cons(N,take(M,IL))
 length(cons(N,L)) -> U11(tt,L)
 length(nil) -> 0
 take(0,IL) -> nil
 take(s(M),cons(N,IL)) -> U21(tt,IL,M,N)
 zeros -> cons(0,zeros)
-> Unhiding rules:
 Empty
-> Pairs in cycle:
 U11#(tt,zeros) -> U12#(tt,zeros)
 U12#(tt,zeros) -> LENGTH(zeros)
 LENGTH(zeros) -> LENGTH(cons(0,zeros))
 LENGTH(cons(0,zeros)) -> U11#(tt,zeros)

The problem is infinite.