3.19/1.54	WORST_CASE(?, O(1))
3.19/1.55	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.19/1.55	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.19/1.55	
3.19/1.55	
3.19/1.55	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, 1).
3.19/1.55	
3.19/1.55	(0) CpxTRS
3.19/1.55	(1) NarrowingOnBasicTermsTerminatesProof [FINISHED, 0 ms]
3.19/1.55	(2) BOUNDS(1, 1)
3.19/1.55	
3.19/1.55	
3.19/1.55	----------------------------------------
3.19/1.55	
3.19/1.55	(0)
3.19/1.55	Obligation:
3.19/1.55	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, 1).
3.19/1.55	
3.19/1.55	
3.19/1.55	The TRS R consists of the following rules:
3.19/1.55	
3.19/1.55	   f(s(X), Y) -> h(s(f(h(Y), X)))
3.19/1.55	
3.19/1.55	S is empty.
3.19/1.55	Rewrite Strategy: FULL
3.19/1.55	----------------------------------------
3.19/1.55	
3.19/1.55	(1) NarrowingOnBasicTermsTerminatesProof (FINISHED)
3.19/1.55	Constant runtime complexity proven by termination of constructor-based narrowing.
3.19/1.55	
3.19/1.55	The maximal most general narrowing sequences give rise to the following rewrite sequences:
3.19/1.55	
3.19/1.55	f(s(x0), x1) ->^* h(s(f(h(x1), x0)))
3.19/1.55	
3.19/1.55	
3.19/1.55	
3.19/1.55	
3.19/1.55	----------------------------------------
3.19/1.55	
3.19/1.55	(2)
3.19/1.55	BOUNDS(1, 1)
3.19/1.59	EOF