31.15/8.72	YES
31.29/8.78	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
31.29/8.78	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
31.29/8.78	
31.29/8.78	
31.29/8.78	Termination w.r.t. Q of the given QTRS could be proven:
31.29/8.78	
31.29/8.78	(0) QTRS
31.29/8.78	(1) QTRS Reverse [EQUIVALENT, 0 ms]
31.29/8.78	(2) QTRS
31.29/8.78	(3) DependencyPairsProof [EQUIVALENT, 2 ms]
31.29/8.78	(4) QDP
31.29/8.78	(5) QDPOrderProof [EQUIVALENT, 168 ms]
31.29/8.78	(6) QDP
31.29/8.78	(7) QDPOrderProof [EQUIVALENT, 15 ms]
31.29/8.78	(8) QDP
31.29/8.78	(9) DependencyGraphProof [EQUIVALENT, 0 ms]
31.29/8.78	(10) TRUE
31.29/8.78	
31.29/8.78	
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(0)
31.29/8.78	Obligation:
31.29/8.78	Q restricted rewrite system:
31.29/8.78	The TRS R consists of the following rules:
31.29/8.78	
31.29/8.78	   a(a(b(b(x1)))) -> a(b(a(a(x1))))
31.29/8.78	   a(x1) -> b(b(b(x1)))
31.29/8.78	
31.29/8.78	Q is empty.
31.29/8.78	
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(1) QTRS Reverse (EQUIVALENT)
31.29/8.78	We applied the QTRS Reverse Processor [REVERSE].
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(2)
31.29/8.78	Obligation:
31.29/8.78	Q restricted rewrite system:
31.29/8.78	The TRS R consists of the following rules:
31.29/8.78	
31.29/8.78	   b(b(a(a(x1)))) -> a(a(b(a(x1))))
31.29/8.78	   a(x1) -> b(b(b(x1)))
31.29/8.78	
31.29/8.78	Q is empty.
31.29/8.78	
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(3) DependencyPairsProof (EQUIVALENT)
31.29/8.78	Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(4)
31.29/8.78	Obligation:
31.29/8.78	Q DP problem:
31.29/8.78	The TRS P consists of the following rules:
31.29/8.78	
31.29/8.78	   B(b(a(a(x1)))) -> A(a(b(a(x1))))
31.29/8.78	   B(b(a(a(x1)))) -> A(b(a(x1)))
31.29/8.78	   B(b(a(a(x1)))) -> B(a(x1))
31.29/8.78	   A(x1) -> B(b(b(x1)))
31.29/8.78	   A(x1) -> B(b(x1))
31.29/8.78	   A(x1) -> B(x1)
31.29/8.78	
31.29/8.78	The TRS R consists of the following rules:
31.29/8.78	
31.29/8.78	   b(b(a(a(x1)))) -> a(a(b(a(x1))))
31.29/8.78	   a(x1) -> b(b(b(x1)))
31.29/8.78	
31.29/8.78	Q is empty.
31.29/8.78	We have to consider all minimal (P,Q,R)-chains.
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(5) QDPOrderProof (EQUIVALENT)
31.29/8.78	We use the reduction pair processor [LPAR04,JAR06].
31.29/8.78	
31.29/8.78	
31.29/8.78	The following pairs can be oriented strictly and are deleted.
31.29/8.78	
31.29/8.78	   B(b(a(a(x1)))) -> B(a(x1))
31.29/8.78	The remaining pairs can at least be oriented weakly.
31.29/8.78	Used ordering:  Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:
31.29/8.78	
31.29/8.78	   <<<
31.29/8.78	 POL(B(x_1)) =  	[[-I]] 	 +  	[[0A, -I, -I]] 	* 	x_1
31.29/8.78	>>>
31.29/8.78	
31.29/8.78	   <<<
31.29/8.78	 POL(b(x_1)) =  	[[-I], [-I], [-I]] 	 +  	[[0A, -I, -I], [0A, -I, 0A], [0A, 0A, -I]] 	* 	x_1
31.29/8.78	>>>
31.29/8.78	
31.29/8.78	   <<<
31.29/8.78	 POL(a(x_1)) =  	[[-I], [-I], [0A]] 	 +  	[[0A, -I, 0A], [0A, -I, 0A], [1A, 0A, 1A]] 	* 	x_1
31.29/8.78	>>>
31.29/8.78	
31.29/8.78	   <<<
31.29/8.78	 POL(A(x_1)) =  	[[0A]] 	 +  	[[0A, 0A, 0A]] 	* 	x_1
31.29/8.78	>>>
31.29/8.78	
31.29/8.78	
31.29/8.78	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
31.29/8.78	
31.29/8.78	   a(x1) -> b(b(b(x1)))
31.29/8.78	   b(b(a(a(x1)))) -> a(a(b(a(x1))))
31.29/8.78	
31.29/8.78	
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(6)
31.29/8.78	Obligation:
31.29/8.78	Q DP problem:
31.29/8.78	The TRS P consists of the following rules:
31.29/8.78	
31.29/8.78	   B(b(a(a(x1)))) -> A(a(b(a(x1))))
31.29/8.78	   B(b(a(a(x1)))) -> A(b(a(x1)))
31.29/8.78	   A(x1) -> B(b(b(x1)))
31.29/8.78	   A(x1) -> B(b(x1))
31.29/8.78	   A(x1) -> B(x1)
31.29/8.78	
31.29/8.78	The TRS R consists of the following rules:
31.29/8.78	
31.29/8.78	   b(b(a(a(x1)))) -> a(a(b(a(x1))))
31.29/8.78	   a(x1) -> b(b(b(x1)))
31.29/8.78	
31.29/8.78	Q is empty.
31.29/8.78	We have to consider all minimal (P,Q,R)-chains.
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(7) QDPOrderProof (EQUIVALENT)
31.29/8.78	We use the reduction pair processor [LPAR04,JAR06].
31.29/8.78	
31.29/8.78	
31.29/8.78	The following pairs can be oriented strictly and are deleted.
31.29/8.78	
31.29/8.78	   B(b(a(a(x1)))) -> A(a(b(a(x1))))
31.29/8.78	   B(b(a(a(x1)))) -> A(b(a(x1)))
31.29/8.78	The remaining pairs can at least be oriented weakly.
31.29/8.78	Used ordering:  Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:
31.29/8.78	
31.29/8.78	   <<<
31.29/8.78	 POL(B(x_1)) =  	[[0A]] 	 +  	[[0A, 0A, 0A]] 	* 	x_1
31.29/8.78	>>>
31.29/8.78	
31.29/8.78	   <<<
31.29/8.78	 POL(b(x_1)) =  	[[0A], [0A], [0A]] 	 +  	[[-I, -I, 0A], [-I, -I, 0A], [0A, 0A, -I]] 	* 	x_1
31.29/8.78	>>>
31.29/8.78	
31.29/8.78	   <<<
31.29/8.78	 POL(a(x_1)) =  	[[0A], [1A], [0A]] 	 +  	[[0A, 1A, 0A], [1A, 0A, 0A], [0A, 0A, -I]] 	* 	x_1
31.29/8.78	>>>
31.29/8.78	
31.29/8.78	   <<<
31.29/8.78	 POL(A(x_1)) =  	[[0A]] 	 +  	[[0A, 0A, 0A]] 	* 	x_1
31.29/8.78	>>>
31.29/8.78	
31.29/8.78	
31.29/8.78	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
31.29/8.78	
31.29/8.78	   a(x1) -> b(b(b(x1)))
31.29/8.78	   b(b(a(a(x1)))) -> a(a(b(a(x1))))
31.29/8.78	
31.29/8.78	
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(8)
31.29/8.78	Obligation:
31.29/8.78	Q DP problem:
31.29/8.78	The TRS P consists of the following rules:
31.29/8.78	
31.29/8.78	   A(x1) -> B(b(b(x1)))
31.29/8.78	   A(x1) -> B(b(x1))
31.29/8.78	   A(x1) -> B(x1)
31.29/8.78	
31.29/8.78	The TRS R consists of the following rules:
31.29/8.78	
31.29/8.78	   b(b(a(a(x1)))) -> a(a(b(a(x1))))
31.29/8.78	   a(x1) -> b(b(b(x1)))
31.29/8.78	
31.29/8.78	Q is empty.
31.29/8.78	We have to consider all minimal (P,Q,R)-chains.
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(9) DependencyGraphProof (EQUIVALENT)
31.29/8.78	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 3 less nodes.
31.29/8.78	----------------------------------------
31.29/8.78	
31.29/8.78	(10)
31.29/8.78	TRUE
31.49/8.87	EOF