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


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


NO

Problem 1: 

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

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVATE(n__incr(X:S)) -> ACTIVATE(X:S)
 ACTIVATE(n__incr(X:S)) -> INCR(activate(X:S))
 ACTIVATE(n__nats) -> NATS
 ACTIVATE(n__odds) -> ODDS
 INCR(cons(X:S,XS:S)) -> ACTIVATE(XS:S)
 ODDS -> INCR(pairs)
 ODDS -> PAIRS
 TAIL(cons(X:S,XS:S)) -> ACTIVATE(XS:S)
-> Rules:
 activate(n__incr(X:S)) -> incr(activate(X:S))
 activate(n__nats) -> nats
 activate(n__odds) -> odds
 activate(X:S) -> X:S
 head(cons(X:S,XS:S)) -> X:S
 incr(cons(X:S,XS:S)) -> cons(s(X:S),n__incr(activate(XS:S)))
 incr(X:S) -> n__incr(X:S)
 nats -> cons(0,n__incr(n__nats))
 nats -> n__nats
 odds -> incr(pairs)
 odds -> n__odds
 pairs -> cons(0,n__incr(n__odds))
 tail(cons(X:S,XS:S)) -> activate(XS:S)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ACTIVATE(n__incr(X:S)) -> ACTIVATE(X:S)
 ACTIVATE(n__incr(X:S)) -> INCR(activate(X:S))
 ACTIVATE(n__odds) -> ODDS
 INCR(cons(X:S,XS:S)) -> ACTIVATE(XS:S)
 ODDS -> INCR(pairs)
->->-> Rules:
 activate(n__incr(X:S)) -> incr(activate(X:S))
 activate(n__nats) -> nats
 activate(n__odds) -> odds
 activate(X:S) -> X:S
 head(cons(X:S,XS:S)) -> X:S
 incr(cons(X:S,XS:S)) -> cons(s(X:S),n__incr(activate(XS:S)))
 incr(X:S) -> n__incr(X:S)
 nats -> cons(0,n__incr(n__nats))
 nats -> n__nats
 odds -> incr(pairs)
 odds -> n__odds
 pairs -> cons(0,n__incr(n__odds))
 tail(cons(X:S,XS:S)) -> activate(XS:S)

Problem 1: 

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

The problem is infinite.