39.28/11.00	YES
39.66/11.04	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
39.66/11.04	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
39.66/11.04	
39.66/11.04	
39.66/11.04	Termination w.r.t. Q of the given QTRS could be proven:
39.66/11.04	
39.66/11.04	(0) QTRS
39.66/11.04	(1) FlatCCProof [EQUIVALENT, 0 ms]
39.66/11.04	(2) QTRS
39.66/11.04	(3) RootLabelingProof [EQUIVALENT, 0 ms]
39.66/11.04	(4) QTRS
39.66/11.04	(5) DependencyPairsProof [EQUIVALENT, 2 ms]
39.66/11.04	(6) QDP
39.66/11.04	(7) DependencyGraphProof [EQUIVALENT, 3 ms]
39.66/11.04	(8) QDP
39.66/11.04	(9) QDPOrderProof [EQUIVALENT, 72 ms]
39.66/11.04	(10) QDP
39.66/11.04	(11) QDPOrderProof [EQUIVALENT, 0 ms]
39.66/11.04	(12) QDP
39.66/11.04	(13) QDPOrderProof [EQUIVALENT, 417 ms]
39.66/11.04	(14) QDP
39.66/11.04	(15) PisEmptyProof [EQUIVALENT, 0 ms]
39.66/11.04	(16) YES
39.66/11.04	
39.66/11.04	
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(0)
39.66/11.04	Obligation:
39.66/11.04	Q restricted rewrite system:
39.66/11.04	The TRS R consists of the following rules:
39.66/11.04	
39.66/11.04	   b(a(b(a(x1)))) -> b(a(b(b(x1))))
39.66/11.04	   b(b(b(b(x1)))) -> b(a(a(b(x1))))
39.66/11.04	   a(a(a(b(x1)))) -> b(a(b(a(x1))))
39.66/11.04	
39.66/11.04	Q is empty.
39.66/11.04	
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(1) FlatCCProof (EQUIVALENT)
39.66/11.04	We used flat context closure [ROOTLAB]
39.66/11.04	As Q is empty the flat context closure was sound AND complete.
39.66/11.04	
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(2)
39.66/11.04	Obligation:
39.66/11.04	Q restricted rewrite system:
39.66/11.04	The TRS R consists of the following rules:
39.66/11.04	
39.66/11.04	   b(a(b(a(x1)))) -> b(a(b(b(x1))))
39.66/11.04	   b(b(b(b(x1)))) -> b(a(a(b(x1))))
39.66/11.04	   b(a(a(a(b(x1))))) -> b(b(a(b(a(x1)))))
39.66/11.04	   a(a(a(a(b(x1))))) -> a(b(a(b(a(x1)))))
39.66/11.04	
39.66/11.04	Q is empty.
39.66/11.04	
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(3) RootLabelingProof (EQUIVALENT)
39.66/11.04	We used plain root labeling [ROOTLAB] with the following heuristic:
39.66/11.04	LabelAll: All function symbols get labeled
39.66/11.04	
39.66/11.04	As Q is empty the root labeling was sound AND complete.
39.66/11.04	
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(4)
39.66/11.04	Obligation:
39.66/11.04	Q restricted rewrite system:
39.66/11.04	The TRS R consists of the following rules:
39.66/11.04	
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	
39.66/11.04	Q is empty.
39.66/11.04	
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(5) DependencyPairsProof (EQUIVALENT)
39.66/11.04	Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(6)
39.66/11.04	Obligation:
39.66/11.04	Q DP problem:
39.66/11.04	The TRS P consists of the following rules:
39.66/11.04	
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(b_{b_1}(x1))
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(x1)
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{B_1}(b_{a_1}(x1))
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{A_1}(x1)
39.66/11.04	   B_{B_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> B_{A_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   B_{B_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{b_1}(x1)))
39.66/11.04	   B_{B_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> B_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	   B_{B_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{a_1}(x1)))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(x1))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{a_1}(x1))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> A_{A_1}(x1)
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(x1))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{a_1}(x1))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> A_{A_1}(x1)
39.66/11.04	
39.66/11.04	The TRS R consists of the following rules:
39.66/11.04	
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	
39.66/11.04	Q is empty.
39.66/11.04	We have to consider all minimal (P,Q,R)-chains.
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(7) DependencyGraphProof (EQUIVALENT)
39.66/11.04	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 9 less nodes.
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(8)
39.66/11.04	Obligation:
39.66/11.04	Q DP problem:
39.66/11.04	The TRS P consists of the following rules:
39.66/11.04	
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{A_1}(x1)
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(x1))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{a_1}(x1))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> A_{A_1}(x1)
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(x1))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{a_1}(x1))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> A_{A_1}(x1)
39.66/11.04	
39.66/11.04	The TRS R consists of the following rules:
39.66/11.04	
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	
39.66/11.04	Q is empty.
39.66/11.04	We have to consider all minimal (P,Q,R)-chains.
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(9) QDPOrderProof (EQUIVALENT)
39.66/11.04	We use the reduction pair processor [LPAR04,JAR06].
39.66/11.04	
39.66/11.04	
39.66/11.04	The following pairs can be oriented strictly and are deleted.
39.66/11.04	
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{A_1}(x1)
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(x1))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{a_1}(x1))
39.66/11.04	   B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> A_{A_1}(x1)
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(x1))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{a_1}(x1))
39.66/11.04	   A_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> A_{A_1}(x1)
39.66/11.04	The remaining pairs can at least be oriented weakly.
39.66/11.04	Used ordering:  Polynomial interpretation [POLO]:
39.66/11.04	
39.66/11.04	   POL(A_{A_1}(x_1)) = x_1
39.66/11.04	   POL(B_{A_1}(x_1)) = x_1
39.66/11.04	   POL(a_{a_1}(x_1)) = 1 + x_1
39.66/11.04	   POL(a_{b_1}(x_1)) = 1 + x_1
39.66/11.04	   POL(b_{a_1}(x_1)) = 1 + x_1
39.66/11.04	   POL(b_{b_1}(x_1)) = 1 + x_1
39.66/11.04	
39.66/11.04	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
39.66/11.04	
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	
39.66/11.04	
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(10)
39.66/11.04	Obligation:
39.66/11.04	Q DP problem:
39.66/11.04	The TRS P consists of the following rules:
39.66/11.04	
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	
39.66/11.04	The TRS R consists of the following rules:
39.66/11.04	
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	
39.66/11.04	Q is empty.
39.66/11.04	We have to consider all minimal (P,Q,R)-chains.
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(11) QDPOrderProof (EQUIVALENT)
39.66/11.04	We use the reduction pair processor [LPAR04,JAR06].
39.66/11.04	
39.66/11.04	
39.66/11.04	The following pairs can be oriented strictly and are deleted.
39.66/11.04	
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	The remaining pairs can at least be oriented weakly.
39.66/11.04	Used ordering:  Polynomial interpretation [POLO]:
39.66/11.04	
39.66/11.04	   POL(B_{A_1}(x_1)) = x_1
39.66/11.04	   POL(a_{a_1}(x_1)) = 0
39.66/11.04	   POL(a_{b_1}(x_1)) = 1 + x_1
39.66/11.04	   POL(b_{a_1}(x_1)) = x_1
39.66/11.04	   POL(b_{b_1}(x_1)) = 0
39.66/11.04	
39.66/11.04	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
39.66/11.04	
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	
39.66/11.04	
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(12)
39.66/11.04	Obligation:
39.66/11.04	Q DP problem:
39.66/11.04	The TRS P consists of the following rules:
39.66/11.04	
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	
39.66/11.04	The TRS R consists of the following rules:
39.66/11.04	
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	
39.66/11.04	Q is empty.
39.66/11.04	We have to consider all minimal (P,Q,R)-chains.
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(13) QDPOrderProof (EQUIVALENT)
39.66/11.04	We use the reduction pair processor [LPAR04,JAR06].
39.66/11.04	
39.66/11.04	
39.66/11.04	The following pairs can be oriented strictly and are deleted.
39.66/11.04	
39.66/11.04	   B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	The remaining pairs can at least be oriented weakly.
39.66/11.04	Used ordering:  Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:
39.66/11.04	
39.66/11.04	   <<<
39.66/11.04	 POL(B_{A_1}(x_1)) =  	[[-I]] 	 +  	[[0A, 0A, 0A]] 	* 	x_1
39.66/11.04	>>>
39.66/11.04	
39.66/11.04	   <<<
39.66/11.04	 POL(a_{b_1}(x_1)) =  	[[-I], [-I], [-I]] 	 +  	[[0A, -I, -I], [0A, -I, -I], [0A, 0A, -I]] 	* 	x_1
39.66/11.04	>>>
39.66/11.04	
39.66/11.04	   <<<
39.66/11.04	 POL(b_{a_1}(x_1)) =  	[[-I], [-I], [-I]] 	 +  	[[0A, -I, -I], [0A, 0A, -I], [0A, 0A, -I]] 	* 	x_1
39.66/11.04	>>>
39.66/11.04	
39.66/11.04	   <<<
39.66/11.04	 POL(a_{a_1}(x_1)) =  	[[-I], [0A], [0A]] 	 +  	[[0A, 0A, -I], [1A, 1A, 0A], [-I, -I, 0A]] 	* 	x_1
39.66/11.04	>>>
39.66/11.04	
39.66/11.04	   <<<
39.66/11.04	 POL(b_{b_1}(x_1)) =  	[[-I], [-I], [0A]] 	 +  	[[0A, -I, -I], [0A, 0A, 0A], [1A, 0A, 0A]] 	* 	x_1
39.66/11.04	>>>
39.66/11.04	
39.66/11.04	
39.66/11.04	The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
39.66/11.04	
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	
39.66/11.04	
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(14)
39.66/11.04	Obligation:
39.66/11.04	Q DP problem:
39.66/11.04	P is empty.
39.66/11.04	The TRS R consists of the following rules:
39.66/11.04	
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))
39.66/11.04	   b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))
39.66/11.04	   a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))
39.66/11.04	
39.66/11.04	Q is empty.
39.66/11.04	We have to consider all minimal (P,Q,R)-chains.
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(15) PisEmptyProof (EQUIVALENT)
39.66/11.04	The TRS P is empty. Hence, there is no (P,Q,R) chain.
39.66/11.04	----------------------------------------
39.66/11.04	
39.66/11.04	(16)
39.66/11.04	YES
39.74/11.14	EOF