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


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

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

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

Q is empty.

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

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

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

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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 357, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369

Node 331 is start node and node 332 is final node.

Those nodes are connected through the following edges:

* 331 to 333 labelled b_1(0)* 332 to 332 labelled #_1(0)* 333 to 334 labelled a_1(0)* 334 to 335 labelled b_1(0)* 335 to 336 labelled a_1(0)* 335 to 357 labelled b_1(1)* 336 to 337 labelled b_1(0)* 337 to 338 labelled a_1(0)* 338 to 339 labelled b_1(0)* 339 to 340 labelled a_1(0)* 340 to 341 labelled a_1(0)* 340 to 357 labelled b_1(1)* 341 to 342 labelled b_1(0)* 342 to 343 labelled a_1(0)* 342 to 357 labelled b_1(1)* 343 to 344 labelled b_1(0)* 344 to 332 labelled a_1(0)* 344 to 357 labelled b_1(1)* 357 to 359 labelled a_1(1)* 359 to 360 labelled b_1(1)* 360 to 361 labelled a_1(1)* 360 to 357 labelled b_1(1)* 361 to 362 labelled b_1(1)* 362 to 363 labelled a_1(1)* 363 to 364 labelled b_1(1)* 364 to 365 labelled a_1(1)* 365 to 366 labelled a_1(1)* 365 to 357 labelled b_1(1)* 366 to 367 labelled b_1(1)* 367 to 368 labelled a_1(1)* 367 to 357 labelled b_1(1)* 368 to 369 labelled b_1(1)* 369 to 332 labelled a_1(1)* 369 to 357 labelled b_1(1)


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

(6)
YES