3.28/1.68	NO
3.50/1.71	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.50/1.71	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.50/1.71	
3.50/1.71	
3.50/1.71	Termination of the given RelTRS could be disproven:
3.50/1.71	
3.50/1.71	(0) RelTRS
3.50/1.71	(1) RelTRSLoopFinderProof [COMPLETE, 40 ms]
3.50/1.71	(2) NO
3.50/1.71	
3.50/1.71	
3.50/1.71	----------------------------------------
3.50/1.71	
3.50/1.71	(0)
3.50/1.71	Obligation:
3.50/1.71	Relative term rewrite system:
3.50/1.71	The relative TRS consists of the following R rules:
3.50/1.71	
3.50/1.71	   f(act, y) -> f(el(nact), y)
3.50/1.71	   f(x, nact) -> f(x, act)
3.50/1.71	   act -> el(nact)
3.50/1.71	   l(el(x)) -> el(l(x))
3.50/1.71	   el(r(x)) -> r(el(x))
3.50/1.71	
3.50/1.71	The relative TRS consists of the following S rules:
3.50/1.71	
3.50/1.71	   nact -> l(nact)
3.50/1.71	   nact -> r(nact)
3.50/1.71	
3.50/1.71	
3.50/1.71	----------------------------------------
3.50/1.71	
3.50/1.71	(1) RelTRSLoopFinderProof (COMPLETE)
3.50/1.71	The following loop was found:
3.50/1.71	
3.50/1.71	---------- Loop: ----------
3.50/1.71	
3.50/1.71	el(nact) -> el(r(nact)) with rule nact -> r(nact) at position [0] and matcher [ ]
3.50/1.71	
3.50/1.71	el(r(nact)) -> r(el(nact)) with rule el(r(x)) -> r(el(x)) at position [] and matcher [x / nact]
3.50/1.71	
3.50/1.71	Now an instance of the first term with Matcher [ ] occurs in the last term at position [0].
3.50/1.71	
3.50/1.71	Context: r([])
3.50/1.71	
3.50/1.71	Therefore, the relative TRS problem does not terminate.
3.50/1.71	----------------------------------------
3.50/1.71	
3.50/1.71	(2)
3.50/1.71	NO
3.50/1.77	EOF