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


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


YES
proof of /export/starexec/sandbox2/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(a(a(a(a(x1)))))) -> a(a(a(a(a(b(a(a(a(b(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(a(a(b(a(x1)))))) -> b(a(b(a(a(a(b(a(a(a(a(a(x1))))))))))))

Q is empty.

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

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

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

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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374

Node 353 is start node and node 354 is final node.

Those nodes are connected through the following edges:

* 353 to 355 labelled b_1(0)* 354 to 354 labelled #_1(0)* 355 to 356 labelled a_1(0)* 356 to 357 labelled b_1(0)* 357 to 358 labelled a_1(0)* 358 to 359 labelled a_1(0)* 359 to 360 labelled a_1(0)* 360 to 361 labelled b_1(0)* 361 to 362 labelled a_1(0)* 361 to 365 labelled b_1(1)* 362 to 363 labelled a_1(0)* 362 to 365 labelled b_1(1)* 363 to 364 labelled a_1(0)* 363 to 365 labelled b_1(1)* 364 to 354 labelled a_1(0)* 364 to 365 labelled b_1(1)* 365 to 366 labelled a_1(1)* 366 to 367 labelled b_1(1)* 367 to 368 labelled a_1(1)* 368 to 369 labelled a_1(1)* 369 to 370 labelled a_1(1)* 370 to 371 labelled b_1(1)* 371 to 372 labelled a_1(1)* 371 to 365 labelled b_1(1)* 372 to 373 labelled a_1(1)* 372 to 365 labelled b_1(1)* 373 to 374 labelled a_1(1)* 373 to 365 labelled b_1(1)* 374 to 354 labelled a_1(1)* 374 to 365 labelled b_1(1)


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

(6)
YES