YES(?,O(n^1))
0.00/0.39	YES(?,O(n^1))
0.00/0.39	
0.00/0.39	We are left with following problem, upon which TcT provides the
0.00/0.39	certificate YES(?,O(n^1)).
0.00/0.39	
0.00/0.39	Strict Trs:
0.00/0.39	  { w(r(x)) -> r(w(x))
0.00/0.39	  , b(w(x)) -> w(b(x))
0.00/0.39	  , b(r(x)) -> r(b(x)) }
0.00/0.39	Obligation:
0.00/0.39	  innermost runtime complexity
0.00/0.39	Answer:
0.00/0.39	  YES(?,O(n^1))
0.00/0.39	
0.00/0.39	The problem is match-bounded by 1. The enriched problem is
0.00/0.39	compatible with the following automaton.
0.00/0.39	{ w_0(2) -> 1
0.00/0.39	, w_1(2) -> 3
0.00/0.39	, r_0(2) -> 2
0.00/0.39	, r_1(3) -> 1
0.00/0.39	, r_1(3) -> 3
0.00/0.39	, b_0(2) -> 1
0.00/0.39	, b_1(2) -> 3 }
0.00/0.39	
0.00/0.39	Hurray, we answered YES(?,O(n^1))
0.00/0.39	EOF