YES(?,O(n^1))
0.00/0.16	YES(?,O(n^1))
0.00/0.16	
0.00/0.16	We are left with following problem, upon which TcT provides the
0.00/0.16	certificate YES(?,O(n^1)).
0.00/0.16	
0.00/0.16	Strict Trs: { a(b(x)) -> a(c(b(x))) }
0.00/0.16	Obligation:
0.00/0.16	  runtime complexity
0.00/0.16	Answer:
0.00/0.16	  YES(?,O(n^1))
0.00/0.16	
0.00/0.16	The input is overlay and right-linear. Switching to innermost
0.00/0.16	rewriting.
0.00/0.16	
0.00/0.16	We are left with following problem, upon which TcT provides the
0.00/0.16	certificate YES(?,O(n^1)).
0.00/0.16	
0.00/0.16	Strict Trs: { a(b(x)) -> a(c(b(x))) }
0.00/0.16	Obligation:
0.00/0.16	  innermost runtime complexity
0.00/0.16	Answer:
0.00/0.16	  YES(?,O(n^1))
0.00/0.16	
0.00/0.16	The problem is match-bounded by 1. The enriched problem is
0.00/0.16	compatible with the following automaton.
0.00/0.16	{ a_0(2) -> 1
0.00/0.16	, a_0(3) -> 1
0.00/0.16	, a_1(4) -> 1
0.00/0.16	, b_0(2) -> 2
0.00/0.16	, b_0(3) -> 2
0.00/0.16	, b_1(2) -> 5
0.00/0.16	, b_1(3) -> 5
0.00/0.16	, c_0(2) -> 3
0.00/0.16	, c_0(3) -> 3
0.00/0.16	, c_1(5) -> 4 }
0.00/0.16	
0.00/0.16	Hurray, we answered YES(?,O(n^1))
0.00/0.17	EOF