YES(?,O(n^1))
24.92/9.52	YES(?,O(n^1))
24.92/9.52	
24.92/9.52	We are left with following problem, upon which TcT provides the
24.92/9.52	certificate YES(?,O(n^1)).
24.92/9.52	
24.92/9.52	Strict Trs:
24.92/9.52	  { f(f(x)) -> f(c(f(x)))
24.92/9.52	  , f(f(x)) -> f(d(f(x)))
24.92/9.52	  , g(c(x)) -> x
24.92/9.52	  , g(c(0())) -> g(d(1()))
24.92/9.52	  , g(c(1())) -> g(d(0()))
24.92/9.52	  , g(d(x)) -> x }
24.92/9.52	Obligation:
24.92/9.52	  derivational complexity
24.92/9.52	Answer:
24.92/9.52	  YES(?,O(n^1))
24.92/9.52	
24.92/9.52	The problem is match-bounded by 2. The enriched problem is
24.92/9.52	compatible with the following automaton.
24.92/9.52	{ f_0(1) -> 1
24.92/9.52	, f_1(1) -> 3
24.92/9.52	, f_1(2) -> 1
24.92/9.52	, f_1(2) -> 3
24.92/9.52	, f_2(2) -> 5
24.92/9.52	, f_2(4) -> 3
24.92/9.52	, c_0(1) -> 1
24.92/9.52	, c_1(3) -> 2
24.92/9.52	, c_2(5) -> 4
24.92/9.52	, d_0(1) -> 1
24.92/9.52	, d_1(3) -> 2
24.92/9.52	, d_1(7) -> 6
24.92/9.52	, d_2(5) -> 4
24.92/9.52	, g_0(1) -> 1
24.92/9.52	, g_1(6) -> 1
24.92/9.52	, 0_0() -> 1
24.92/9.52	, 0_1() -> 1
24.92/9.52	, 0_1() -> 7
24.92/9.52	, 1_0() -> 1
24.92/9.52	, 1_1() -> 1
24.92/9.52	, 1_1() -> 7 }
24.92/9.52	
24.92/9.52	Hurray, we answered YES(?,O(n^1))
24.92/9.54	EOF