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

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

0 QTRS
↳1 QTRS Reverse (⇔, 0 ms)
↳2 QTRS
↳3 DependencyPairsProof (⇔, 3 ms)
↳4 QDP
↳5 QDPOrderProof (⇔, 186 ms)
↳6 QDP
↳7 QDPOrderProof (⇔, 309 ms)
↳8 QDP
↳9 DependencyGraphProof (⇔, 0 ms)
↳10 TRUE

(0) Obligation:

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

a(a(b(b(x)))) → a(b(a(a(x))))
a(x) → b(b(b(x)))

Q is empty.

(1) QTRS Reverse (EQUIVALENT transformation)

We applied the QTRS Reverse Processor [REVERSE].

(2) Obligation:

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

b(b(a(a(x)))) → a(a(b(a(x))))
a(x) → b(b(b(x)))

Q is empty.

(3) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(4) Obligation:

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

B(b(a(a(x)))) → A(a(b(a(x))))
B(b(a(a(x)))) → A(b(a(x)))
B(b(a(a(x)))) → B(a(x))
A(x) → B(b(b(x)))
A(x) → B(b(x))
A(x) → B(x)

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(a(b(a(x))))
a(x) → b(b(b(x)))

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

(5) QDPOrderProof (EQUIVALENT transformation)

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


The following pairs can be oriented strictly and are deleted.


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

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

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

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

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

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

a(x) → b(b(b(x)))
b(b(a(a(x)))) → a(a(b(a(x))))

(6) Obligation:

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

B(b(a(a(x)))) → A(a(b(a(x))))
B(b(a(a(x)))) → A(b(a(x)))
A(x) → B(b(b(x)))
A(x) → B(b(x))
A(x) → B(x)

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(a(b(a(x))))
a(x) → b(b(b(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.


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

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

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

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

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

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

a(x) → b(b(b(x)))
b(b(a(a(x)))) → a(a(b(a(x))))

(8) Obligation:

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

A(x) → B(b(b(x)))
A(x) → B(b(x))
A(x) → B(x)

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(a(b(a(x))))
a(x) → b(b(b(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 3 less nodes.

(10) TRUE