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


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


YES

Problem 1: 

(VAR L X)
(STRATEGY CONTEXTSENSITIVE
(adx 1)
(head 1)
(incr 1)
(nats)
(tail 1)
(zeros)
(0)
(cons 1)
(nil)
(s 1)
)
(RULES
adx(cons(X,L)) -> incr(cons(X,adx(L)))
adx(nil) -> nil
head(cons(X,L)) -> X
incr(cons(X,L)) -> cons(s(X),incr(L))
incr(nil) -> nil
nats -> adx(zeros)
tail(cons(X,L)) -> L
zeros -> cons(0,zeros)
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 adx(cons(X,L)) -> incr(cons(X,adx(L)))
 adx(nil) -> nil
 head(cons(X,L)) -> X
 incr(cons(X,L)) -> cons(s(X),incr(L))
 incr(nil) -> nil
 nats -> adx(zeros)
 tail(cons(X,L)) -> L
 zeros -> cons(0,zeros)
-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ADX(cons(X,L)) -> INCR(cons(X,adx(L)))
 NATS -> ADX(zeros)
 NATS -> ZEROS
 TAIL(cons(X,L)) -> L
-> Rules:
 adx(cons(X,L)) -> incr(cons(X,adx(L)))
 adx(nil) -> nil
 head(cons(X,L)) -> X
 incr(cons(X,L)) -> cons(s(X),incr(L))
 incr(nil) -> nil
 nats -> adx(zeros)
 tail(cons(X,L)) -> L
 zeros -> cons(0,zeros)
-> Unhiding Rules:
 adx(L) -> ADX(L)
 adx(x2) -> x2
 incr(L) -> INCR(L)
 incr(x2) -> x2
 zeros -> ZEROS

Problem 1: 

SCC Processor:
-> Pairs:
 ADX(cons(X,L)) -> INCR(cons(X,adx(L)))
 NATS -> ADX(zeros)
 NATS -> ZEROS
 TAIL(cons(X,L)) -> L
-> Rules:
 adx(cons(X,L)) -> incr(cons(X,adx(L)))
 adx(nil) -> nil
 head(cons(X,L)) -> X
 incr(cons(X,L)) -> cons(s(X),incr(L))
 incr(nil) -> nil
 nats -> adx(zeros)
 tail(cons(X,L)) -> L
 zeros -> cons(0,zeros)
-> Unhiding rules:
 adx(L) -> ADX(L)
 adx(x2) -> x2
 incr(L) -> INCR(L)
 incr(x2) -> x2
 zeros -> ZEROS
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.