3.96/1.79	YES
3.96/1.81	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.96/1.81	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.96/1.81	
3.96/1.81	
3.96/1.81	Termination of the given RelTRS could be proven:
3.96/1.81	
3.96/1.81	(0) RelTRS
3.96/1.81	(1) RelTRSRRRProof [EQUIVALENT, 19 ms]
3.96/1.81	(2) RelTRS
3.96/1.81	(3) RIsEmptyProof [EQUIVALENT, 0 ms]
3.96/1.81	(4) YES
3.96/1.81	
3.96/1.81	
3.96/1.81	----------------------------------------
3.96/1.81	
3.96/1.81	(0)
3.96/1.81	Obligation:
3.96/1.81	Relative term rewrite system:
3.96/1.81	The relative TRS consists of the following R rules:
3.96/1.81	
3.96/1.81	   R(x, B2) -> B2
3.96/1.81	   W(x, B2) -> B2
3.96/1.81	
3.96/1.81	The relative TRS consists of the following S rules:
3.96/1.81	
3.96/1.81	   B1 -> R(T, B1)
3.96/1.81	   B1 -> W(T, B1)
3.96/1.81	
3.96/1.81	
3.96/1.81	----------------------------------------
3.96/1.81	
3.96/1.81	(1) RelTRSRRRProof (EQUIVALENT)
3.96/1.81	We used the following monotonic ordering for rule removal:
3.96/1.81	Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :
3.96/1.81	
3.96/1.81	   <<<
3.96/1.81	 POL(R(x_1, x_2)) =  	[[0], [0]] 	 +  	[[1, 0], [1, 0]] 	* 	x_1 	 +  	[[1, 1], [0, 1]] 	* 	x_2
3.96/1.81	>>>
3.96/1.81	
3.96/1.81	   <<<
3.96/1.81	 POL(B2) =  	[[1], [1]]
3.96/1.81	>>>
3.96/1.81	
3.96/1.81	   <<<
3.96/1.81	 POL(W(x_1, x_2)) =  	[[0], [0]] 	 +  	[[1, 0], [1, 0]] 	* 	x_1 	 +  	[[1, 1], [0, 1]] 	* 	x_2
3.96/1.81	>>>
3.96/1.81	
3.96/1.81	   <<<
3.96/1.81	 POL(B1) =  	[[1], [0]]
3.96/1.81	>>>
3.96/1.81	
3.96/1.81	   <<<
3.96/1.81	 POL(T) =  	[[0], [1]]
3.96/1.81	>>>
3.96/1.81	
3.96/1.81	With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
3.96/1.81	Rules from R:
3.96/1.81	
3.96/1.81	   R(x, B2) -> B2
3.96/1.81	   W(x, B2) -> B2
3.96/1.81	Rules from S:
3.96/1.81	none
3.96/1.81	
3.96/1.81	
3.96/1.81	
3.96/1.81	
3.96/1.81	----------------------------------------
3.96/1.81	
3.96/1.81	(2)
3.96/1.81	Obligation:
3.96/1.81	Relative term rewrite system:
3.96/1.81	R is empty.
3.96/1.81	The relative TRS consists of the following S rules:
3.96/1.81	
3.96/1.81	   B1 -> R(T, B1)
3.96/1.81	   B1 -> W(T, B1)
3.96/1.81	
3.96/1.81	
3.96/1.81	----------------------------------------
3.96/1.81	
3.96/1.81	(3) RIsEmptyProof (EQUIVALENT)
3.96/1.81	The TRS R is empty. Hence, termination is trivially proven.
3.96/1.81	----------------------------------------
3.96/1.81	
3.96/1.81	(4)
3.96/1.81	YES
4.07/1.84	EOF