YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

(0) QTRS
(1) QTRS Reverse [EQUIVALENT, 0 ms]
(2) QTRS
(3) RFCMatchBoundsTRSProof [EQUIVALENT, 9 ms]
(4) YES


----------------------------------------

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   a(a(b(b(a(b(x1)))))) -> a(b(b(a(a(b(b(a(x1))))))))

Q is empty.

----------------------------------------

(1) QTRS Reverse (EQUIVALENT)
We applied the QTRS Reverse Processor [REVERSE].
----------------------------------------

(2)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   b(a(b(b(a(a(x1)))))) -> a(b(b(a(a(b(b(a(x1))))))))

Q is empty.

----------------------------------------

(3) RFCMatchBoundsTRSProof (EQUIVALENT)
Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 2. This implies Q-termination of R.
The following rules were used to construct the certificate:

   b(a(b(b(a(a(x1)))))) -> a(b(b(a(a(b(b(a(x1))))))))

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93

Node 64 is start node and node 65 is final node.

Those nodes are connected through the following edges:

* 64 to 66 labelled a_1(0)* 65 to 65 labelled #_1(0)* 66 to 67 labelled b_1(0)* 67 to 68 labelled b_1(0)* 68 to 69 labelled a_1(0)* 69 to 70 labelled a_1(0)* 70 to 71 labelled b_1(0)* 70 to 80 labelled a_1(1)* 71 to 72 labelled b_1(0)* 71 to 73 labelled a_1(1)* 72 to 65 labelled a_1(0)* 73 to 74 labelled b_1(1)* 74 to 75 labelled b_1(1)* 75 to 76 labelled a_1(1)* 76 to 77 labelled a_1(1)* 77 to 78 labelled b_1(1)* 77 to 87 labelled a_1(2)* 78 to 79 labelled b_1(1)* 78 to 73 labelled a_1(1)* 79 to 65 labelled a_1(1)* 80 to 81 labelled b_1(1)* 81 to 82 labelled b_1(1)* 82 to 83 labelled a_1(1)* 83 to 84 labelled a_1(1)* 84 to 85 labelled b_1(1)* 84 to 87 labelled a_1(2)* 85 to 86 labelled b_1(1)* 85 to 73 labelled a_1(1)* 86 to 77 labelled a_1(1)* 87 to 88 labelled b_1(2)* 88 to 89 labelled b_1(2)* 89 to 90 labelled a_1(2)* 90 to 91 labelled a_1(2)* 91 to 92 labelled b_1(2)* 91 to 87 labelled a_1(2)* 92 to 93 labelled b_1(2)* 92 to 73 labelled a_1(1)* 93 to 77 labelled a_1(2)


----------------------------------------

(4)
YES