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