YES TRS: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} DP: Strict: { f#(mark(X)) -> f#(X), f#(ok(X)) -> f#(X), g#(ok(X)) -> g#(X), active#(f(X)) -> f#(active(X)), active#(f(X)) -> active#(X), active#(f(f(a()))) -> f#(g(f(a()))), active#(f(f(a()))) -> g#(f(a())), 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))} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} EDG: {(f#(ok(X)) -> f#(X), f#(ok(X)) -> f#(X)) (f#(ok(X)) -> f#(X), f#(mark(X)) -> f#(X)) (active#(f(X)) -> active#(X), active#(f(f(a()))) -> g#(f(a()))) (active#(f(X)) -> active#(X), active#(f(f(a()))) -> f#(g(f(a())))) (active#(f(X)) -> active#(X), active#(f(X)) -> active#(X)) (active#(f(X)) -> active#(X), active#(f(X)) -> f#(active(X))) (proper#(g(X)) -> proper#(X), proper#(g(X)) -> proper#(X)) (proper#(g(X)) -> proper#(X), proper#(g(X)) -> g#(proper(X))) (proper#(g(X)) -> proper#(X), proper#(f(X)) -> proper#(X)) (proper#(g(X)) -> proper#(X), proper#(f(X)) -> f#(proper(X))) (top#(ok(X)) -> active#(X), active#(f(f(a()))) -> g#(f(a()))) (top#(ok(X)) -> active#(X), active#(f(f(a()))) -> f#(g(f(a())))) (top#(ok(X)) -> active#(X), active#(f(X)) -> active#(X)) (top#(ok(X)) -> active#(X), active#(f(X)) -> f#(active(X))) (proper#(f(X)) -> f#(proper(X)), f#(ok(X)) -> f#(X)) (proper#(f(X)) -> f#(proper(X)), f#(mark(X)) -> f#(X)) (top#(mark(X)) -> top#(proper(X)), top#(ok(X)) -> top#(active(X))) (top#(mark(X)) -> top#(proper(X)), top#(ok(X)) -> active#(X)) (top#(mark(X)) -> top#(proper(X)), top#(mark(X)) -> top#(proper(X))) (top#(mark(X)) -> top#(proper(X)), top#(mark(X)) -> proper#(X)) (top#(ok(X)) -> top#(active(X)), top#(mark(X)) -> proper#(X)) (top#(ok(X)) -> top#(active(X)), top#(mark(X)) -> top#(proper(X))) (top#(ok(X)) -> top#(active(X)), top#(ok(X)) -> active#(X)) (top#(ok(X)) -> top#(active(X)), top#(ok(X)) -> top#(active(X))) (proper#(g(X)) -> g#(proper(X)), g#(ok(X)) -> g#(X)) (active#(f(X)) -> f#(active(X)), f#(mark(X)) -> f#(X)) (active#(f(X)) -> f#(active(X)), f#(ok(X)) -> f#(X)) (top#(mark(X)) -> proper#(X), proper#(f(X)) -> f#(proper(X))) (top#(mark(X)) -> proper#(X), proper#(f(X)) -> proper#(X)) (top#(mark(X)) -> proper#(X), proper#(g(X)) -> g#(proper(X))) (top#(mark(X)) -> proper#(X), proper#(g(X)) -> proper#(X)) (proper#(f(X)) -> proper#(X), proper#(f(X)) -> f#(proper(X))) (proper#(f(X)) -> proper#(X), proper#(f(X)) -> proper#(X)) (proper#(f(X)) -> proper#(X), proper#(g(X)) -> g#(proper(X))) (proper#(f(X)) -> proper#(X), proper#(g(X)) -> proper#(X)) (g#(ok(X)) -> g#(X), g#(ok(X)) -> g#(X)) (f#(mark(X)) -> f#(X), f#(mark(X)) -> f#(X)) (f#(mark(X)) -> f#(X), f#(ok(X)) -> f#(X))} SCCS: Scc: {top#(mark(X)) -> top#(proper(X)), top#(ok(X)) -> top#(active(X))} Scc: {proper#(f(X)) -> proper#(X), proper#(g(X)) -> proper#(X)} Scc: {active#(f(X)) -> active#(X)} Scc: {g#(ok(X)) -> g#(X)} Scc: {f#(mark(X)) -> f#(X), f#(ok(X)) -> f#(X)} SCC: Strict: {top#(mark(X)) -> top#(proper(X)), top#(ok(X)) -> top#(active(X))} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} POLY: Argument Filtering: pi(top#) = 0, pi(top) = [], pi(ok) = 0, pi(proper) = 0, pi(active) = 0, pi(a) = [], pi(g) = [], pi(f) = 0, pi(mark) = [0] Usable Rules: {} Interpretation: [mark](x0) = x0 + 1 Strict: {top#(ok(X)) -> top#(active(X))} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} EDG: {(top#(ok(X)) -> top#(active(X)), top#(ok(X)) -> top#(active(X)))} SCCS: Scc: {top#(ok(X)) -> top#(active(X))} SCC: Strict: {top#(ok(X)) -> top#(active(X))} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} POLY: Argument Filtering: pi(top#) = 0, pi(top) = [], pi(ok) = [], pi(proper) = [], pi(active) = [], pi(a) = [], pi(g) = [], pi(f) = 0, pi(mark) = [] Usable Rules: {} Interpretation: [ok] = 1, [active] = 0 Strict: {} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} Qed SCC: Strict: {proper#(f(X)) -> proper#(X), proper#(g(X)) -> proper#(X)} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} SPSC: Simple Projection: pi(proper#) = 0 Strict: {proper#(g(X)) -> proper#(X)} EDG: {(proper#(g(X)) -> proper#(X), proper#(g(X)) -> proper#(X))} SCCS: Scc: {proper#(g(X)) -> proper#(X)} SCC: Strict: {proper#(g(X)) -> proper#(X)} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} SPSC: Simple Projection: pi(proper#) = 0 Strict: {} Qed SCC: Strict: {active#(f(X)) -> active#(X)} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} SPSC: Simple Projection: pi(active#) = 0 Strict: {} Qed SCC: Strict: {g#(ok(X)) -> g#(X)} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} SPSC: Simple Projection: pi(g#) = 0 Strict: {} Qed SCC: Strict: {f#(mark(X)) -> f#(X), f#(ok(X)) -> f#(X)} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} SPSC: Simple Projection: pi(f#) = 0 Strict: {f#(ok(X)) -> f#(X)} EDG: {(f#(ok(X)) -> f#(X), f#(ok(X)) -> f#(X))} SCCS: Scc: {f#(ok(X)) -> f#(X)} SCC: Strict: {f#(ok(X)) -> f#(X)} Weak: { f(mark(X)) -> mark(f(X)), f(ok(X)) -> ok(f(X)), g(ok(X)) -> ok(g(X)), active(f(X)) -> f(active(X)), active(f(f(a()))) -> mark(f(g(f(a())))), 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))} SPSC: Simple Projection: pi(f#) = 0 Strict: {} Qed