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


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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
368, 369, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543

Node 368 is start node and node 369 is final node.

Those nodes are connected through the following edges:

* 368 to 522 labelled b_1(0)* 369 to 369 labelled #_1(0)* 522 to 523 labelled a_1(0)* 523 to 524 labelled a_1(0)* 524 to 525 labelled a_1(0)* 525 to 526 labelled b_1(0)* 526 to 527 labelled a_1(0)* 527 to 528 labelled b_1(0)* 528 to 529 labelled a_1(0)* 528 to 533 labelled b_1(1)* 529 to 530 labelled a_1(0)* 529 to 533 labelled b_1(1)* 530 to 531 labelled a_1(0)* 530 to 533 labelled b_1(1)* 531 to 532 labelled a_1(0)* 531 to 533 labelled b_1(1)* 532 to 369 labelled a_1(0)* 532 to 533 labelled b_1(1)* 533 to 534 labelled a_1(1)* 534 to 535 labelled a_1(1)* 535 to 536 labelled a_1(1)* 536 to 537 labelled b_1(1)* 537 to 538 labelled a_1(1)* 538 to 539 labelled b_1(1)* 539 to 540 labelled a_1(1)* 539 to 533 labelled b_1(1)* 540 to 541 labelled a_1(1)* 540 to 533 labelled b_1(1)* 541 to 542 labelled a_1(1)* 541 to 533 labelled b_1(1)* 542 to 543 labelled a_1(1)* 542 to 533 labelled b_1(1)* 543 to 369 labelled a_1(1)* 543 to 533 labelled b_1(1)


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

(6)
YES