4.14/1.84	YES
4.47/1.88	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
4.47/1.88	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.47/1.88	
4.47/1.88	
4.47/1.88	Termination w.r.t. Q of the given QTRS could be proven:
4.47/1.88	
4.47/1.88	(0) QTRS
4.47/1.88	(1) QTRS Reverse [EQUIVALENT, 0 ms]
4.47/1.88	(2) QTRS
4.47/1.88	(3) Strip Symbols Proof [SOUND, 0 ms]
4.47/1.88	(4) QTRS
4.47/1.88	(5) RFCMatchBoundsTRSProof [EQUIVALENT, 2 ms]
4.47/1.88	(6) YES
4.47/1.88	
4.47/1.88	
4.47/1.88	----------------------------------------
4.47/1.88	
4.47/1.88	(0)
4.47/1.88	Obligation:
4.47/1.88	Q restricted rewrite system:
4.47/1.88	The TRS R consists of the following rules:
4.47/1.88	
4.47/1.88	   a(b(a(a(a(a(a(x1))))))) -> a(a(a(a(a(a(b(a(a(a(b(a(b(x1)))))))))))))
4.47/1.88	
4.47/1.88	Q is empty.
4.47/1.88	
4.47/1.88	----------------------------------------
4.47/1.88	
4.47/1.88	(1) QTRS Reverse (EQUIVALENT)
4.47/1.88	We applied the QTRS Reverse Processor [REVERSE].
4.47/1.88	----------------------------------------
4.47/1.88	
4.47/1.88	(2)
4.47/1.88	Obligation:
4.47/1.88	Q restricted rewrite system:
4.47/1.88	The TRS R consists of the following rules:
4.47/1.88	
4.47/1.88	   a(a(a(a(a(b(a(x1))))))) -> b(a(b(a(a(a(b(a(a(a(a(a(a(x1)))))))))))))
4.47/1.88	
4.47/1.88	Q is empty.
4.47/1.88	
4.47/1.88	----------------------------------------
4.47/1.88	
4.47/1.88	(3) Strip Symbols Proof (SOUND)
4.47/1.88	We were given the following TRS:
4.47/1.88	
4.47/1.88	   a(a(a(a(a(b(a(x1))))))) -> b(a(b(a(a(a(b(a(a(a(a(a(a(x1)))))))))))))
4.47/1.88	
4.47/1.88	By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: 
4.47/1.88	
4.47/1.88	   a(a(a(a(a(b(x)))))) -> b(a(b(a(a(a(b(a(a(a(a(a(x))))))))))))
4.47/1.88	
4.47/1.88	----------------------------------------
4.47/1.88	
4.47/1.88	(4)
4.47/1.88	Obligation:
4.47/1.88	Q restricted rewrite system:
4.47/1.88	The TRS R consists of the following rules:
4.47/1.88	
4.47/1.88	   a(a(a(a(a(b(x)))))) -> b(a(b(a(a(a(b(a(a(a(a(a(x))))))))))))
4.47/1.88	
4.47/1.88	Q is empty.
4.47/1.88	
4.47/1.88	----------------------------------------
4.47/1.88	
4.47/1.88	(5) RFCMatchBoundsTRSProof (EQUIVALENT)
4.47/1.88	Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 1. This implies Q-termination of R.
4.47/1.88	The following rules were used to construct the certificate:
4.47/1.88	
4.47/1.88	   a(a(a(a(a(b(x)))))) -> b(a(b(a(a(a(b(a(a(a(a(a(x))))))))))))
4.47/1.88	
4.47/1.88	The certificate found is represented by the following graph.
4.47/1.88	The certificate consists of the following enumerated nodes:
4.47/1.88	508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531
4.47/1.88	
4.47/1.88	Node 508 is start node and node 509 is final node.
4.47/1.88	
4.47/1.88	Those nodes are connected through the following edges:
4.47/1.88	
4.47/1.88	* 508 to 510 labelled b_1(0)* 509 to 509 labelled #_1(0)* 510 to 511 labelled a_1(0)* 511 to 512 labelled b_1(0)* 512 to 513 labelled a_1(0)* 513 to 514 labelled a_1(0)* 514 to 515 labelled a_1(0)* 515 to 516 labelled b_1(0)* 516 to 517 labelled a_1(0)* 516 to 521 labelled b_1(1)* 517 to 518 labelled a_1(0)* 517 to 521 labelled b_1(1)* 518 to 519 labelled a_1(0)* 518 to 521 labelled b_1(1)* 519 to 520 labelled a_1(0)* 519 to 521 labelled b_1(1)* 520 to 509 labelled a_1(0)* 520 to 521 labelled b_1(1)* 521 to 522 labelled a_1(1)* 522 to 523 labelled b_1(1)* 523 to 524 labelled a_1(1)* 524 to 525 labelled a_1(1)* 525 to 526 labelled a_1(1)* 526 to 527 labelled b_1(1)* 527 to 528 labelled a_1(1)* 527 to 521 labelled b_1(1)* 528 to 529 labelled a_1(1)* 528 to 521 labelled b_1(1)* 529 to 530 labelled a_1(1)* 529 to 521 labelled b_1(1)* 530 to 531 labelled a_1(1)* 530 to 521 labelled b_1(1)* 531 to 509 labelled a_1(1)* 531 to 521 labelled b_1(1)
4.47/1.88	
4.47/1.88	
4.47/1.88	----------------------------------------
4.47/1.88	
4.47/1.88	(6)
4.47/1.88	YES
4.53/2.45	EOF