3.71/1.79	YES
3.86/1.80	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.86/1.80	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.86/1.80	
3.86/1.80	
3.86/1.80	Termination w.r.t. Q of the given QTRS could be proven:
3.86/1.80	
3.86/1.80	(0) QTRS
3.86/1.80	(1) QTRS Reverse [EQUIVALENT, 0 ms]
3.86/1.80	(2) QTRS
3.86/1.80	(3) Strip Symbols Proof [SOUND, 0 ms]
3.86/1.80	(4) QTRS
3.86/1.80	(5) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms]
3.86/1.80	(6) YES
3.86/1.80	
3.86/1.80	
3.86/1.80	----------------------------------------
3.86/1.80	
3.86/1.80	(0)
3.86/1.80	Obligation:
3.86/1.80	Q restricted rewrite system:
3.86/1.80	The TRS R consists of the following rules:
3.86/1.80	
3.86/1.80	   a(b(a(a(a(a(a(x1))))))) -> a(a(a(a(a(a(b(a(b(a(a(a(b(x1)))))))))))))
3.86/1.80	
3.86/1.80	Q is empty.
3.86/1.80	
3.86/1.80	----------------------------------------
3.86/1.80	
3.86/1.80	(1) QTRS Reverse (EQUIVALENT)
3.86/1.80	We applied the QTRS Reverse Processor [REVERSE].
3.86/1.80	----------------------------------------
3.86/1.80	
3.86/1.80	(2)
3.86/1.80	Obligation:
3.86/1.80	Q restricted rewrite system:
3.86/1.80	The TRS R consists of the following rules:
3.86/1.80	
3.86/1.80	   a(a(a(a(a(b(a(x1))))))) -> b(a(a(a(b(a(b(a(a(a(a(a(a(x1)))))))))))))
3.86/1.80	
3.86/1.80	Q is empty.
3.86/1.80	
3.86/1.80	----------------------------------------
3.86/1.80	
3.86/1.80	(3) Strip Symbols Proof (SOUND)
3.86/1.80	We were given the following TRS:
3.86/1.81	
3.86/1.81	   a(a(a(a(a(b(a(x1))))))) -> b(a(a(a(b(a(b(a(a(a(a(a(a(x1)))))))))))))
3.86/1.81	
3.86/1.81	By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: 
3.86/1.81	
3.86/1.81	   a(a(a(a(a(b(x)))))) -> b(a(a(a(b(a(b(a(a(a(a(a(x))))))))))))
3.86/1.81	
3.86/1.81	----------------------------------------
3.86/1.81	
3.86/1.81	(4)
3.86/1.81	Obligation:
3.86/1.81	Q restricted rewrite system:
3.86/1.81	The TRS R consists of the following rules:
3.86/1.81	
3.86/1.81	   a(a(a(a(a(b(x)))))) -> b(a(a(a(b(a(b(a(a(a(a(a(x))))))))))))
3.86/1.81	
3.86/1.81	Q is empty.
3.86/1.81	
3.86/1.81	----------------------------------------
3.86/1.81	
3.86/1.81	(5) RFCMatchBoundsTRSProof (EQUIVALENT)
3.86/1.81	Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 1. This implies Q-termination of R.
3.86/1.81	The following rules were used to construct the certificate:
3.86/1.81	
3.86/1.81	   a(a(a(a(a(b(x)))))) -> b(a(a(a(b(a(b(a(a(a(a(a(x))))))))))))
3.86/1.81	
3.86/1.81	The certificate found is represented by the following graph.
3.86/1.81	The certificate consists of the following enumerated nodes:
3.86/1.81	520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543
3.86/1.81	
3.86/1.81	Node 520 is start node and node 521 is final node.
3.86/1.81	
3.86/1.81	Those nodes are connected through the following edges:
3.86/1.81	
3.86/1.81	* 520 to 522 labelled b_1(0)* 521 to 521 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 521 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 521 labelled a_1(1)* 543 to 533 labelled b_1(1)
3.86/1.81	
3.86/1.81	
3.86/1.81	----------------------------------------
3.86/1.81	
3.86/1.81	(6)
3.86/1.81	YES
3.86/1.82	EOF