Termination w.r.t. Q proof of /tmp/tmpW2rDLE/Ex24_Luc06

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

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

(0) Obligation:

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

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

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(b, X, c)) → MARK(f(X, c, X))
ACTIVE(f(b, X, c)) → F(X, c, X)
ACTIVE(c) → MARK(b)
MARK(f(X1, X2, X3)) → ACTIVE(f(X1, mark(X2), X3))
MARK(f(X1, X2, X3)) → F(X1, mark(X2), X3)
MARK(f(X1, X2, X3)) → MARK(X2)
MARK(b) → ACTIVE(b)
MARK(c) → ACTIVE(c)
F(mark(X1), X2, X3) → F(X1, X2, X3)
F(X1, mark(X2), X3) → F(X1, X2, X3)
F(X1, X2, mark(X3)) → F(X1, X2, X3)
F(active(X1), X2, X3) → F(X1, X2, X3)
F(X1, active(X2), X3) → F(X1, X2, X3)
F(X1, X2, active(X3)) → F(X1, X2, X3)

The TRS R consists of the following rules:

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

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

(4) Complex Obligation (AND)

(5) Obligation:

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

F(X1, mark(X2), X3) → F(X1, X2, X3)
F(mark(X1), X2, X3) → F(X1, X2, X3)
F(X1, X2, mark(X3)) → F(X1, X2, X3)
F(active(X1), X2, X3) → F(X1, X2, X3)
F(X1, active(X2), X3) → F(X1, X2, X3)
F(X1, X2, active(X3)) → F(X1, X2, X3)

The TRS R consists of the following rules:

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

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.

F(X1, X2, mark(X3)) → F(X1, X2, X3)
F(X1, X2, active(X3)) → F(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
F(x1, x2, x3) = x3
mark(x1) = mark(x1)
active(x1) = active(x1)
f(x1, x2, x3) = f
b = b
c = c

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

[mark₁, active₁, f, c] > b

Status:

mark₁: [1]
active₁: [1]
f: []
b: []
c: []

The following usable rules [FROCOS05] were oriented:

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

(7) Obligation:

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

F(X1, mark(X2), X3) → F(X1, X2, X3)
F(mark(X1), X2, X3) → F(X1, X2, X3)
F(active(X1), X2, X3) → F(X1, X2, X3)
F(X1, active(X2), X3) → F(X1, X2, X3)

The TRS R consists of the following rules:

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

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.

F(X1, mark(X2), X3) → F(X1, X2, X3)
F(mark(X1), X2, X3) → F(X1, X2, X3)
F(active(X1), X2, X3) → F(X1, X2, X3)
F(X1, active(X2), X3) → F(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
F(x1, x2, x3) = F(x1, x2)
mark(x1) = mark(x1)
active(x1) = active(x1)
f(x1, x2, x3) = f
b = b
c = c

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

[mark₁, active₁, f] > [b, c] > F₂

Status:

F₂: [2,1]
mark₁: [1]
active₁: [1]
f: []
b: []
c: []

The following usable rules [FROCOS05] were oriented:

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

(9) Obligation:

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

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

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:

MARK(f(X1, X2, X3)) → ACTIVE(f(X1, mark(X2), X3))
ACTIVE(f(b, X, c)) → MARK(f(X, c, X))
MARK(f(X1, X2, X3)) → MARK(X2)

The TRS R consists of the following rules:

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

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.

MARK(f(X1, X2, X3)) → MARK(X2)

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, x2, x3) = f(x2)
ACTIVE(x1) = ACTIVE(x1)
mark(x1) = x1
b = b
c = c
active(x1) = x1

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

[MARK₁, ACTIVE₁] > [f₁, b, c]

Status:

MARK₁: [1]
f₁: [1]
ACTIVE₁: [1]
b: []
c: []

The following usable rules [FROCOS05] were oriented:

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

(14) Obligation:

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

MARK(f(X1, X2, X3)) → ACTIVE(f(X1, mark(X2), X3))
ACTIVE(f(b, X, c)) → MARK(f(X, c, X))

The TRS R consists of the following rules:

active(f(b, X, c)) → mark(f(X, c, X))
active(c) → mark(b)
mark(f(X1, X2, X3)) → active(f(X1, mark(X2), X3))
mark(b) → active(b)
mark(c) → active(c)
f(mark(X1), X2, X3) → f(X1, X2, X3)
f(X1, mark(X2), X3) → f(X1, X2, X3)
f(X1, X2, mark(X3)) → f(X1, X2, X3)
f(active(X1), X2, X3) → f(X1, X2, X3)
f(X1, active(X2), X3) → f(X1, X2, X3)
f(X1, X2, active(X3)) → f(X1, X2, X3)

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