/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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423

Node 400 is start node and node 401 is final node.

Those nodes are connected through the following edges:

* 400 to 402 labelled b_1(0)* 401 to 401 labelled #_1(0)* 402 to 403 labelled b_1(0)* 403 to 404 labelled a_1(0)* 404 to 405 labelled a_1(0)* 405 to 406 labelled a_1(0)* 406 to 407 labelled b_1(0)* 407 to 408 labelled b_1(0)* 408 to 409 labelled a_1(0)* 408 to 413 labelled b_1(1)* 409 to 410 labelled a_1(0)* 409 to 413 labelled b_1(1)* 410 to 411 labelled a_1(0)* 410 to 413 labelled b_1(1)* 411 to 412 labelled a_1(0)* 411 to 413 labelled b_1(1)* 412 to 401 labelled a_1(0)* 412 to 413 labelled b_1(1)* 413 to 414 labelled b_1(1)* 414 to 415 labelled a_1(1)* 415 to 416 labelled a_1(1)* 416 to 417 labelled a_1(1)* 417 to 418 labelled b_1(1)* 418 to 419 labelled b_1(1)* 419 to 420 labelled a_1(1)* 419 to 413 labelled b_1(1)* 420 to 421 labelled a_1(1)* 420 to 413 labelled b_1(1)* 421 to 422 labelled a_1(1)* 421 to 413 labelled b_1(1)* 422 to 423 labelled a_1(1)* 422 to 413 labelled b_1(1)* 423 to 401 labelled a_1(1)* 423 to 413 labelled b_1(1)


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

(6)
YES