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


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


YES

Problem 1: 

(VAR X X1 X2 XS)
(RULES
active(cons(X1,X2)) -> cons(active(X1),X2)
active(tail(cons(X,XS))) -> mark(XS)
active(tail(X)) -> tail(active(X))
active(zeros) -> mark(cons(0,zeros))
cons(mark(X1),X2) -> mark(cons(X1,X2))
cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
proper(tail(X)) -> tail(proper(X))
proper(0) -> ok(0)
proper(zeros) -> ok(zeros)
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(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(tail(X)) -> ACTIVE(X)
 ACTIVE(tail(X)) -> TAIL(active(X))
 CONS(mark(X1),X2) -> CONS(X1,X2)
 CONS(ok(X1),ok(X2)) -> CONS(X1,X2)
 PROPER(cons(X1,X2)) -> CONS(proper(X1),proper(X2))
 PROPER(cons(X1,X2)) -> PROPER(X1)
 PROPER(cons(X1,X2)) -> PROPER(X2)
 PROPER(tail(X)) -> PROPER(X)
 PROPER(tail(X)) -> TAIL(proper(X))
 TAIL(mark(X)) -> TAIL(X)
 TAIL(ok(X)) -> TAIL(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(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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(tail(X)) -> ACTIVE(X)
 ACTIVE(tail(X)) -> TAIL(active(X))
 CONS(mark(X1),X2) -> CONS(X1,X2)
 CONS(ok(X1),ok(X2)) -> CONS(X1,X2)
 PROPER(cons(X1,X2)) -> CONS(proper(X1),proper(X2))
 PROPER(cons(X1,X2)) -> PROPER(X1)
 PROPER(cons(X1,X2)) -> PROPER(X2)
 PROPER(tail(X)) -> PROPER(X)
 PROPER(tail(X)) -> TAIL(proper(X))
 TAIL(mark(X)) -> TAIL(X)
 TAIL(ok(X)) -> TAIL(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(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 TAIL(mark(X)) -> TAIL(X)
 TAIL(ok(X)) -> TAIL(X)
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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(tail(X)) -> PROPER(X)
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 ACTIVE(cons(X1,X2)) -> ACTIVE(X1)
 ACTIVE(tail(X)) -> ACTIVE(X)
->->-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))


The problem is decomposed in 5 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 TAIL(mark(X)) -> TAIL(X)
 TAIL(ok(X)) -> TAIL(X)
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(TAIL) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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:
 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(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(CONS) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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:
 PROPER(cons(X1,X2)) -> PROPER(X1)
 PROPER(cons(X1,X2)) -> PROPER(X2)
 PROPER(tail(X)) -> PROPER(X)
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(PROPER) = 1

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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:
 ACTIVE(cons(X1,X2)) -> ACTIVE(X1)
 ACTIVE(tail(X)) -> ACTIVE(X)
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(ACTIVE) = 1

Problem 1.4: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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: 

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(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
-> Usable rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[active](X) = X
[cons](X1,X2) = 2.X1 + 1/2.X2
[proper](X) = X
[tail](X) = 2.X + 1
[0] = 0
[mark](X) = X + 1/2
[ok](X) = X
[zeros] = 1
[TOP](X) = 2.X

Problem 1.5: 

SCC Processor:
-> Pairs:
 TOP(ok(X)) -> TOP(active(X))
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Problem 1.5: 

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

Problem 1.5: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(tail(cons(X,XS))) -> mark(XS)
 active(tail(X)) -> tail(active(X))
 active(zeros) -> mark(cons(0,zeros))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(tail(X)) -> tail(proper(X))
 proper(0) -> ok(0)
 proper(zeros) -> ok(zeros)
 tail(mark(X)) -> mark(tail(X))
 tail(ok(X)) -> ok(tail(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.