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