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