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