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

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

0 QTRS
↳1 QTRS Reverse (⇔, 0 ms)
↳2 QTRS
↳3 DependencyPairsProof (⇔, 0 ms)
↳4 QDP
↳5 QDPOrderProof (⇔, 24 ms)
↳6 QDP
↳7 QDPOrderProof (⇔, 5250 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(x))) → b(a(a(a(x))))
b(a(b(a(x)))) → a(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(a(a(x))) → a(a(a(b(x))))
a(b(a(b(x)))) → b(b(a(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(a(a(x))) → A(a(a(b(x))))
B(a(a(x))) → A(a(b(x)))
B(a(a(x))) → A(b(x))
B(a(a(x))) → B(x)
A(b(a(b(x)))) → B(b(a(x)))
A(b(a(b(x)))) → B(a(x))
A(b(a(b(x)))) → A(x)

The TRS R consists of the following rules:

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


A(b(a(b(x)))) → B(a(x))
A(b(a(b(x)))) → A(x)
The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(A(x1)) = x1   
POL(B(x1)) = 1 + x1   
POL(a(x1)) = x1   
POL(b(x1)) = 1 + x1   

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

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

(6) Obligation:

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

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

The TRS R consists of the following rules:

b(a(a(x))) → a(a(a(b(x))))
a(b(a(b(x)))) → b(b(a(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(a(a(x))) → A(a(b(x)))
B(a(a(x))) → A(b(x))
B(a(a(x))) → B(x)
A(b(a(b(x)))) → B(b(a(x)))
The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO,RATPOLO]:

POL(A(x1)) = [1/2] + [1/2]x1   
POL(B(x1)) = [1/2] + [3/4]x1   
POL(a(x1)) = [1/4] + x1   
POL(b(x1)) = [1/4] + [3/2]x1   
The value of delta used in the strict ordering is 1/32.
The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

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

(8) Obligation:

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

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

The TRS R consists of the following rules:

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