0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 AND
↳5 QDP
↳6 QDPOrderProof (⇔)
↳7 QDP
↳8 PisEmptyProof (⇔)
↳9 TRUE
↳10 QDP
↳11 QDPOrderProof (⇔)
↳12 QDP
↳13 PisEmptyProof (⇔)
↳14 TRUE
↳15 QDP
↳16 QDPOrderProof (⇔)
↳17 QDP
↳18 PisEmptyProof (⇔)
↳19 TRUE
↳20 QDP
↳21 QDPOrderProof (⇔)
↳22 QDP
↳23 PisEmptyProof (⇔)
↳24 TRUE
↳25 QDP
↳26 QDPOrderProof (⇔)
↳27 QDP
↳28 PisEmptyProof (⇔)
↳29 TRUE
↳30 QDP
↳31 QDPOrderProof (⇔)
↳32 QDP
↳33 QDPOrderProof (⇔)
↳34 QDP
↳35 QDPOrderProof (⇔)
↳36 QDP
↳37 QDPOrderProof (⇔)
↳38 QDP
↳39 QDPOrderProof (⇔)
↳40 QDP
↳41 DependencyGraphProof (⇔)
↳42 TRUE
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
ACTIVE(f(f(X))) → MARK(c(f(g(f(X)))))
ACTIVE(f(f(X))) → C(f(g(f(X))))
ACTIVE(f(f(X))) → F(g(f(X)))
ACTIVE(f(f(X))) → G(f(X))
ACTIVE(c(X)) → MARK(d(X))
ACTIVE(c(X)) → D(X)
ACTIVE(h(X)) → MARK(c(d(X)))
ACTIVE(h(X)) → C(d(X))
ACTIVE(h(X)) → D(X)
MARK(f(X)) → ACTIVE(f(mark(X)))
MARK(f(X)) → F(mark(X))
MARK(f(X)) → MARK(X)
MARK(c(X)) → ACTIVE(c(X))
MARK(g(X)) → ACTIVE(g(X))
MARK(d(X)) → ACTIVE(d(X))
MARK(h(X)) → ACTIVE(h(mark(X)))
MARK(h(X)) → H(mark(X))
MARK(h(X)) → MARK(X)
F(mark(X)) → F(X)
F(active(X)) → F(X)
C(mark(X)) → C(X)
C(active(X)) → C(X)
G(mark(X)) → G(X)
G(active(X)) → G(X)
D(mark(X)) → D(X)
D(active(X)) → D(X)
H(mark(X)) → H(X)
H(active(X)) → H(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
H(active(X)) → H(X)
H(mark(X)) → H(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
H(active(X)) → H(X)
H(mark(X)) → H(X)
H1 > [c, d, h]
g > [active1, mark1, f] > [c, d, h]
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
D(active(X)) → D(X)
D(mark(X)) → D(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
D(active(X)) → D(X)
D(mark(X)) → D(X)
D1 > [c, d, h]
g > [active1, mark1, f] > [c, d, h]
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
G(active(X)) → G(X)
G(mark(X)) → G(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
G(active(X)) → G(X)
G(mark(X)) → G(X)
G1 > [c, d, h]
g > [active1, mark1, f] > [c, d, h]
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
C(active(X)) → C(X)
C(mark(X)) → C(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
C(active(X)) → C(X)
C(mark(X)) → C(X)
C1 > [c, d, h]
g > [active1, mark1, f] > [c, d, h]
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
F(active(X)) → F(X)
F(mark(X)) → F(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(active(X)) → F(X)
F(mark(X)) → F(X)
F1 > [c, d, h]
g > [active1, mark1, f] > [c, d, h]
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
MARK(f(X)) → ACTIVE(f(mark(X)))
ACTIVE(f(f(X))) → MARK(c(f(g(f(X)))))
MARK(f(X)) → MARK(X)
MARK(c(X)) → ACTIVE(c(X))
ACTIVE(c(X)) → MARK(d(X))
MARK(g(X)) → ACTIVE(g(X))
ACTIVE(h(X)) → MARK(c(d(X)))
MARK(d(X)) → ACTIVE(d(X))
MARK(h(X)) → ACTIVE(h(mark(X)))
MARK(h(X)) → MARK(X)
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
ACTIVE(h(X)) → MARK(c(d(X)))
MARK(h(X)) → MARK(X)
h1 > g
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
MARK(f(X)) → ACTIVE(f(mark(X)))
ACTIVE(f(f(X))) → MARK(c(f(g(f(X)))))
MARK(f(X)) → MARK(X)
MARK(c(X)) → ACTIVE(c(X))
ACTIVE(c(X)) → MARK(d(X))
MARK(g(X)) → ACTIVE(g(X))
MARK(d(X)) → ACTIVE(d(X))
MARK(h(X)) → ACTIVE(h(mark(X)))
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
MARK(f(X)) → MARK(X)
trivial
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
MARK(f(X)) → ACTIVE(f(mark(X)))
ACTIVE(f(f(X))) → MARK(c(f(g(f(X)))))
MARK(c(X)) → ACTIVE(c(X))
ACTIVE(c(X)) → MARK(d(X))
MARK(g(X)) → ACTIVE(g(X))
MARK(d(X)) → ACTIVE(d(X))
MARK(h(X)) → ACTIVE(h(mark(X)))
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
ACTIVE(f(f(X))) → MARK(c(f(g(f(X)))))
[f, g1] > [MARK1, ACTIVE1] > [c, d]
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
MARK(f(X)) → ACTIVE(f(mark(X)))
MARK(c(X)) → ACTIVE(c(X))
ACTIVE(c(X)) → MARK(d(X))
MARK(g(X)) → ACTIVE(g(X))
MARK(d(X)) → ACTIVE(d(X))
MARK(h(X)) → ACTIVE(h(mark(X)))
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
MARK(f(X)) → ACTIVE(f(mark(X)))
MARK(g(X)) → ACTIVE(g(X))
MARK(h(X)) → ACTIVE(h(mark(X)))
[f1, ACTIVE, c, d, g1, h1]
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
MARK(c(X)) → ACTIVE(c(X))
ACTIVE(c(X)) → MARK(d(X))
MARK(d(X)) → ACTIVE(d(X))
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
ACTIVE(c(X)) → MARK(d(X))
[MARK1, ACTIVE1] > [c, f, mark, h] > g > d
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)
MARK(c(X)) → ACTIVE(c(X))
MARK(d(X)) → ACTIVE(d(X))
active(f(f(X))) → mark(c(f(g(f(X)))))
active(c(X)) → mark(d(X))
active(h(X)) → mark(c(d(X)))
mark(f(X)) → active(f(mark(X)))
mark(c(X)) → active(c(X))
mark(g(X)) → active(g(X))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(mark(X)) → f(X)
f(active(X)) → f(X)
c(mark(X)) → c(X)
c(active(X)) → c(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)
d(mark(X)) → d(X)
d(active(X)) → d(X)
h(mark(X)) → h(X)
h(active(X)) → h(X)