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(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), 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(x)) → F(f(x))
CHK(no(f(x))) → F(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
CHK(no(f(x))) → CHK(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x))
CHK(no(f(x))) → MAT(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)
CHK(no(f(x))) → F(f(f(f(f(f(f(f(f(f(X))))))))))
CHK(no(f(x))) → F(f(f(f(f(f(f(f(f(X)))))))))
CHK(no(f(x))) → F(f(f(f(f(f(f(f(X))))))))
CHK(no(f(x))) → F(f(f(f(f(f(f(X)))))))
CHK(no(f(x))) → F(f(f(f(f(f(X))))))
CHK(no(f(x))) → F(f(f(f(f(X)))))
CHK(no(f(x))) → F(f(f(f(X))))
CHK(no(f(x))) → F(f(f(X)))
CHK(no(f(x))) → F(f(X))
CHK(no(f(x))) → F(X)
MAT(f(x), f(y)) → F(mat(x, y))
MAT(f(x), f(y)) → MAT(x, y)
CHK(no(c)) → ACTIVE(c)
F(active(x)) → ACTIVE(f(x))
F(active(x)) → F(x)
F(no(x)) → F(x)
F(mark(x)) → F(x)
TP(mark(x)) → TP(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
TP(mark(x)) → CHK(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x))
TP(mark(x)) → MAT(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)
TP(mark(x)) → F(f(f(f(f(f(f(f(f(f(X))))))))))
TP(mark(x)) → F(f(f(f(f(f(f(f(f(X)))))))))
TP(mark(x)) → F(f(f(f(f(f(f(f(X))))))))
TP(mark(x)) → F(f(f(f(f(f(f(X)))))))
TP(mark(x)) → F(f(f(f(f(f(X))))))
TP(mark(x)) → F(f(f(f(f(X)))))
TP(mark(x)) → F(f(f(f(X))))
TP(mark(x)) → F(f(f(X)))
TP(mark(x)) → F(f(X))
TP(mark(x)) → F(X)

The TRS R consists of the following rules:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), 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 3 SCCs with 27 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

F(active(x)) → ACTIVE(f(x))
ACTIVE(f(x)) → F(f(x))
F(active(x)) → F(x)
F(no(x)) → F(x)
F(mark(x)) → F(x)

The TRS R consists of the following rules:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), 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.

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)  =  F(x1)
active(x1)  =  active(x1)
ACTIVE(x1)  =  ACTIVE(x1)
f(x1)  =  f(x1)
no(x1)  =  x1
mark(x1)  =  x1
chk(x1)  =  chk(x1)
mat(x1, x2)  =  x2
X  =  X
y  =  y
c  =  c
tp(x1)  =  tp

Recursive path order with status [RPO].
Quasi-Precedence:

chk₁ > c > [F₁, active₁, ACTIVE₁, f₁] > X
y > [F₁, active₁, ACTIVE₁, f₁] > X
tp > X

Status:

F₁: [1]
active₁: [1]
ACTIVE₁: [1]
f₁: [1]
chk₁: [1]
X: multiset
y: multiset
c: multiset
tp: multiset

The following usable rules [FROCOS05] were oriented:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

(7) Obligation:

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

F(active(x)) → ACTIVE(f(x))
ACTIVE(f(x)) → F(f(x))
F(no(x)) → F(x)
F(mark(x)) → F(x)

The TRS R consists of the following rules:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), 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.

F(no(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)
ACTIVE(x1)  =  x1
f(x1)  =  f(x1)
no(x1)  =  no(x1)
mark(x1)  =  x1
chk(x1)  =  x1
mat(x1, x2)  =  mat(x2)
X  =  X
y  =  y
c  =  c
tp(x1)  =  tp

Recursive path order with status [RPO].
Quasi-Precedence:

[active₁, f₁, no₁, mat₁, y] > X > tp
[active₁, f₁, no₁, mat₁, y] > c > tp

Status:

active₁: [1]
f₁: [1]
no₁: [1]
mat₁: [1]
X: multiset
y: multiset
c: multiset
tp: multiset

The following usable rules [FROCOS05] were oriented:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

(9) Obligation:

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

F(active(x)) → ACTIVE(f(x))
ACTIVE(f(x)) → F(f(x))
F(mark(x)) → F(x)

The TRS R consists of the following rules:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

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

(10) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

F(active(x)) → ACTIVE(f(x))
ACTIVE(f(x)) → F(f(x))
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)  =  active(x1)
ACTIVE(x1)  =  ACTIVE(x1)
f(x1)  =  x1
mark(x1)  =  mark(x1)
chk(x1)  =  chk
no(x1)  =  x1
mat(x1, x2)  =  mat
X  =  X
y  =  y
c  =  c
tp(x1)  =  tp

Recursive path order with status [RPO].
Quasi-Precedence:

chk > [active₁, mark₁] > ACTIVE₁ > [X, tp]
chk > [active₁, mark₁] > mat > y > [X, tp]
chk > [active₁, mark₁] > mat > c > [X, tp]

Status:

active₁: [1]
ACTIVE₁: [1]
mark₁: [1]
chk: multiset
mat: []
X: multiset
y: multiset
c: multiset
tp: multiset

The following usable rules [FROCOS05] were oriented:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

(11) Obligation:

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

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

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

(12) PisEmptyProof (EQUIVALENT transformation)

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

(13) TRUE

(14) Obligation:

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

CHK(no(f(x))) → CHK(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x))

The TRS R consists of the following rules:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), 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.

CHK(no(f(x))) → CHK(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x))

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
CHK(x1)  =  CHK(x1)
no(x1)  =  no(x1)
f(x1)  =  f(x1)
mat(x1, x2)  =  mat(x2)
X  =  X
active(x1)  =  active
mark(x1)  =  mark
chk(x1)  =  chk(x1)
y  =  y
c  =  c
tp(x1)  =  tp

Recursive path order with status [RPO].
Quasi-Precedence:

CHK₁ > [no₁, f₁, mat₁] > mark > tp > X
[chk₁, c] > active > [no₁, f₁, mat₁] > mark > tp > X
y > [no₁, f₁, mat₁] > mark > tp > X

Status:

CHK₁: multiset
no₁: [1]
f₁: [1]
mat₁: [1]
X: multiset
active: multiset
mark: multiset
chk₁: [1]
y: multiset
c: multiset
tp: multiset

The following usable rules [FROCOS05] were oriented:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

(16) Obligation:

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

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), 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:

TP(mark(x)) → TP(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

The TRS R consists of the following rules:

active(f(x)) → mark(f(f(x)))
chk(no(f(x))) → f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
mat(f(x), f(y)) → f(mat(x, y))
chk(no(c)) → active(c)
mat(f(x), c) → no(c)
f(active(x)) → active(f(x))
f(no(x)) → no(f(x))
f(mark(x)) → mark(f(x))
tp(mark(x)) → tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

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