27.07/7.84	YES
27.07/7.86	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
27.07/7.86	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
27.07/7.86	
27.07/7.86	
27.07/7.86	Termination w.r.t. Q of the given QTRS could be proven:
27.07/7.86	
27.07/7.86	(0) QTRS
27.07/7.86	(1) QTRS Reverse [EQUIVALENT, 0 ms]
27.07/7.86	(2) QTRS
27.07/7.86	(3) DependencyPairsProof [EQUIVALENT, 20 ms]
27.07/7.86	(4) QDP
27.07/7.86	(5) DependencyGraphProof [EQUIVALENT, 5 ms]
27.07/7.86	(6) QDP
27.07/7.86	(7) QDPOrderProof [EQUIVALENT, 92 ms]
27.07/7.86	(8) QDP
27.07/7.86	(9) QDPOrderProof [EQUIVALENT, 41 ms]
27.07/7.86	(10) QDP
27.07/7.86	(11) UsableRulesProof [EQUIVALENT, 0 ms]
27.07/7.86	(12) QDP
27.07/7.86	(13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
27.07/7.86	(14) YES
27.07/7.86	
27.07/7.86	
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(0)
27.07/7.86	Obligation:
27.07/7.86	Q restricted rewrite system:
27.07/7.86	The TRS R consists of the following rules:
27.07/7.86	
27.07/7.86	   a(x1) -> b(b(c(x1)))
27.07/7.86	   c(b(b(x1))) -> a(b(c(x1)))
27.07/7.86	   c(c(x1)) -> x1
27.07/7.86	
27.07/7.86	Q is empty.
27.07/7.86	
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(1) QTRS Reverse (EQUIVALENT)
27.07/7.86	We applied the QTRS Reverse Processor [REVERSE].
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(2)
27.07/7.86	Obligation:
27.07/7.86	Q restricted rewrite system:
27.07/7.86	The TRS R consists of the following rules:
27.07/7.86	
27.07/7.86	   a(x1) -> c(b(b(x1)))
27.07/7.86	   b(b(c(x1))) -> c(b(a(x1)))
27.07/7.86	   c(c(x1)) -> x1
27.07/7.86	
27.07/7.86	Q is empty.
27.07/7.86	
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(3) DependencyPairsProof (EQUIVALENT)
27.07/7.86	Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(4)
27.07/7.86	Obligation:
27.07/7.86	Q DP problem:
27.07/7.86	The TRS P consists of the following rules:
27.07/7.86	
27.07/7.86	   A(x1) -> C(b(b(x1)))
27.07/7.86	   A(x1) -> B(b(x1))
27.07/7.86	   A(x1) -> B(x1)
27.07/7.86	   B(b(c(x1))) -> C(b(a(x1)))
27.07/7.86	   B(b(c(x1))) -> B(a(x1))
27.07/7.86	   B(b(c(x1))) -> A(x1)
27.07/7.86	
27.07/7.86	The TRS R consists of the following rules:
27.07/7.86	
27.07/7.86	   a(x1) -> c(b(b(x1)))
27.07/7.86	   b(b(c(x1))) -> c(b(a(x1)))
27.07/7.86	   c(c(x1)) -> x1
27.07/7.86	
27.07/7.86	Q is empty.
27.07/7.86	We have to consider all minimal (P,Q,R)-chains.
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(5) DependencyGraphProof (EQUIVALENT)
27.07/7.86	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(6)
27.07/7.86	Obligation:
27.07/7.86	Q DP problem:
27.07/7.86	The TRS P consists of the following rules:
27.07/7.86	
27.07/7.86	   A(x1) -> B(b(x1))
27.07/7.86	   B(b(c(x1))) -> B(a(x1))
27.07/7.86	   B(b(c(x1))) -> A(x1)
27.07/7.86	   A(x1) -> B(x1)
27.07/7.86	
27.07/7.86	The TRS R consists of the following rules:
27.07/7.86	
27.07/7.86	   a(x1) -> c(b(b(x1)))
27.07/7.86	   b(b(c(x1))) -> c(b(a(x1)))
27.07/7.86	   c(c(x1)) -> x1
27.07/7.86	
27.07/7.86	Q is empty.
27.07/7.86	We have to consider all minimal (P,Q,R)-chains.
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(7) QDPOrderProof (EQUIVALENT)
27.07/7.86	We use the reduction pair processor [LPAR04,JAR06].
27.07/7.86	
27.07/7.86	
27.07/7.86	The following pairs can be oriented strictly and are deleted.
27.07/7.86	
27.07/7.86	   B(b(c(x1))) -> B(a(x1))
27.07/7.86	The remaining pairs can at least be oriented weakly.
27.07/7.86	Used ordering:  Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(A(x_1)) =  	[[1A]] 	 +  	[[0A, 0A, 0A]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(B(x_1)) =  	[[0A]] 	 +  	[[0A, 0A, -I]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(b(x_1)) =  	[[-I], [0A], [0A]] 	 +  	[[0A, 0A, -I], [-I, -I, 0A], [-I, 0A, -I]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(c(x_1)) =  	[[0A], [0A], [1A]] 	 +  	[[-I, -I, 0A], [-I, -I, 0A], [0A, 0A, 1A]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(a(x_1)) =  	[[0A], [0A], [1A]] 	 +  	[[-I, -I, 0A], [-I, -I, 0A], [0A, 0A, 1A]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	
27.07/7.86	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
27.07/7.86	
27.07/7.86	   b(b(c(x1))) -> c(b(a(x1)))
27.07/7.86	   a(x1) -> c(b(b(x1)))
27.07/7.86	   c(c(x1)) -> x1
27.07/7.86	
27.07/7.86	
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(8)
27.07/7.86	Obligation:
27.07/7.86	Q DP problem:
27.07/7.86	The TRS P consists of the following rules:
27.07/7.86	
27.07/7.86	   A(x1) -> B(b(x1))
27.07/7.86	   B(b(c(x1))) -> A(x1)
27.07/7.86	   A(x1) -> B(x1)
27.07/7.86	
27.07/7.86	The TRS R consists of the following rules:
27.07/7.86	
27.07/7.86	   a(x1) -> c(b(b(x1)))
27.07/7.86	   b(b(c(x1))) -> c(b(a(x1)))
27.07/7.86	   c(c(x1)) -> x1
27.07/7.86	
27.07/7.86	Q is empty.
27.07/7.86	We have to consider all minimal (P,Q,R)-chains.
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(9) QDPOrderProof (EQUIVALENT)
27.07/7.86	We use the reduction pair processor [LPAR04,JAR06].
27.07/7.86	
27.07/7.86	
27.07/7.86	The following pairs can be oriented strictly and are deleted.
27.07/7.86	
27.07/7.86	   A(x1) -> B(b(x1))
27.07/7.86	The remaining pairs can at least be oriented weakly.
27.07/7.86	Used ordering:  Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(A(x_1)) =  	[[1A]] 	 +  	[[1A, 0A, 0A]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(B(x_1)) =  	[[0A]] 	 +  	[[-I, 0A, -I]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(b(x_1)) =  	[[0A], [0A], [0A]] 	 +  	[[-I, 0A, -I], [0A, -I, -I], [-I, 0A, 0A]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(c(x_1)) =  	[[1A], [-I], [0A]] 	 +  	[[1A, 0A, 0A], [0A, -I, -I], [0A, 0A, 0A]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	   <<<
27.07/7.86	 POL(a(x_1)) =  	[[1A], [0A], [0A]] 	 +  	[[1A, 0A, 0A], [0A, -I, -I], [0A, 0A, 0A]] 	* 	x_1
27.07/7.86	>>>
27.07/7.86	
27.07/7.86	
27.07/7.86	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
27.07/7.86	
27.07/7.86	   b(b(c(x1))) -> c(b(a(x1)))
27.07/7.86	   a(x1) -> c(b(b(x1)))
27.07/7.86	   c(c(x1)) -> x1
27.07/7.86	
27.07/7.86	
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(10)
27.07/7.86	Obligation:
27.07/7.86	Q DP problem:
27.07/7.86	The TRS P consists of the following rules:
27.07/7.86	
27.07/7.86	   B(b(c(x1))) -> A(x1)
27.07/7.86	   A(x1) -> B(x1)
27.07/7.86	
27.07/7.86	The TRS R consists of the following rules:
27.07/7.86	
27.07/7.86	   a(x1) -> c(b(b(x1)))
27.07/7.86	   b(b(c(x1))) -> c(b(a(x1)))
27.07/7.86	   c(c(x1)) -> x1
27.07/7.86	
27.07/7.86	Q is empty.
27.07/7.86	We have to consider all minimal (P,Q,R)-chains.
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(11) UsableRulesProof (EQUIVALENT)
27.07/7.86	We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(12)
27.07/7.86	Obligation:
27.07/7.86	Q DP problem:
27.07/7.86	The TRS P consists of the following rules:
27.07/7.86	
27.07/7.86	   B(b(c(x1))) -> A(x1)
27.07/7.86	   A(x1) -> B(x1)
27.07/7.86	
27.07/7.86	R is empty.
27.07/7.86	Q is empty.
27.07/7.86	We have to consider all minimal (P,Q,R)-chains.
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(13) QDPSizeChangeProof (EQUIVALENT)
27.07/7.86	By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 
27.07/7.86	
27.07/7.86	From the DPs we obtained the following set of size-change graphs:
27.07/7.86	*A(x1) -> B(x1)
27.07/7.86	The graph contains the following edges 1 >= 1
27.07/7.86	
27.07/7.86	
27.07/7.86	*B(b(c(x1))) -> A(x1)
27.07/7.86	The graph contains the following edges 1 > 1
27.07/7.86	
27.07/7.86	
27.07/7.86	----------------------------------------
27.07/7.86	
27.07/7.86	(14)
27.07/7.86	YES
27.32/7.93	EOF