YES(?,O(n^1))
13.97/4.27	YES(?,O(n^1))
13.97/4.27	
13.97/4.27	We are left with following problem, upon which TcT provides the
13.97/4.27	certificate YES(?,O(n^1)).
13.97/4.27	
13.97/4.27	Strict Trs:
13.97/4.27	  { a(c(d(x))) -> c(x)
13.97/4.27	  , u(b(d(d(x)))) -> b(x)
13.97/4.27	  , v(a(a(x))) -> u(v(x))
13.97/4.27	  , v(a(c(x))) -> u(b(d(x)))
13.97/4.27	  , v(c(x)) -> b(x)
13.97/4.27	  , w(a(a(x))) -> u(w(x))
13.97/4.27	  , w(a(c(x))) -> u(b(d(x)))
13.97/4.27	  , w(c(x)) -> b(x) }
13.97/4.27	Obligation:
13.97/4.27	  runtime complexity
13.97/4.27	Answer:
13.97/4.27	  YES(?,O(n^1))
13.97/4.27	
13.97/4.27	The problem is match-bounded by 1. The enriched problem is
13.97/4.27	compatible with the following automaton.
13.97/4.27	{ a_0(2) -> 1
13.97/4.27	, c_0(2) -> 2
13.97/4.27	, c_1(2) -> 1
13.97/4.27	, d_0(2) -> 2
13.97/4.27	, u_0(2) -> 1
13.97/4.27	, b_0(2) -> 2
13.97/4.27	, b_1(2) -> 1
13.97/4.27	, v_0(2) -> 1
13.97/4.27	, w_0(2) -> 1 }
13.97/4.27	
13.97/4.27	Hurray, we answered YES(?,O(n^1))
13.97/4.28	EOF