/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: 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) Strip Symbols Proof [SOUND, 0 ms]
(4) QTRS
(5) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms]
(6) 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) Strip Symbols Proof (SOUND)
We were given the following TRS:

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

By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: 

   b(a(b(b(a(x))))) -> a(b(b(a(a(b(b(x)))))))

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

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

   b(a(b(b(a(x))))) -> a(b(b(a(a(b(b(x)))))))

Q is empty.

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 114, 115, 116, 117, 118, 119

Node 82 is start node and node 83 is final node.

Those nodes are connected through the following edges:

* 82 to 84 labelled a_1(0)* 83 to 83 labelled #_1(0)* 84 to 85 labelled b_1(0)* 85 to 86 labelled b_1(0)* 86 to 87 labelled a_1(0)* 87 to 88 labelled a_1(0)* 88 to 89 labelled b_1(0)* 88 to 96 labelled a_1(1)* 89 to 83 labelled b_1(0)* 89 to 90 labelled a_1(1)* 90 to 91 labelled b_1(1)* 91 to 92 labelled b_1(1)* 92 to 93 labelled a_1(1)* 93 to 94 labelled a_1(1)* 94 to 95 labelled b_1(1)* 94 to 114 labelled a_1(2)* 95 to 83 labelled b_1(1)* 95 to 90 labelled a_1(1)* 96 to 97 labelled b_1(1)* 97 to 98 labelled b_1(1)* 98 to 99 labelled a_1(1)* 99 to 100 labelled a_1(1)* 100 to 101 labelled b_1(1)* 100 to 114 labelled a_1(2)* 101 to 93 labelled b_1(1)* 101 to 90 labelled a_1(1)* 114 to 115 labelled b_1(2)* 115 to 116 labelled b_1(2)* 116 to 117 labelled a_1(2)* 117 to 118 labelled a_1(2)* 118 to 119 labelled b_1(2)* 118 to 114 labelled a_1(2)* 119 to 93 labelled b_1(2)* 119 to 90 labelled a_1(1)


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

(6)
YES