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


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


YES

Problem 1: 

(VAR X X1 X2)
(RULES
active(cons(X1,X2)) -> cons(active(X1),X2)
active(f(s(0))) -> mark(f(p(s(0))))
active(f(0)) -> mark(cons(0,f(s(0))))
active(f(X)) -> f(active(X))
active(p(s(X))) -> mark(X)
active(p(X)) -> p(active(X))
active(s(X)) -> s(active(X))
cons(mark(X1),X2) -> mark(cons(X1,X2))
cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
f(mark(X)) -> mark(f(X))
f(ok(X)) -> ok(f(X))
p(mark(X)) -> mark(p(X))
p(ok(X)) -> ok(p(X))
proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
proper(f(X)) -> f(proper(X))
proper(p(X)) -> p(proper(X))
proper(s(X)) -> s(proper(X))
proper(0) -> ok(0)
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVE(cons(X1,X2)) -> ACTIVE(X1)
 ACTIVE(cons(X1,X2)) -> CONS(active(X1),X2)
 ACTIVE(f(X)) -> ACTIVE(X)
 ACTIVE(f(X)) -> F(active(X))
 ACTIVE(p(X)) -> ACTIVE(X)
 ACTIVE(p(X)) -> P(active(X))
 ACTIVE(s(X)) -> ACTIVE(X)
 ACTIVE(s(X)) -> S(active(X))
 CONS(mark(X1),X2) -> CONS(X1,X2)
 CONS(ok(X1),ok(X2)) -> CONS(X1,X2)
 F(mark(X)) -> F(X)
 F(ok(X)) -> F(X)
 P(mark(X)) -> P(X)
 P(ok(X)) -> P(X)
 PROPER(cons(X1,X2)) -> CONS(proper(X1),proper(X2))
 PROPER(cons(X1,X2)) -> PROPER(X1)
 PROPER(cons(X1,X2)) -> PROPER(X2)
 PROPER(f(X)) -> F(proper(X))
 PROPER(f(X)) -> PROPER(X)
 PROPER(p(X)) -> P(proper(X))
 PROPER(p(X)) -> PROPER(X)
 PROPER(s(X)) -> PROPER(X)
 PROPER(s(X)) -> S(proper(X))
 S(mark(X)) -> S(X)
 S(ok(X)) -> S(X)
 TOP(mark(X)) -> PROPER(X)
 TOP(mark(X)) -> TOP(proper(X))
 TOP(ok(X)) -> ACTIVE(X)
 TOP(ok(X)) -> TOP(active(X))
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVE(cons(X1,X2)) -> ACTIVE(X1)
 ACTIVE(cons(X1,X2)) -> CONS(active(X1),X2)
 ACTIVE(f(X)) -> ACTIVE(X)
 ACTIVE(f(X)) -> F(active(X))
 ACTIVE(p(X)) -> ACTIVE(X)
 ACTIVE(p(X)) -> P(active(X))
 ACTIVE(s(X)) -> ACTIVE(X)
 ACTIVE(s(X)) -> S(active(X))
 CONS(mark(X1),X2) -> CONS(X1,X2)
 CONS(ok(X1),ok(X2)) -> CONS(X1,X2)
 F(mark(X)) -> F(X)
 F(ok(X)) -> F(X)
 P(mark(X)) -> P(X)
 P(ok(X)) -> P(X)
 PROPER(cons(X1,X2)) -> CONS(proper(X1),proper(X2))
 PROPER(cons(X1,X2)) -> PROPER(X1)
 PROPER(cons(X1,X2)) -> PROPER(X2)
 PROPER(f(X)) -> F(proper(X))
 PROPER(f(X)) -> PROPER(X)
 PROPER(p(X)) -> P(proper(X))
 PROPER(p(X)) -> PROPER(X)
 PROPER(s(X)) -> PROPER(X)
 PROPER(s(X)) -> S(proper(X))
 S(mark(X)) -> S(X)
 S(ok(X)) -> S(X)
 TOP(mark(X)) -> PROPER(X)
 TOP(mark(X)) -> TOP(proper(X))
 TOP(ok(X)) -> ACTIVE(X)
 TOP(ok(X)) -> TOP(active(X))
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 S(mark(X)) -> S(X)
 S(ok(X)) -> S(X)
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 P(mark(X)) -> P(X)
 P(ok(X)) -> P(X)
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 F(mark(X)) -> F(X)
 F(ok(X)) -> F(X)
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 CONS(mark(X1),X2) -> CONS(X1,X2)
 CONS(ok(X1),ok(X2)) -> CONS(X1,X2)
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 PROPER(cons(X1,X2)) -> PROPER(X1)
 PROPER(cons(X1,X2)) -> PROPER(X2)
 PROPER(f(X)) -> PROPER(X)
 PROPER(p(X)) -> PROPER(X)
 PROPER(s(X)) -> PROPER(X)
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 ACTIVE(cons(X1,X2)) -> ACTIVE(X1)
 ACTIVE(f(X)) -> ACTIVE(X)
 ACTIVE(p(X)) -> ACTIVE(X)
 ACTIVE(s(X)) -> ACTIVE(X)
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 TOP(mark(X)) -> TOP(proper(X))
 TOP(ok(X)) -> TOP(active(X))
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))


The problem is decomposed in 7 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 S(mark(X)) -> S(X)
 S(ok(X)) -> S(X)
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(S) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 P(mark(X)) -> P(X)
 P(ok(X)) -> P(X)
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(P) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.3: 

Subterm Processor:
-> Pairs:
 F(mark(X)) -> F(X)
 F(ok(X)) -> F(X)
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(F) = 1

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.4: 

Subterm Processor:
-> Pairs:
 CONS(mark(X1),X2) -> CONS(X1,X2)
 CONS(ok(X1),ok(X2)) -> CONS(X1,X2)
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(CONS) = 1

Problem 1.4: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.5: 

Subterm Processor:
-> Pairs:
 PROPER(cons(X1,X2)) -> PROPER(X1)
 PROPER(cons(X1,X2)) -> PROPER(X2)
 PROPER(f(X)) -> PROPER(X)
 PROPER(p(X)) -> PROPER(X)
 PROPER(s(X)) -> PROPER(X)
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(PROPER) = 1

Problem 1.5: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.6: 

Subterm Processor:
-> Pairs:
 ACTIVE(cons(X1,X2)) -> ACTIVE(X1)
 ACTIVE(f(X)) -> ACTIVE(X)
 ACTIVE(p(X)) -> ACTIVE(X)
 ACTIVE(s(X)) -> ACTIVE(X)
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(ACTIVE) = 1

Problem 1.6: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.7: 

Reduction Pair Processor:
-> Pairs:
 TOP(mark(X)) -> TOP(proper(X))
 TOP(ok(X)) -> TOP(active(X))
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
-> Usable rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 2
->Bound:
 1
->Interpretation:
 
[active](X) = [1 0;0 1].X
[cons](X1,X2) = [0 1;0 1].X1
[f](X) = [0 1;0 1].X + [1;1]
[p](X) = [0 1;1 0].X + [1;1]
[proper](X) = [1 0;0 1].X
[s](X) = [0 1;1 0].X + [0;1]
[0] = [1;0]
[mark](X) = [1 0;0 1].X + [1;1]
[ok](X) = [1 0;0 1].X
[TOP](X) = [1 0;1 1].X

Problem 1.7: 

SCC Processor:
-> Pairs:
 TOP(ok(X)) -> TOP(active(X))
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 TOP(ok(X)) -> TOP(active(X))
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Problem 1.7: 

Reduction Pair Processor:
-> Pairs:
 TOP(ok(X)) -> TOP(active(X))
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
-> Usable rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[active](X) = 0
[cons](X1,X2) = 2.X1
[f](X) = 2.X
[p](X) = 2.X
[s](X) = 2.X
[0] = 0
[mark](X) = 0
[ok](X) = 1
[TOP](X) = 2.X

Problem 1.7: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(f(s(0))) -> mark(f(p(s(0))))
 active(f(0)) -> mark(cons(0,f(s(0))))
 active(f(X)) -> f(active(X))
 active(p(s(X))) -> mark(X)
 active(p(X)) -> p(active(X))
 active(s(X)) -> s(active(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 p(mark(X)) -> mark(p(X))
 p(ok(X)) -> ok(p(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(f(X)) -> f(proper(X))
 proper(p(X)) -> p(proper(X))
 proper(s(X)) -> s(proper(X))
 proper(0) -> ok(0)
 s(mark(X)) -> mark(s(X))
 s(ok(X)) -> ok(s(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.