2.99/1.52	YES
2.99/1.52	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
2.99/1.52	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.99/1.52	
2.99/1.52	
2.99/1.52	Termination w.r.t. Q of the given QTRS could be proven:
2.99/1.52	
2.99/1.52	(0) QTRS
2.99/1.52	(1) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms]
2.99/1.52	(2) YES
2.99/1.52	
2.99/1.52	
2.99/1.52	----------------------------------------
2.99/1.52	
2.99/1.52	(0)
2.99/1.52	Obligation:
2.99/1.52	Q restricted rewrite system:
2.99/1.52	The TRS R consists of the following rules:
2.99/1.52	
2.99/1.52	   f(X) -> g
2.99/1.52	
2.99/1.52	The set Q consists of the following terms:
2.99/1.52	
2.99/1.52	   f(x0)
2.99/1.52	
2.99/1.52	
2.99/1.52	----------------------------------------
2.99/1.52	
2.99/1.52	(1) RFCMatchBoundsTRSProof (EQUIVALENT)
2.99/1.52	Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 0. This implies Q-termination of R.
2.99/1.52	The following rules were used to construct the certificate:
2.99/1.52	
2.99/1.52	   f(X) -> g
2.99/1.52	
2.99/1.52	The certificate found is represented by the following graph.
2.99/1.52	The certificate consists of the following enumerated nodes:
2.99/1.52	1, 2
2.99/1.52	
2.99/1.52	Node 1 is start node and node 2 is final node.
2.99/1.52	
2.99/1.52	Those nodes are connected through the following edges:
2.99/1.52	
2.99/1.52	* 1 to 2 labelled g(0)* 2 to 2 labelled #_1(0)
3.19/1.53	
3.19/1.53	
3.19/1.53	----------------------------------------
3.19/1.53	
3.19/1.53	(2)
3.19/1.53	YES
3.19/1.56	EOF