3.06/1.58	NO
3.30/1.62	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
3.30/1.62	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.30/1.62	
3.30/1.62	
3.30/1.62	Termination of the given RelTRS could be disproven:
3.30/1.62	
3.30/1.62	(0) RelTRS
3.30/1.62	(1) RelTRSLoopFinderProof [COMPLETE, 23 ms]
3.30/1.62	(2) NO
3.30/1.62	
3.30/1.62	
3.30/1.62	----------------------------------------
3.30/1.62	
3.30/1.62	(0)
3.30/1.62	Obligation:
3.30/1.62	Relative term rewrite system:
3.30/1.62	The relative TRS consists of the following R rules:
3.30/1.62	
3.30/1.62	   f(s(x)) -> f(x)
3.30/1.62	
3.30/1.62	The relative TRS consists of the following S rules:
3.30/1.62	
3.30/1.62	   inf -> s(inf)
3.30/1.62	
3.30/1.62	
3.30/1.62	----------------------------------------
3.30/1.62	
3.30/1.62	(1) RelTRSLoopFinderProof (COMPLETE)
3.30/1.62	The following loop was found:
3.30/1.62	
3.30/1.62	---------- Loop: ----------
3.30/1.62	
3.30/1.62	f(inf) -> f(s(inf)) with rule inf -> s(inf) at position [0] and matcher [ ]
3.30/1.62	
3.30/1.62	f(s(inf)) -> f(inf) with rule f(s(x)) -> f(x) at position [] and matcher [x / inf]
3.30/1.62	
3.30/1.62	Now an instance of the first term with Matcher [ ] occurs in the last term at position [].
3.30/1.62	
3.30/1.62	Context: []
3.30/1.62	
3.30/1.62	Therefore, the relative TRS problem does not terminate.
3.30/1.62	----------------------------------------
3.30/1.62	
3.30/1.62	(2)
3.30/1.62	NO
3.30/1.67	EOF