/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 1 ms]
(4) YES


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

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

   b(a(a(a(b(a(a(x1))))))) -> a(a(a(b(b(a(a(a(b(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:

   a(a(b(a(a(a(b(x1))))))) -> b(a(a(a(b(b(a(a(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:

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
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

Node 3 is start node and node 4 is final node.

Those nodes are connected through the following edges:

* 3 to 5 labelled b_1(0)* 4 to 4 labelled #_1(0)* 5 to 6 labelled a_1(0)* 6 to 7 labelled a_1(0)* 7 to 8 labelled a_1(0)* 8 to 9 labelled b_1(0)* 9 to 10 labelled b_1(0)* 10 to 11 labelled a_1(0)* 10 to 21 labelled b_1(1)* 11 to 12 labelled a_1(0)* 11 to 13 labelled b_1(1)* 12 to 4 labelled a_1(0)* 12 to 13 labelled b_1(1)* 13 to 14 labelled a_1(1)* 14 to 15 labelled a_1(1)* 15 to 16 labelled a_1(1)* 16 to 17 labelled b_1(1)* 17 to 18 labelled b_1(1)* 18 to 19 labelled a_1(1)* 18 to 29 labelled b_1(2)* 19 to 20 labelled a_1(1)* 19 to 13 labelled b_1(1)* 20 to 4 labelled a_1(1)* 20 to 13 labelled b_1(1)* 21 to 22 labelled a_1(1)* 22 to 23 labelled a_1(1)* 23 to 24 labelled a_1(1)* 24 to 25 labelled b_1(1)* 25 to 26 labelled b_1(1)* 26 to 27 labelled a_1(1)* 27 to 28 labelled a_1(1)* 27 to 13 labelled b_1(1)* 28 to 17 labelled a_1(1)* 29 to 30 labelled a_1(2)* 30 to 31 labelled a_1(2)* 31 to 32 labelled a_1(2)* 32 to 33 labelled b_1(2)* 33 to 34 labelled b_1(2)* 34 to 35 labelled a_1(2)* 35 to 36 labelled a_1(2)* 35 to 13 labelled b_1(1)* 36 to 17 labelled a_1(2)


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

(4)
YES