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


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


NO

Problem 1: 

(VAR L N)
(STRATEGY CONTEXTSENSITIVE
(U11 1)
(U12 1)
(length 1)
(zeros)
(0)
(cons 1)
(nil)
(s 1)
(tt)
)
(RULES
U11(tt,L) -> U12(tt,L)
U12(tt,L) -> s(length(L))
length(cons(N,L)) -> U11(tt,L)
length(nil) -> 0
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
 LENGTH(cons(N,L)) -> U11#(tt,L)
-> Rules:
 U11(tt,L) -> U12(tt,L)
 U12(tt,L) -> s(length(L))
 length(cons(N,L)) -> U11(tt,L)
 length(nil) -> 0
 zeros -> cons(0,zeros)
-> Unhiding Rules:
 zeros -> ZEROS

Problem 1: 

SCC Processor:
-> Pairs:
 U11#(tt,L) -> U12#(tt,L)
 U12#(tt,L) -> LENGTH(L)
 U12#(tt,L) -> L
 LENGTH(cons(N,L)) -> U11#(tt,L)
-> Rules:
 U11(tt,L) -> U12(tt,L)
 U12(tt,L) -> s(length(L))
 length(cons(N,L)) -> U11(tt,L)
 length(nil) -> 0
 zeros -> cons(0,zeros)
-> Unhiding rules:
 zeros -> ZEROS
->Strongly Connected Components:
->->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))
 length(cons(N,L)) -> U11(tt,L)
 length(nil) -> 0
 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))
 length(cons(N,L)) -> U11(tt,L)
 length(nil) -> 0
 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.