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


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


NO

Problem 1: 

(VAR L X Y)
(RULES
eq(0,0) -> true
eq(s(X),s(Y)) -> eq(X,Y)
eq(X,Y) -> false
inf(X) -> cons(X,inf(s(X)))
length(cons(X,L)) -> s(length(L))
length(nil) -> 0
take(0,X) -> nil
take(s(X),cons(Y,L)) -> cons(Y,take(X,L))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 EQ(s(X),s(Y)) -> EQ(X,Y)
 INF(X) -> INF(s(X))
 LENGTH(cons(X,L)) -> LENGTH(L)
 TAKE(s(X),cons(Y,L)) -> TAKE(X,L)
-> Rules:
 eq(0,0) -> true
 eq(s(X),s(Y)) -> eq(X,Y)
 eq(X,Y) -> false
 inf(X) -> cons(X,inf(s(X)))
 length(cons(X,L)) -> s(length(L))
 length(nil) -> 0
 take(0,X) -> nil
 take(s(X),cons(Y,L)) -> cons(Y,take(X,L))

Problem 1: 

Infinite Processor:
-> Pairs:
 EQ(s(X),s(Y)) -> EQ(X,Y)
 INF(X) -> INF(s(X))
 LENGTH(cons(X,L)) -> LENGTH(L)
 TAKE(s(X),cons(Y,L)) -> TAKE(X,L)
-> Rules:
 eq(0,0) -> true
 eq(s(X),s(Y)) -> eq(X,Y)
 eq(X,Y) -> false
 inf(X) -> cons(X,inf(s(X)))
 length(cons(X,L)) -> s(length(L))
 length(nil) -> 0
 take(0,X) -> nil
 take(s(X),cons(Y,L)) -> cons(Y,take(X,L))
-> Pairs in cycle:
 INF(X) -> INF(s(X))

The problem is infinite.