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 PisEmptyProof (⇔)
    ↳30 TRUE
  ↳31 QDP
    ↳32 QDPOrderProof (⇔)
    ↳33 QDP
    ↳34 PisEmptyProof (⇔)
    ↳35 TRUE

(0) Obligation:

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

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

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(a))) → MARK(c(f(g(f(a)))))
ACTIVE(f(f(a))) → C(f(g(f(a))))
ACTIVE(f(f(a))) → F(g(f(a)))
ACTIVE(f(f(a))) → G(f(a))
MARK(f(X)) → ACTIVE(f(mark(X)))
MARK(f(X)) → F(mark(X))
MARK(f(X)) → MARK(X)
MARK(a) → ACTIVE(a)
MARK(c(X)) → ACTIVE(c(X))
MARK(g(X)) → ACTIVE(g(mark(X)))
MARK(g(X)) → G(mark(X))
MARK(g(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)

The TRS R consists of the following rules:

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

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 5 SCCs with 8 less nodes.

(4) Complex Obligation (AND)

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

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.


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
active(x1)  =  x1
mark(x1)  =  mark(x1)
f(x1)  =  f
a  =  a
c(x1)  =  c
g(x1)  =  g(x1)

Lexicographic path order with status [LPO].
Quasi-Precedence:
[f, a] > [mark1, c, g1]

Status:
mark1: [1]
f: []
a: []
c: []
g1: [1]


The following usable rules [FROCOS05] were oriented:

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

(7) Obligation:

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

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

The TRS R consists of the following rules:

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

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.


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)
f(x1)  =  f
a  =  a
mark(x1)  =  mark(x1)
c(x1)  =  c
g(x1)  =  g

Lexicographic path order with status [LPO].
Quasi-Precedence:
[active1, a, mark1] > [f, c, g]

Status:
active1: [1]
f: []
a: []
mark1: [1]
c: []
g: []


The following usable rules [FROCOS05] were oriented:

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

(9) Obligation:

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

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

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:

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

The TRS R consists of the following rules:

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

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.


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
active(x1)  =  x1
mark(x1)  =  mark(x1)
f(x1)  =  f
a  =  a
c(x1)  =  c
g(x1)  =  g(x1)

Lexicographic path order with status [LPO].
Quasi-Precedence:
[f, a] > [mark1, c, g1]

Status:
mark1: [1]
f: []
a: []
c: []
g1: [1]


The following usable rules [FROCOS05] were oriented:

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

(14) Obligation:

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

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

The TRS R consists of the following rules:

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

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.


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)
f(x1)  =  f
a  =  a
mark(x1)  =  mark(x1)
c(x1)  =  c
g(x1)  =  g

Lexicographic path order with status [LPO].
Quasi-Precedence:
[active1, a, mark1] > [f, c, g]

Status:
active1: [1]
f: []
a: []
mark1: [1]
c: []
g: []


The following usable rules [FROCOS05] were oriented:

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

(16) Obligation:

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

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

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:

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

The TRS R consists of the following rules:

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

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.


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
active(x1)  =  x1
mark(x1)  =  mark(x1)
f(x1)  =  f
a  =  a
c(x1)  =  c
g(x1)  =  g(x1)

Lexicographic path order with status [LPO].
Quasi-Precedence:
[f, a] > [mark1, c, g1]

Status:
mark1: [1]
f: []
a: []
c: []
g1: [1]


The following usable rules [FROCOS05] were oriented:

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

(21) Obligation:

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

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

The TRS R consists of the following rules:

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

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.


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)
f(x1)  =  f
a  =  a
mark(x1)  =  mark(x1)
c(x1)  =  c
g(x1)  =  g

Lexicographic path order with status [LPO].
Quasi-Precedence:
[active1, a, mark1] > [f, c, g]

Status:
active1: [1]
f: []
a: []
mark1: [1]
c: []
g: []


The following usable rules [FROCOS05] were oriented:

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

(23) Obligation:

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

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

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:

MARK(c(X)) → ACTIVE(c(X))
ACTIVE(f(f(a))) → MARK(c(f(g(f(a)))))

The TRS R consists of the following rules:

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

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.


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

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

Status:
MARK1: [1]
f1: [1]
a: []
g: []


The following usable rules [FROCOS05] were oriented:

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

(28) Obligation:

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

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

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

(29) PisEmptyProof (EQUIVALENT transformation)

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

(30) TRUE

(31) Obligation:

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

MARK(g(X)) → MARK(X)
MARK(f(X)) → MARK(X)

The TRS R consists of the following rules:

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

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

(32) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Lexicographic path order with status [LPO].
Quasi-Precedence:
MARK1 > [g1, c]
a > f1 > [g1, c]

Status:
MARK1: [1]
g1: [1]
f1: [1]
a: []
c: []


The following usable rules [FROCOS05] were oriented:

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

(33) Obligation:

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

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

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

(34) PisEmptyProof (EQUIVALENT transformation)

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

(35) TRUE