3.46/1.63	WORST_CASE(NON_POLY, ?)
3.46/1.64	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.46/1.64	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.46/1.64	
3.46/1.64	
3.46/1.64	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF).
3.46/1.64	
3.46/1.64	(0) CpxTRS
3.46/1.64	(1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
3.46/1.64	(2) TRS for Loop Detection
3.46/1.64	(3) InfiniteLowerBoundProof [FINISHED, 31 ms]
3.46/1.64	(4) BOUNDS(INF, INF)
3.46/1.64	
3.46/1.64	
3.46/1.64	----------------------------------------
3.46/1.64	
3.46/1.64	(0)
3.46/1.64	Obligation:
3.46/1.64	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF).
3.46/1.64	
3.46/1.64	
3.46/1.64	The TRS R consists of the following rules:
3.46/1.64	
3.46/1.64	   g(X) -> h(activate(X))
3.46/1.64	   c -> d
3.46/1.64	   h(n__d) -> g(n__c)
3.46/1.64	   d -> n__d
3.46/1.64	   c -> n__c
3.46/1.64	   activate(n__d) -> d
3.46/1.64	   activate(n__c) -> c
3.46/1.64	   activate(X) -> X
3.46/1.64	
3.46/1.64	S is empty.
3.46/1.64	Rewrite Strategy: FULL
3.46/1.64	----------------------------------------
3.46/1.64	
3.46/1.64	(1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
3.46/1.64	Transformed a relative TRS into a decreasing-loop problem.
3.46/1.64	----------------------------------------
3.46/1.64	
3.46/1.64	(2)
3.46/1.64	Obligation:
3.46/1.64	Analyzing the following TRS for decreasing loops:
3.46/1.64	
3.46/1.64	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF).
3.46/1.64	
3.46/1.64	
3.46/1.64	The TRS R consists of the following rules:
3.46/1.64	
3.46/1.64	   g(X) -> h(activate(X))
3.46/1.64	   c -> d
3.46/1.64	   h(n__d) -> g(n__c)
3.46/1.64	   d -> n__d
3.46/1.64	   c -> n__c
3.46/1.64	   activate(n__d) -> d
3.46/1.64	   activate(n__c) -> c
3.46/1.64	   activate(X) -> X
3.46/1.64	
3.46/1.64	S is empty.
3.46/1.64	Rewrite Strategy: FULL
3.46/1.64	----------------------------------------
3.46/1.64	
3.46/1.64	(3) InfiniteLowerBoundProof (FINISHED)
3.46/1.64	The following loop proves infinite runtime complexity:
3.46/1.64	
3.46/1.64	The rewrite sequence
3.46/1.64	
3.46/1.64	g(n__c) ->^+ g(n__c)
3.46/1.64	
3.46/1.64	gives rise to a decreasing loop by considering the right hand sides subterm at position [].
3.46/1.64	
3.46/1.64	The pumping substitution is [ ].
3.46/1.64	
3.46/1.64	The result substitution is [ ].
3.46/1.64	
3.46/1.64	
3.46/1.64	
3.46/1.64	
3.46/1.64	----------------------------------------
3.46/1.64	
3.46/1.64	(4)
3.46/1.64	BOUNDS(INF, INF)
3.46/1.67	EOF