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