3.23/1.52	WORST_CASE(Omega(n^1), O(n^1))
3.23/1.52	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
3.23/1.52	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.23/1.52	
3.23/1.52	
3.23/1.52	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).
3.23/1.52	
3.23/1.52	(0) CpxTRS
3.23/1.52	(1) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
3.23/1.52	(2) CpxTRS
3.23/1.52	    (3) CpxTrsMatchBoundsTAProof [FINISHED, 0 ms]
3.23/1.52	    (4) BOUNDS(1, n^1)
3.23/1.52	(5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
3.23/1.52	(6) TRS for Loop Detection
3.23/1.52	    (7) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
3.23/1.52	    (8) BEST
3.23/1.52	        (9) proven lower bound
3.23/1.52	            (10) LowerBoundPropagationProof [FINISHED, 0 ms]
3.23/1.52	            (11) BOUNDS(n^1, INF)
3.23/1.52	        (12) TRS for Loop Detection
3.23/1.52	
3.23/1.52	
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(0)
3.23/1.52	Obligation:
3.23/1.52	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).
3.23/1.52	
3.23/1.52	
3.23/1.52	The TRS R consists of the following rules:
3.23/1.52	
3.23/1.52	   g(f(x, y), z) -> f(x, g(y, z))
3.23/1.52	   g(h(x, y), z) -> g(x, f(y, z))
3.23/1.52	   g(x, h(y, z)) -> h(g(x, y), z)
3.23/1.52	
3.23/1.52	S is empty.
3.23/1.52	Rewrite Strategy: FULL
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(1) RelTrsToTrsProof (UPPER BOUND(ID))
3.23/1.52	transformed relative TRS to TRS
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(2)
3.23/1.52	Obligation:
3.23/1.52	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1).
3.23/1.52	
3.23/1.52	
3.23/1.52	The TRS R consists of the following rules:
3.23/1.52	
3.23/1.52	   g(f(x, y), z) -> f(x, g(y, z))
3.23/1.52	   g(h(x, y), z) -> g(x, f(y, z))
3.23/1.52	   g(x, h(y, z)) -> h(g(x, y), z)
3.23/1.52	
3.23/1.52	S is empty.
3.23/1.52	Rewrite Strategy: FULL
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(3) CpxTrsMatchBoundsTAProof (FINISHED)
3.23/1.52	A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 1. 
3.23/1.52	
3.23/1.52	The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by: 
3.23/1.52	final states : [1]
3.23/1.52	transitions: 
3.23/1.52	f0(0, 0) -> 0
3.23/1.52	h0(0, 0) -> 0
3.23/1.52	g0(0, 0) -> 1
3.23/1.52	g1(0, 0) -> 2
3.23/1.52	f1(0, 2) -> 1
3.23/1.52	f1(0, 0) -> 3
3.23/1.52	g1(0, 3) -> 1
3.23/1.52	g1(0, 0) -> 4
3.23/1.52	h1(4, 0) -> 1
3.23/1.52	g1(0, 3) -> 2
3.23/1.52	f1(0, 2) -> 2
3.23/1.52	f1(0, 2) -> 4
3.23/1.52	f1(0, 3) -> 3
3.23/1.52	g1(0, 3) -> 4
3.23/1.52	h1(4, 0) -> 2
3.23/1.52	h1(4, 0) -> 4
3.23/1.52	
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(4)
3.23/1.52	BOUNDS(1, n^1)
3.23/1.52	
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(5) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
3.23/1.52	Transformed a relative TRS into a decreasing-loop problem.
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(6)
3.23/1.52	Obligation:
3.23/1.52	Analyzing the following TRS for decreasing loops:
3.23/1.52	
3.23/1.52	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).
3.23/1.52	
3.23/1.52	
3.23/1.52	The TRS R consists of the following rules:
3.23/1.52	
3.23/1.52	   g(f(x, y), z) -> f(x, g(y, z))
3.23/1.52	   g(h(x, y), z) -> g(x, f(y, z))
3.23/1.52	   g(x, h(y, z)) -> h(g(x, y), z)
3.23/1.52	
3.23/1.52	S is empty.
3.23/1.52	Rewrite Strategy: FULL
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(7) DecreasingLoopProof (LOWER BOUND(ID))
3.23/1.52	The following loop(s) give(s) rise to the lower bound Omega(n^1):
3.23/1.52	
3.23/1.52	The rewrite sequence
3.23/1.52	
3.23/1.52	g(h(x, y), z) ->^+ g(x, f(y, z))
3.23/1.52	
3.23/1.52	gives rise to a decreasing loop by considering the right hand sides subterm at position [].
3.23/1.52	
3.23/1.52	The pumping substitution is [x / h(x, y)].
3.23/1.52	
3.23/1.52	The result substitution is [z / f(y, z)].
3.23/1.52	
3.23/1.52	
3.23/1.52	
3.23/1.52	
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(8)
3.23/1.52	Complex Obligation (BEST)
3.23/1.52	
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(9)
3.23/1.52	Obligation:
3.23/1.52	Proved the lower bound n^1 for the following obligation:
3.23/1.52	
3.23/1.52	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).
3.23/1.52	
3.23/1.52	
3.23/1.52	The TRS R consists of the following rules:
3.23/1.52	
3.23/1.52	   g(f(x, y), z) -> f(x, g(y, z))
3.23/1.52	   g(h(x, y), z) -> g(x, f(y, z))
3.23/1.52	   g(x, h(y, z)) -> h(g(x, y), z)
3.23/1.52	
3.23/1.52	S is empty.
3.23/1.52	Rewrite Strategy: FULL
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(10) LowerBoundPropagationProof (FINISHED)
3.23/1.52	Propagated lower bound.
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(11)
3.23/1.52	BOUNDS(n^1, INF)
3.23/1.52	
3.23/1.52	----------------------------------------
3.23/1.52	
3.23/1.52	(12)
3.23/1.52	Obligation:
3.23/1.52	Analyzing the following TRS for decreasing loops:
3.23/1.52	
3.23/1.52	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).
3.23/1.52	
3.23/1.52	
3.23/1.52	The TRS R consists of the following rules:
3.23/1.52	
3.23/1.52	   g(f(x, y), z) -> f(x, g(y, z))
3.23/1.52	   g(h(x, y), z) -> g(x, f(y, z))
3.23/1.52	   g(x, h(y, z)) -> h(g(x, y), z)
3.23/1.52	
3.23/1.52	S is empty.
3.23/1.52	Rewrite Strategy: FULL
3.31/1.56	EOF