/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 X)
(RULES
activate(n__zeros) -> zeros
activate(X) -> X
and(tt,X) -> activate(X)
length(cons(N,L)) -> s(length(activate(L)))
length(nil) -> 0
zeros -> cons(0,n__zeros)
zeros -> n__zeros
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__zeros) -> ZEROS
 AND(tt,X) -> ACTIVATE(X)
 LENGTH(cons(N,L)) -> ACTIVATE(L)
 LENGTH(cons(N,L)) -> LENGTH(activate(L))
-> Rules:
 activate(n__zeros) -> zeros
 activate(X) -> X
 and(tt,X) -> activate(X)
 length(cons(N,L)) -> s(length(activate(L)))
 length(nil) -> 0
 zeros -> cons(0,n__zeros)
 zeros -> n__zeros

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVATE(n__zeros) -> ZEROS
 AND(tt,X) -> ACTIVATE(X)
 LENGTH(cons(N,L)) -> ACTIVATE(L)
 LENGTH(cons(N,L)) -> LENGTH(activate(L))
-> Rules:
 activate(n__zeros) -> zeros
 activate(X) -> X
 and(tt,X) -> activate(X)
 length(cons(N,L)) -> s(length(activate(L)))
 length(nil) -> 0
 zeros -> cons(0,n__zeros)
 zeros -> n__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 LENGTH(cons(N,L)) -> LENGTH(activate(L))
->->-> Rules:
 activate(n__zeros) -> zeros
 activate(X) -> X
 and(tt,X) -> activate(X)
 length(cons(N,L)) -> s(length(activate(L)))
 length(nil) -> 0
 zeros -> cons(0,n__zeros)
 zeros -> n__zeros

Problem 1: 

Narrowing Processor:
-> Pairs:
 LENGTH(cons(N,L)) -> LENGTH(activate(L))
-> Rules:
 activate(n__zeros) -> zeros
 activate(X) -> X
 and(tt,X) -> activate(X)
 length(cons(N,L)) -> s(length(activate(L)))
 length(nil) -> 0
 zeros -> cons(0,n__zeros)
 zeros -> n__zeros
->Narrowed Pairs:
->->Original Pair:
 LENGTH(cons(N,L)) -> LENGTH(activate(L))
->-> Narrowed pairs:
 LENGTH(cons(x4,n__zeros)) -> LENGTH(zeros)
 LENGTH(cons(x4,X)) -> LENGTH(X)

Problem 1: 

SCC Processor:
-> Pairs:
 LENGTH(cons(x4,n__zeros)) -> LENGTH(zeros)
 LENGTH(cons(x4,X)) -> LENGTH(X)
-> Rules:
 activate(n__zeros) -> zeros
 activate(X) -> X
 and(tt,X) -> activate(X)
 length(cons(N,L)) -> s(length(activate(L)))
 length(nil) -> 0
 zeros -> cons(0,n__zeros)
 zeros -> n__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 LENGTH(cons(x4,n__zeros)) -> LENGTH(zeros)
 LENGTH(cons(x4,X)) -> LENGTH(X)
->->-> Rules:
 activate(n__zeros) -> zeros
 activate(X) -> X
 and(tt,X) -> activate(X)
 length(cons(N,L)) -> s(length(activate(L)))
 length(nil) -> 0
 zeros -> cons(0,n__zeros)
 zeros -> n__zeros

Problem 1: 

Narrowing Processor:
-> Pairs:
 LENGTH(cons(x4,n__zeros)) -> LENGTH(zeros)
 LENGTH(cons(x4,X)) -> LENGTH(X)
-> Rules:
 activate(n__zeros) -> zeros
 activate(X) -> X
 and(tt,X) -> activate(X)
 length(cons(N,L)) -> s(length(activate(L)))
 length(nil) -> 0
 zeros -> cons(0,n__zeros)
 zeros -> n__zeros
->Narrowed Pairs:
->->Original Pair:
 LENGTH(cons(x4,n__zeros)) -> LENGTH(zeros)
->-> Narrowed pairs:
 LENGTH(cons(x5,n__zeros)) -> LENGTH(cons(0,n__zeros))
 LENGTH(cons(x5,n__zeros)) -> LENGTH(n__zeros)

Problem 1: 

Infinite Processor:
-> Pairs:
 LENGTH(cons(x4,X)) -> LENGTH(X)
 LENGTH(cons(x5,n__zeros)) -> LENGTH(cons(0,n__zeros))
 LENGTH(cons(x5,n__zeros)) -> LENGTH(n__zeros)
-> Rules:
 activate(n__zeros) -> zeros
 activate(X) -> X
 and(tt,X) -> activate(X)
 length(cons(N,L)) -> s(length(activate(L)))
 length(nil) -> 0
 zeros -> cons(0,n__zeros)
 zeros -> n__zeros
-> Pairs in cycle:
 LENGTH(cons(x5,n__zeros)) -> LENGTH(cons(0,n__zeros))

The problem is infinite.