/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: 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, 1 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(b(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(b(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(b(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(b(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(b(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(b(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:
311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334

Node 311 is start node and node 312 is final node.

Those nodes are connected through the following edges:

* 311 to 313 labelled b_1(0)* 312 to 312 labelled #_1(0)* 313 to 314 labelled a_1(0)* 314 to 315 labelled b_1(0)* 315 to 316 labelled a_1(0)* 316 to 317 labelled b_1(0)* 317 to 318 labelled a_1(0)* 318 to 319 labelled a_1(0)* 319 to 320 labelled b_1(0)* 320 to 321 labelled a_1(0)* 320 to 324 labelled b_1(1)* 321 to 322 labelled a_1(0)* 321 to 324 labelled b_1(1)* 322 to 323 labelled a_1(0)* 322 to 324 labelled b_1(1)* 323 to 312 labelled a_1(0)* 323 to 324 labelled b_1(1)* 324 to 325 labelled a_1(1)* 325 to 326 labelled b_1(1)* 326 to 327 labelled a_1(1)* 327 to 328 labelled b_1(1)* 328 to 329 labelled a_1(1)* 329 to 330 labelled a_1(1)* 330 to 331 labelled b_1(1)* 331 to 332 labelled a_1(1)* 331 to 324 labelled b_1(1)* 332 to 333 labelled a_1(1)* 332 to 324 labelled b_1(1)* 333 to 334 labelled a_1(1)* 333 to 324 labelled b_1(1)* 334 to 312 labelled a_1(1)* 334 to 324 labelled b_1(1)


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

(6)
YES