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