/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, 7 ms]
(6) YES


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

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

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

Q is empty.

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

(3) Strip Symbols Proof (SOUND)
We were given the following TRS:

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

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

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

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

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

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

Q is empty.

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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
96, 97, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134

Node 96 is start node and node 97 is final node.

Those nodes are connected through the following edges:

* 96 to 111 labelled b_1(0)* 97 to 97 labelled #_1(0)* 111 to 112 labelled b_1(0)* 112 to 113 labelled a_1(0)* 113 to 114 labelled a_1(0)* 114 to 115 labelled a_1(0)* 115 to 116 labelled b_1(0)* 116 to 117 labelled b_1(0)* 117 to 118 labelled a_1(0)* 117 to 123 labelled b_1(1)* 118 to 119 labelled a_1(0)* 118 to 123 labelled b_1(1)* 119 to 120 labelled a_1(0)* 119 to 123 labelled b_1(1)* 120 to 121 labelled a_1(0)* 120 to 123 labelled b_1(1)* 121 to 122 labelled a_1(0)* 121 to 123 labelled b_1(1)* 122 to 97 labelled a_1(0)* 122 to 123 labelled b_1(1)* 123 to 124 labelled b_1(1)* 124 to 125 labelled a_1(1)* 125 to 126 labelled a_1(1)* 126 to 127 labelled a_1(1)* 127 to 128 labelled b_1(1)* 128 to 129 labelled b_1(1)* 129 to 130 labelled a_1(1)* 129 to 123 labelled b_1(1)* 130 to 131 labelled a_1(1)* 130 to 123 labelled b_1(1)* 131 to 132 labelled a_1(1)* 131 to 123 labelled b_1(1)* 132 to 133 labelled a_1(1)* 132 to 123 labelled b_1(1)* 133 to 134 labelled a_1(1)* 133 to 123 labelled b_1(1)* 134 to 97 labelled a_1(1)* 134 to 123 labelled b_1(1)


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

(6)
YES