Termination w.r.t. Q of the given QTRS could not be shown:

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

active(g(X)) → mark(h(X))
active(c) → mark(d)
active(h(d)) → mark(g(c))
mark(g(X)) → active(g(X))
mark(h(X)) → active(h(X))
mark(c) → active(c)
mark(d) → active(d)
g(mark(X)) → g(X)
g(active(X)) → g(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:

[c, d] > [g₁, h₁] > [active₁, mark₁]

Status:

active₁: [1]
c: []
g₁: [1]
h₁: [1]
mark₁: [1]
d: []

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

g(mark(X)) → g(X)
g(active(X)) → g(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)

(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

active(g(X)) → mark(h(X))
active(c) → mark(d)
active(h(d)) → mark(g(c))
mark(g(X)) → active(g(X))
mark(h(X)) → active(h(X))
mark(c) → active(c)
mark(d) → active(d)

Q is empty.