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

Q is empty.

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

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

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

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

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

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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
146, 147, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222

Node 146 is start node and node 147 is final node.

Those nodes are connected through the following edges:

* 146 to 199 labelled b_1(0)* 147 to 147 labelled #_1(0)* 199 to 200 labelled a_1(0)* 200 to 201 labelled a_1(0)* 201 to 202 labelled b_1(0)* 202 to 203 labelled b_1(0)* 203 to 204 labelled a_1(0)* 204 to 205 labelled a_1(0)* 204 to 211 labelled b_1(1)* 205 to 206 labelled b_1(0)* 206 to 207 labelled a_1(0)* 206 to 211 labelled b_1(1)* 207 to 208 labelled b_1(0)* 208 to 209 labelled a_1(0)* 208 to 211 labelled b_1(1)* 209 to 210 labelled b_1(0)* 210 to 147 labelled a_1(0)* 210 to 211 labelled b_1(1)* 211 to 212 labelled a_1(1)* 212 to 213 labelled a_1(1)* 213 to 214 labelled b_1(1)* 214 to 215 labelled b_1(1)* 215 to 216 labelled a_1(1)* 216 to 217 labelled a_1(1)* 216 to 211 labelled b_1(1)* 217 to 218 labelled b_1(1)* 218 to 219 labelled a_1(1)* 218 to 211 labelled b_1(1)* 219 to 220 labelled b_1(1)* 220 to 221 labelled a_1(1)* 220 to 211 labelled b_1(1)* 221 to 222 labelled b_1(1)* 222 to 147 labelled a_1(1)* 222 to 211 labelled b_1(1)


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

(6)
YES