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