YES Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Secret_07_SRS/x01.srs

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

0 QTRS
↳1 DependencyPairsProof (⇔, 17 ms)
↳2 QDP
↳3 QDPOrderProof (⇔, 144 ms)
↳4 QDP
↳5 DependencyGraphProof (⇔, 0 ms)
↳6 QDP
↳7 QDPOrderProof (⇔, 101 ms)
↳8 QDP
↳9 DependencyGraphProof (⇔, 0 ms)
↳10 TRUE

(0) Obligation:

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

a(x) → b(b(x))
c(b(x)) → d(x)
e(b(x)) → c(c(x))
d(b(x)) → b(f(x))
f(x) → a(e(x))
c(x) → x
a(a(x)) → f(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:

C(b(x)) → D(x)
E(b(x)) → C(c(x))
E(b(x)) → C(x)
D(b(x)) → F(x)
F(x) → A(e(x))
F(x) → E(x)
A(a(x)) → F(x)

The TRS R consists of the following rules:

a(x) → b(b(x))
c(b(x)) → d(x)
e(b(x)) → c(c(x))
d(b(x)) → b(f(x))
f(x) → a(e(x))
c(x) → x
a(a(x)) → f(x)

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

(3) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.


C(b(x)) → D(x)
The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(C(x1)) = -I +
[0A,0A,0A]
·x1

POL(b(x1)) =
/0A\
|1A|
\0A/
 +
/0A0A0A\
|0A0A1A|
\0A-I0A/
·x1

POL(D(x1)) = 0A +
[-I,-I,0A]
·x1

POL(E(x1)) = 0A +
[0A,-I,0A]
·x1

POL(c(x1)) =
/-I\
|-I|
\-I/
 +
/0A0A0A\
|0A0A0A|
\0A0A0A/
·x1

POL(F(x1)) = 0A +
[0A,-I,0A]
·x1

POL(A(x1)) = 0A +
[0A,-I,0A]
·x1

POL(e(x1)) =
/0A\
|-I|
\-I/
 +
/0A-I-I\
|0A-I-I|
\0A-I0A/
·x1

POL(a(x1)) =
/1A\
|1A|
\0A/
 +
/0A0A1A\
|1A0A1A|
\0A0A0A/
·x1

POL(d(x1)) =
/0A\
|-I|
\1A/
 +
/0A-I1A\
|0A-I1A|
\-I-I1A/
·x1

POL(f(x1)) =
/1A\
|1A|
\0A/
 +
/1A-I1A\
|1A-I1A|
\0A-I0A/
·x1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

c(b(x)) → d(x)
c(x) → x
e(b(x)) → c(c(x))
d(b(x)) → b(f(x))
a(a(x)) → f(x)
f(x) → a(e(x))
a(x) → b(b(x))

(4) Obligation:

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

E(b(x)) → C(c(x))
E(b(x)) → C(x)
D(b(x)) → F(x)
F(x) → A(e(x))
F(x) → E(x)
A(a(x)) → F(x)

The TRS R consists of the following rules:

a(x) → b(b(x))
c(b(x)) → d(x)
e(b(x)) → c(c(x))
d(b(x)) → b(f(x))
f(x) → a(e(x))
c(x) → x
a(a(x)) → f(x)

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

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 4 less nodes.

(6) Obligation:

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

F(x) → A(e(x))
A(a(x)) → F(x)

The TRS R consists of the following rules:

a(x) → b(b(x))
c(b(x)) → d(x)
e(b(x)) → c(c(x))
d(b(x)) → b(f(x))
f(x) → a(e(x))
c(x) → x
a(a(x)) → f(x)

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

(7) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.


F(x) → A(e(x))
The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(F(x1)) = 1A +
[0A,0A,1A]
·x1

POL(A(x1)) = -I +
[0A,-I,-I]
·x1

POL(e(x1)) =
/0A\
|-I|
\0A/
 +
/-I-I0A\
|-I0A0A|
\-I0A0A/
·x1

POL(a(x1)) =
/1A\
|0A|
\0A/
 +
/0A0A1A\
|0A0A0A|
\0A1A0A/
·x1

POL(b(x1)) =
/0A\
|0A|
\0A/
 +
/-I1A0A\
|-I-I0A|
\0A0A0A/
·x1

POL(c(x1)) =
/0A\
|0A|
\0A/
 +
/0A0A0A\
|0A0A0A|
\0A-I0A/
·x1

POL(d(x1)) =
/-I\
|-I|
\-I/
 +
/0A1A0A\
|0A1A0A|
\0A1A0A/
·x1

POL(f(x1)) =
/1A\
|0A|
\0A/
 +
/0A1A1A\
|-I0A0A|
\0A1A1A/
·x1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

e(b(x)) → c(c(x))
c(b(x)) → d(x)
d(b(x)) → b(f(x))
a(a(x)) → f(x)
f(x) → a(e(x))
c(x) → x
a(x) → b(b(x))

(8) Obligation:

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

A(a(x)) → F(x)

The TRS R consists of the following rules:

a(x) → b(b(x))
c(b(x)) → d(x)
e(b(x)) → c(c(x))
d(b(x)) → b(f(x))
f(x) → a(e(x))
c(x) → x
a(a(x)) → f(x)

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

(9) DependencyGraphProof (EQUIVALENT transformation)

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

(10) TRUE