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