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

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 AND
  ↳5 QDP
    ↳6 QDPOrderProof (⇔)
    ↳7 QDP
    ↳8 QDPOrderProof (⇔)
    ↳9 QDP
    ↳10 PisEmptyProof (⇔)
    ↳11 TRUE
  ↳12 QDP
    ↳13 QDPOrderProof (⇔)
    ↳14 QDP
    ↳15 QDPOrderProof (⇔)
    ↳16 QDP
    ↳17 PisEmptyProof (⇔)
    ↳18 TRUE
  ↳19 QDP
    ↳20 QDPOrderProof (⇔)
    ↳21 QDP
    ↳22 QDPOrderProof (⇔)
    ↳23 QDP
    ↳24 PisEmptyProof (⇔)
    ↳25 TRUE
  ↳26 QDP
    ↳27 QDPOrderProof (⇔)
    ↳28 QDP
    ↳29 QDPOrderProof (⇔)
    ↳30 QDP
    ↳31 PisEmptyProof (⇔)
    ↳32 TRUE
  ↳33 QDP
    ↳34 QDPOrderProof (⇔)
    ↳35 QDP
    ↳36 QDPOrderProof (⇔)
    ↳37 QDP
    ↳38 PisEmptyProof (⇔)
    ↳39 TRUE
  ↳40 QDP
    ↳41 QDPOrderProof (⇔)
    ↳42 QDP
    ↳43 QDPOrderProof (⇔)
    ↳44 QDP
    ↳45 DependencyGraphProof (⇔)
    ↳46 TRUE

(0) Obligation:

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

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)

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

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)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 6 SCCs with 8 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

Q DP problem:
The TRS P consists of the following rules:

H(active(X)) → H(X)
H(mark(X)) → H(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


H(active(X)) → H(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
H(x1)  =  x1
active(x1)  =  active(x1)
mark(x1)  =  x1

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

Status:
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

Q DP problem:
The TRS P consists of the following rules:

H(mark(X)) → H(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


H(mark(X)) → H(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
H(x1)  =  x1
mark(x1)  =  mark(x1)

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

Status:
mark1: [1]


The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(10) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(11) TRUE

(12) Obligation:

Q DP problem:
The TRS P consists of the following rules:

D(active(X)) → D(X)
D(mark(X)) → D(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


D(active(X)) → D(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
D(x1)  =  x1
active(x1)  =  active(x1)
mark(x1)  =  x1

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

Status:
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(14) Obligation:

Q DP problem:
The TRS P consists of the following rules:

D(mark(X)) → D(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


D(mark(X)) → D(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
D(x1)  =  x1
mark(x1)  =  mark(x1)

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

Status:
mark1: [1]


The following usable rules [FROCOS05] were oriented: none

(16) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(17) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(18) TRUE

(19) Obligation:

Q DP problem:
The TRS P consists of the following rules:

G(active(X)) → G(X)
G(mark(X)) → G(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(20) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


G(active(X)) → G(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
G(x1)  =  x1
active(x1)  =  active(x1)
mark(x1)  =  x1

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

Status:
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(21) Obligation:

Q DP problem:
The TRS P consists of the following rules:

G(mark(X)) → G(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(22) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


G(mark(X)) → G(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
G(x1)  =  x1
mark(x1)  =  mark(x1)

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

Status:
mark1: [1]


The following usable rules [FROCOS05] were oriented: none

(23) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(24) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(25) TRUE

(26) Obligation:

Q DP problem:
The TRS P consists of the following rules:

C(active(X)) → C(X)
C(mark(X)) → C(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(27) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


C(active(X)) → C(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
C(x1)  =  x1
active(x1)  =  active(x1)
mark(x1)  =  x1

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

Status:
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(28) Obligation:

Q DP problem:
The TRS P consists of the following rules:

C(mark(X)) → C(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(29) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


C(mark(X)) → C(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
C(x1)  =  x1
mark(x1)  =  mark(x1)

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

Status:
mark1: [1]


The following usable rules [FROCOS05] were oriented: none

(30) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(31) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(32) TRUE

(33) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F(active(X)) → F(X)
F(mark(X)) → F(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(34) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


F(active(X)) → F(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
F(x1)  =  x1
active(x1)  =  active(x1)
mark(x1)  =  x1

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

Status:
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(35) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F(mark(X)) → F(X)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(36) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


F(mark(X)) → F(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
F(x1)  =  x1
mark(x1)  =  mark(x1)

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

Status:
mark1: [1]


The following usable rules [FROCOS05] were oriented: none

(37) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(38) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(39) TRUE

(40) Obligation:

Q DP problem:
The TRS P consists of the following rules:

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)

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(41) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(h(X)) → ACTIVE(h(mark(X)))
MARK(h(X)) → MARK(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  x1
f(x1)  =  x1
ACTIVE(x1)  =  ACTIVE
mark(x1)  =  mark(x1)
c(x1)  =  c
g(x1)  =  g
d(x1)  =  d
h(x1)  =  h(x1)
active(x1)  =  active(x1)

Lexicographic path order with status [LPO].
Quasi-Precedence:
h1 > [ACTIVE, mark1, c, g, d, active1]

Status:
ACTIVE: []
mark1: [1]
c: []
g: []
d: []
h1: [1]
active1: [1]


The following usable rules [FROCOS05] were oriented:

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

(42) Obligation:

Q DP problem:
The TRS P consists of the following rules:

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))

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(43) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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))
MARK(g(X)) → ACTIVE(g(X))
ACTIVE(h(X)) → MARK(c(d(X)))
MARK(d(X)) → ACTIVE(d(X))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  MARK(x1)
f(x1)  =  f(x1)
ACTIVE(x1)  =  x1
mark(x1)  =  x1
c(x1)  =  c(x1)
g(x1)  =  g
d(x1)  =  d
h(x1)  =  h
active(x1)  =  x1

Lexicographic path order with status [LPO].
Quasi-Precedence:
f1 > [MARK1, c1] > [g, d]
h > [MARK1, c1] > [g, d]

Status:
MARK1: [1]
f1: [1]
c1: [1]
g: []
d: []
h: []


The following usable rules [FROCOS05] were oriented:

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))
active(h(X)) → mark(c(d(X)))
mark(d(X)) → active(d(X))
mark(h(X)) → active(h(mark(X)))
f(active(X)) → f(X)
f(mark(X)) → f(X)
g(active(X)) → g(X)
g(mark(X)) → g(X)
c(active(X)) → c(X)
c(mark(X)) → c(X)
d(active(X)) → d(X)
d(mark(X)) → d(X)
h(active(X)) → h(X)
h(mark(X)) → h(X)

(44) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(c(X)) → MARK(d(X))

The TRS R consists of the following rules:

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)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(45) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(46) TRUE