YES Termination w.r.t. Q proof of Transformed_CSR_04_Ex1_GM99_C.ari

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

0 QTRS
↳1 QTRSToCSRProof (⇔, 0 ms)
↳2 CSR
↳3 CSRRRRProof (⇔, 54 ms)
↳4 CSR
↳5 CSRRRRProof (⇔, 0 ms)
↳6 CSR
↳7 CSRInnermostProof (⇔, 0 ms)
↳8 CSR
↳9 CSDependencyPairsProof (⇔, 0 ms)
↳10 QCSDP
↳11 QCSDependencyGraphProof (⇔, 0 ms)
↳12 TRUE

(0) Obligation:

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

active(f(a, b, X)) → mark(f(X, X, X))
active(c) → mark(a)
active(c) → mark(b)
active(f(X1, X2, X3)) → f(X1, X2, active(X3))
f(X1, X2, mark(X3)) → mark(f(X1, X2, X3))
proper(f(X1, X2, X3)) → f(proper(X1), proper(X2), proper(X3))
proper(a) → ok(a)
proper(b) → ok(b)
proper(c) → ok(c)
f(ok(X1), ok(X2), ok(X3)) → ok(f(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

(1) QTRSToCSRProof (EQUIVALENT transformation)

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

active(f(a, b, X)) → mark(f(X, X, X))
active(c) → mark(a)
active(c) → mark(b)
active(f(X1, X2, X3)) → f(X1, X2, active(X3))
f(X1, X2, mark(X3)) → mark(f(X1, X2, X3))
proper(f(X1, X2, X3)) → f(proper(X1), proper(X2), proper(X3))
proper(a) → ok(a)
proper(b) → ok(b)
proper(c) → ok(c)
f(ok(X1), ok(X2), ok(X3)) → ok(f(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
Special symbols used for the transformation (see [GM04]):
top: top, active: active, mark: mark, ok: ok, proper: proper
The replacement map contains the following entries:

f: {3}
a: empty set
b: empty set
c: empty set
The QTRS contained all rules created by the complete Giesl-Middeldorp transformation. Therefore, the inverse transformation is complete (and sound).

(2) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

f(a, b, X) → f(X, X, X)
c → a
c → b

The replacement map contains the following entries:

f: {3}
a: empty set
b: empty set
c: empty set

(3) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

f(a, b, X) → f(X, X, X)
c → a
c → b

The replacement map contains the following entries:

f: {3}
a: empty set
b: empty set
c: empty set
Used ordering:
Polynomial interpretation [POLO]:


POL(a) = 1   
POL(b) = 0   
POL(c) = 1   
POL(f(x1, x2, x3)) = x3   
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

c → b


(4) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

f(a, b, X) → f(X, X, X)
c → a

The replacement map contains the following entries:

f: {3}
a: empty set
b: empty set
c: empty set

(5) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

f(a, b, X) → f(X, X, X)
c → a

The replacement map contains the following entries:

f: {3}
a: empty set
b: empty set
c: empty set
Used ordering:
Polynomial interpretation [POLO]:


POL(a) = 0   
POL(b) = 0   
POL(c) = 2   
POL(f(x1, x2, x3)) = x3   
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

c → a


(6) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

f(a, b, X) → f(X, X, X)

The replacement map contains the following entries:

f: {3}
a: empty set
b: empty set

(7) CSRInnermostProof (EQUIVALENT transformation)

The CSR is orthogonal. By [CS_Inn] we can switch to innermost.

(8) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

f(a, b, X) → f(X, X, X)

The replacement map contains the following entries:

f: {3}
a: empty set
b: empty set

Innermost Strategy.

(9) CSDependencyPairsProof (EQUIVALENT transformation)

Using Improved CS-DPs [LPAR08] we result in the following initial Q-CSDP problem.

(10) Obligation:

Q-restricted context-sensitive dependency pair problem:
For all symbols f in {f, F} we have µ(f) = {3}.

The ordinary context-sensitive dependency pairs DPo are:

F(a, b, X) → F(X, X, X)

The TRS R consists of the following rules:

f(a, b, X) → f(X, X, X)

The set Q consists of the following terms:

f(a, b, x0)

(11) QCSDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Context-Sensitive Dependency Graph [LPAR08] contains 0 SCCs.
The rules F(a, b, z0) → F(z0, z0, z0) and F(a, b, x0) → F(x0, x0, x0) form no chain, because ECapµ(F(z0, z0, z0)) = F(z0, z0, z0) does not unify with F(a, b, x0).

(12) TRUE