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


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


NO

Problem 1: 

(VAR X XS)
(RULES
activate(n__incr(X)) -> incr(X)
activate(X) -> X
head(cons(X,XS)) -> X
incr(cons(X,XS)) -> cons(s(X),n__incr(activate(XS)))
incr(X) -> n__incr(X)
nats -> cons(0,n__incr(nats))
odds -> incr(pairs)
pairs -> cons(0,n__incr(odds))
tail(cons(X,XS)) -> activate(XS)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__incr(X)) -> INCR(X)
 INCR(cons(X,XS)) -> ACTIVATE(XS)
 NATS -> NATS
 ODDS -> INCR(pairs)
 ODDS -> PAIRS
 PAIRS -> ODDS
 TAIL(cons(X,XS)) -> ACTIVATE(XS)
-> Rules:
 activate(n__incr(X)) -> incr(X)
 activate(X) -> X
 head(cons(X,XS)) -> X
 incr(cons(X,XS)) -> cons(s(X),n__incr(activate(XS)))
 incr(X) -> n__incr(X)
 nats -> cons(0,n__incr(nats))
 odds -> incr(pairs)
 pairs -> cons(0,n__incr(odds))
 tail(cons(X,XS)) -> activate(XS)

Problem 1: 

Infinite Processor:
-> Pairs:
 ACTIVATE(n__incr(X)) -> INCR(X)
 INCR(cons(X,XS)) -> ACTIVATE(XS)
 NATS -> NATS
 ODDS -> INCR(pairs)
 ODDS -> PAIRS
 PAIRS -> ODDS
 TAIL(cons(X,XS)) -> ACTIVATE(XS)
-> Rules:
 activate(n__incr(X)) -> incr(X)
 activate(X) -> X
 head(cons(X,XS)) -> X
 incr(cons(X,XS)) -> cons(s(X),n__incr(activate(XS)))
 incr(X) -> n__incr(X)
 nats -> cons(0,n__incr(nats))
 odds -> incr(pairs)
 pairs -> cons(0,n__incr(odds))
 tail(cons(X,XS)) -> activate(XS)
-> Pairs in cycle:
 NATS -> NATS

The problem is infinite.