YES

Problem 1: 

(VAR v_NonEmpty:S X:S)
(RULES
active(f(f(a))) -> mark(f(g(f(a))))
active(f(X:S)) -> f(active(X:S))
f(mark(X:S)) -> mark(f(X:S))
f(ok(X:S)) -> ok(f(X:S))
g(ok(X:S)) -> ok(g(X:S))
proper(f(X:S)) -> f(proper(X:S))
proper(g(X:S)) -> g(proper(X:S))
proper(a) -> ok(a)
top(mark(X:S)) -> top(proper(X:S))
top(ok(X:S)) -> top(active(X:S))
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVE(f(X:S)) -> ACTIVE(X:S)
 ACTIVE(f(X:S)) -> F(active(X:S))
 F(mark(X:S)) -> F(X:S)
 F(ok(X:S)) -> F(X:S)
 G(ok(X:S)) -> G(X:S)
 PROPER(f(X:S)) -> F(proper(X:S))
 PROPER(f(X:S)) -> PROPER(X:S)
 PROPER(g(X:S)) -> G(proper(X:S))
 PROPER(g(X:S)) -> PROPER(X:S)
 TOP(mark(X:S)) -> PROPER(X:S)
 TOP(mark(X:S)) -> TOP(proper(X:S))
 TOP(ok(X:S)) -> ACTIVE(X:S)
 TOP(ok(X:S)) -> TOP(active(X:S))
-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVE(f(X:S)) -> ACTIVE(X:S)
 ACTIVE(f(X:S)) -> F(active(X:S))
 F(mark(X:S)) -> F(X:S)
 F(ok(X:S)) -> F(X:S)
 G(ok(X:S)) -> G(X:S)
 PROPER(f(X:S)) -> F(proper(X:S))
 PROPER(f(X:S)) -> PROPER(X:S)
 PROPER(g(X:S)) -> G(proper(X:S))
 PROPER(g(X:S)) -> PROPER(X:S)
 TOP(mark(X:S)) -> PROPER(X:S)
 TOP(mark(X:S)) -> TOP(proper(X:S))
 TOP(ok(X:S)) -> ACTIVE(X:S)
 TOP(ok(X:S)) -> TOP(active(X:S))
-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 G(ok(X:S)) -> G(X:S)
->->-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->->Cycle:
->->-> Pairs:
 F(mark(X:S)) -> F(X:S)
 F(ok(X:S)) -> F(X:S)
->->-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->->Cycle:
->->-> Pairs:
 PROPER(f(X:S)) -> PROPER(X:S)
 PROPER(g(X:S)) -> PROPER(X:S)
->->-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->->Cycle:
->->-> Pairs:
 ACTIVE(f(X:S)) -> ACTIVE(X:S)
->->-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->->Cycle:
->->-> Pairs:
 TOP(mark(X:S)) -> TOP(proper(X:S))
 TOP(ok(X:S)) -> TOP(active(X:S))
->->-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))


The problem is decomposed in 5 subproblems.

Problem 1.1: 

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

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

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

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.3: 

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

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.4: 

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

Problem 1.4: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.5: 

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

Problem 1.5: 

SCC Processor:
-> Pairs:
 TOP(ok(X:S)) -> TOP(active(X:S))
-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 TOP(ok(X:S)) -> TOP(active(X:S))
->->-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))

Problem 1.5: 

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

Problem 1.5: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 active(f(f(a))) -> mark(f(g(f(a))))
 active(f(X:S)) -> f(active(X:S))
 f(mark(X:S)) -> mark(f(X:S))
 f(ok(X:S)) -> ok(f(X:S))
 g(ok(X:S)) -> ok(g(X:S))
 proper(f(X:S)) -> f(proper(X:S))
 proper(g(X:S)) -> g(proper(X:S))
 proper(a) -> ok(a)
 top(mark(X:S)) -> top(proper(X:S))
 top(ok(X:S)) -> top(active(X:S))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.