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) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms]
(2) YES


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

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

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

Q is empty.

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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50

Node 1 is start node and node 2 is final node.

Those nodes are connected through the following edges:

* 1 to 3 labelled a_1(0)* 2 to 2 labelled #_1(0)* 3 to 4 labelled a_1(0)* 4 to 5 labelled a_1(0)* 5 to 6 labelled a_1(0)* 6 to 7 labelled b_1(0)* 6 to 19 labelled a_1(1)* 7 to 8 labelled a_1(0)* 8 to 9 labelled b_1(0)* 8 to 11 labelled a_1(1)* 9 to 10 labelled a_1(0)* 10 to 2 labelled b_1(0)* 10 to 11 labelled a_1(1)* 11 to 12 labelled a_1(1)* 12 to 13 labelled a_1(1)* 13 to 14 labelled a_1(1)* 14 to 15 labelled b_1(1)* 14 to 27 labelled a_1(2)* 15 to 16 labelled a_1(1)* 16 to 17 labelled b_1(1)* 16 to 11 labelled a_1(1)* 17 to 18 labelled a_1(1)* 18 to 2 labelled b_1(1)* 18 to 11 labelled a_1(1)* 19 to 20 labelled a_1(1)* 20 to 21 labelled a_1(1)* 21 to 22 labelled a_1(1)* 22 to 23 labelled b_1(1)* 23 to 24 labelled a_1(1)* 24 to 25 labelled b_1(1)* 24 to 35 labelled a_1(2)* 25 to 26 labelled a_1(1)* 26 to 12 labelled b_1(1)* 27 to 28 labelled a_1(2)* 28 to 29 labelled a_1(2)* 29 to 30 labelled a_1(2)* 30 to 31 labelled b_1(2)* 31 to 32 labelled a_1(2)* 32 to 33 labelled b_1(2)* 32 to 35 labelled a_1(2)* 33 to 34 labelled a_1(2)* 34 to 12 labelled b_1(2)* 35 to 36 labelled a_1(2)* 36 to 37 labelled a_1(2)* 37 to 38 labelled a_1(2)* 38 to 39 labelled b_1(2)* 39 to 40 labelled a_1(2)* 40 to 41 labelled b_1(2)* 40 to 43 labelled a_1(3)* 41 to 42 labelled a_1(2)* 42 to 27 labelled b_1(2)* 43 to 44 labelled a_1(3)* 44 to 45 labelled a_1(3)* 45 to 46 labelled a_1(3)* 46 to 47 labelled b_1(3)* 47 to 48 labelled a_1(3)* 48 to 49 labelled b_1(3)* 49 to 50 labelled a_1(3)* 50 to 30 labelled b_1(3)


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

(2)
YES