/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 X3)
(RULES
active(f(a,X,X)) -> mark(f(X,b,b))
active(b) -> mark(a)
f(active(X1),X2,X3) -> f(X1,X2,X3)
f(mark(X1),X2,X3) -> f(X1,X2,X3)
f(X1,active(X2),X3) -> f(X1,X2,X3)
f(X1,mark(X2),X3) -> f(X1,X2,X3)
f(X1,X2,active(X3)) -> f(X1,X2,X3)
f(X1,X2,mark(X3)) -> f(X1,X2,X3)
mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
mark(a) -> active(a)
mark(b) -> active(b)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVE(f(a,X,X)) -> F(X,b,b)
 ACTIVE(f(a,X,X)) -> MARK(f(X,b,b))
 ACTIVE(b) -> MARK(a)
 F(active(X1),X2,X3) -> F(X1,X2,X3)
 F(mark(X1),X2,X3) -> F(X1,X2,X3)
 F(X1,active(X2),X3) -> F(X1,X2,X3)
 F(X1,mark(X2),X3) -> F(X1,X2,X3)
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
 MARK(f(X1,X2,X3)) -> ACTIVE(f(X1,mark(X2),X3))
 MARK(f(X1,X2,X3)) -> F(X1,mark(X2),X3)
 MARK(f(X1,X2,X3)) -> MARK(X2)
 MARK(b) -> ACTIVE(b)
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVE(f(a,X,X)) -> F(X,b,b)
 ACTIVE(f(a,X,X)) -> MARK(f(X,b,b))
 ACTIVE(b) -> MARK(a)
 F(active(X1),X2,X3) -> F(X1,X2,X3)
 F(mark(X1),X2,X3) -> F(X1,X2,X3)
 F(X1,active(X2),X3) -> F(X1,X2,X3)
 F(X1,mark(X2),X3) -> F(X1,X2,X3)
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
 MARK(f(X1,X2,X3)) -> ACTIVE(f(X1,mark(X2),X3))
 MARK(f(X1,X2,X3)) -> F(X1,mark(X2),X3)
 MARK(f(X1,X2,X3)) -> MARK(X2)
 MARK(b) -> ACTIVE(b)
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(active(X1),X2,X3) -> F(X1,X2,X3)
 F(mark(X1),X2,X3) -> F(X1,X2,X3)
 F(X1,active(X2),X3) -> F(X1,X2,X3)
 F(X1,mark(X2),X3) -> F(X1,X2,X3)
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
->->-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->->Cycle:
->->-> Pairs:
 ACTIVE(f(a,X,X)) -> MARK(f(X,b,b))
 MARK(f(X1,X2,X3)) -> ACTIVE(f(X1,mark(X2),X3))
 MARK(f(X1,X2,X3)) -> MARK(X2)
->->-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 F(active(X1),X2,X3) -> F(X1,X2,X3)
 F(mark(X1),X2,X3) -> F(X1,X2,X3)
 F(X1,active(X2),X3) -> F(X1,X2,X3)
 F(X1,mark(X2),X3) -> F(X1,X2,X3)
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Projection:
 pi(F) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 F(X1,active(X2),X3) -> F(X1,X2,X3)
 F(X1,mark(X2),X3) -> F(X1,X2,X3)
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(X1,active(X2),X3) -> F(X1,X2,X3)
 F(X1,mark(X2),X3) -> F(X1,X2,X3)
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
->->-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)

Problem 1.1: 

Subterm Processor:
-> Pairs:
 F(X1,active(X2),X3) -> F(X1,X2,X3)
 F(X1,mark(X2),X3) -> F(X1,X2,X3)
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Projection:
 pi(F) = 2

Problem 1.1: 

SCC Processor:
-> Pairs:
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
->->-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)

Problem 1.1: 

Subterm Processor:
-> Pairs:
 F(X1,X2,active(X3)) -> F(X1,X2,X3)
 F(X1,X2,mark(X3)) -> F(X1,X2,X3)
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Projection:
 pi(F) = 3

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Reduction Pair Processor:
-> Pairs:
 ACTIVE(f(a,X,X)) -> MARK(f(X,b,b))
 MARK(f(X1,X2,X3)) -> ACTIVE(f(X1,mark(X2),X3))
 MARK(f(X1,X2,X3)) -> MARK(X2)
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
-> Usable rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[active](X) = X
[f](X1,X2,X3) = 2.X1 + X2 + X3 + 2
[mark](X) = X
[a] = 1
[b] = 1
[ACTIVE](X) = 2.X + 2
[MARK](X) = 2.X + 2

Problem 1.2: 

SCC Processor:
-> Pairs:
 ACTIVE(f(a,X,X)) -> MARK(f(X,b,b))
 MARK(f(X1,X2,X3)) -> ACTIVE(f(X1,mark(X2),X3))
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ACTIVE(f(a,X,X)) -> MARK(f(X,b,b))
 MARK(f(X1,X2,X3)) -> ACTIVE(f(X1,mark(X2),X3))
->->-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)

Problem 1.2: 

Reduction Pair Processor:
-> Pairs:
 ACTIVE(f(a,X,X)) -> MARK(f(X,b,b))
 MARK(f(X1,X2,X3)) -> ACTIVE(f(X1,mark(X2),X3))
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
-> Usable rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 2
->Bound:
 1
->Interpretation:
 
[active](X) = [1 1;1 1].X + [1;1]
[f](X1,X2,X3) = [1 1;1 0].X1 + [1 1;1 0].X3 + [1;0]
[mark](X) = [1 1;1 1].X + [1;1]
[a] = [1;0]
[b] = [0;1]
[ACTIVE](X) = [1 1;1 0].X + [0;1]
[MARK](X) = [1 1;1 0].X + [0;1]

Problem 1.2: 

SCC Processor:
-> Pairs:
 MARK(f(X1,X2,X3)) -> ACTIVE(f(X1,mark(X2),X3))
-> Rules:
 active(f(a,X,X)) -> mark(f(X,b,b))
 active(b) -> mark(a)
 f(active(X1),X2,X3) -> f(X1,X2,X3)
 f(mark(X1),X2,X3) -> f(X1,X2,X3)
 f(X1,active(X2),X3) -> f(X1,X2,X3)
 f(X1,mark(X2),X3) -> f(X1,X2,X3)
 f(X1,X2,active(X3)) -> f(X1,X2,X3)
 f(X1,X2,mark(X3)) -> f(X1,X2,X3)
 mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3))
 mark(a) -> active(a)
 mark(b) -> active(b)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.