/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)
(RULES
active(f(f(a))) -> mark(c(f(g(f(a)))))
active(f(X)) -> f(active(X))
active(g(X)) -> g(active(X))
c(ok(X)) -> ok(c(X))
f(mark(X)) -> mark(f(X))
f(ok(X)) -> ok(f(X))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(c(X)) -> c(proper(X))
proper(f(X)) -> f(proper(X))
proper(g(X)) -> g(proper(X))
proper(a) -> ok(a)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVE(f(X)) -> ACTIVE(X)
 ACTIVE(f(X)) -> F(active(X))
 ACTIVE(g(X)) -> ACTIVE(X)
 ACTIVE(g(X)) -> G(active(X))
 C(ok(X)) -> C(X)
 F(mark(X)) -> F(X)
 F(ok(X)) -> F(X)
 G(mark(X)) -> G(X)
 G(ok(X)) -> G(X)
 PROPER(c(X)) -> C(proper(X))
 PROPER(c(X)) -> PROPER(X)
 PROPER(f(X)) -> F(proper(X))
 PROPER(f(X)) -> PROPER(X)
 PROPER(g(X)) -> G(proper(X))
 PROPER(g(X)) -> PROPER(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(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVE(f(X)) -> ACTIVE(X)
 ACTIVE(f(X)) -> F(active(X))
 ACTIVE(g(X)) -> ACTIVE(X)
 ACTIVE(g(X)) -> G(active(X))
 C(ok(X)) -> C(X)
 F(mark(X)) -> F(X)
 F(ok(X)) -> F(X)
 G(mark(X)) -> G(X)
 G(ok(X)) -> G(X)
 PROPER(c(X)) -> C(proper(X))
 PROPER(c(X)) -> PROPER(X)
 PROPER(f(X)) -> F(proper(X))
 PROPER(f(X)) -> PROPER(X)
 PROPER(g(X)) -> G(proper(X))
 PROPER(g(X)) -> PROPER(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(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 G(mark(X)) -> G(X)
 G(ok(X)) -> G(X)
->->-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 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(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 C(ok(X)) -> C(X)
->->-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 PROPER(c(X)) -> PROPER(X)
 PROPER(f(X)) -> PROPER(X)
 PROPER(g(X)) -> PROPER(X)
->->-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->->Cycle:
->->-> Pairs:
 ACTIVE(f(X)) -> ACTIVE(X)
 ACTIVE(g(X)) -> ACTIVE(X)
->->-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 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(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))


The problem is decomposed in 6 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 G(mark(X)) -> G(X)
 G(ok(X)) -> G(X)
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(G) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 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:
 F(mark(X)) -> F(X)
 F(ok(X)) -> F(X)
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(F) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 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:
 C(ok(X)) -> C(X)
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(C) = 1

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 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:
 PROPER(c(X)) -> PROPER(X)
 PROPER(f(X)) -> PROPER(X)
 PROPER(g(X)) -> PROPER(X)
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(PROPER) = 1

Problem 1.4: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 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:
 ACTIVE(f(X)) -> ACTIVE(X)
 ACTIVE(g(X)) -> ACTIVE(X)
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
->Projection:
 pi(ACTIVE) = 1

Problem 1.5: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 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: 

Reduction Pair Processor:
-> Pairs:
 TOP(mark(X)) -> TOP(proper(X))
 TOP(ok(X)) -> TOP(active(X))
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
-> Usable rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[active](X) = X
[c](X) = 1
[f](X) = 2.X + 2
[g](X) = 2.X + 2
[proper](X) = 2.X
[a] = 0
[mark](X) = 2.X + 2
[ok](X) = X
[TOP](X) = X

Problem 1.6: 

SCC Processor:
-> Pairs:
 TOP(ok(X)) -> TOP(active(X))
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 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(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Problem 1.6: 

Reduction Pair Processor:
-> Pairs:
 TOP(ok(X)) -> TOP(active(X))
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))
-> Usable rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[active](X) = 2.X + 1
[c](X) = 2.X
[f](X) = 2.X + 2
[g](X) = X
[a] = 0
[mark](X) = X + 1
[ok](X) = 2.X + 2
[TOP](X) = 2.X

Problem 1.6: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(c(f(g(f(a)))))
 active(f(X)) -> f(active(X))
 active(g(X)) -> g(active(X))
 c(ok(X)) -> ok(c(X))
 f(mark(X)) -> mark(f(X))
 f(ok(X)) -> ok(f(X))
 g(mark(X)) -> mark(g(X))
 g(ok(X)) -> ok(g(X))
 proper(c(X)) -> c(proper(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(a) -> ok(a)
 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.