/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(a(a(b(a(x1)))))) -> a(a(b(a(b(a(b(a(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(a(b(a(x1)))))) -> b(a(a(b(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(a(b(a(x1)))))) -> b(a(a(b(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(a(b(x))))) -> b(a(a(b(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(a(b(x))))) -> b(a(a(b(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(a(b(x))))) -> b(a(a(b(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:
422, 423, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505

Node 422 is start node and node 423 is final node.

Those nodes are connected through the following edges:

* 422 to 486 labelled b_1(0)* 423 to 423 labelled #_1(0)* 486 to 487 labelled a_1(0)* 487 to 488 labelled a_1(0)* 488 to 489 labelled b_1(0)* 489 to 490 labelled a_1(0)* 490 to 491 labelled b_1(0)* 491 to 492 labelled a_1(0)* 492 to 493 labelled b_1(0)* 493 to 494 labelled a_1(0)* 493 to 496 labelled b_1(1)* 494 to 495 labelled b_1(0)* 495 to 423 labelled a_1(0)* 495 to 496 labelled b_1(1)* 496 to 497 labelled a_1(1)* 497 to 498 labelled a_1(1)* 498 to 499 labelled b_1(1)* 499 to 500 labelled a_1(1)* 500 to 501 labelled b_1(1)* 501 to 502 labelled a_1(1)* 502 to 503 labelled b_1(1)* 503 to 504 labelled a_1(1)* 503 to 496 labelled b_1(1)* 504 to 505 labelled b_1(1)* 505 to 423 labelled a_1(1)* 505 to 496 labelled b_1(1)


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

(6)
YES