YES(?,O(n^1))
0.00/0.70	YES(?,O(n^1))
0.00/0.70	
0.00/0.70	We are left with following problem, upon which TcT provides the
0.00/0.70	certificate YES(?,O(n^1)).
0.00/0.70	
0.00/0.70	Strict Trs:
0.00/0.70	  { c(y) -> y
0.00/0.70	  , c(c(c(y))) -> c(c(a(y, 0())))
0.00/0.70	  , c(a(a(0(), x), y)) -> a(c(c(c(0()))), y) }
0.00/0.70	Obligation:
0.00/0.70	  innermost runtime complexity
0.00/0.70	Answer:
0.00/0.70	  YES(?,O(n^1))
0.00/0.70	
0.00/0.70	Arguments of following rules are not normal-forms:
0.00/0.70	
0.00/0.70	{ c(c(c(y))) -> c(c(a(y, 0()))) }
0.00/0.70	
0.00/0.70	All above mentioned rules can be savely removed.
0.00/0.70	
0.00/0.70	We are left with following problem, upon which TcT provides the
0.00/0.70	certificate YES(?,O(n^1)).
0.00/0.70	
0.00/0.70	Strict Trs:
0.00/0.70	  { c(y) -> y
0.00/0.70	  , c(a(a(0(), x), y)) -> a(c(c(c(0()))), y) }
0.00/0.70	Obligation:
0.00/0.70	  innermost runtime complexity
0.00/0.70	Answer:
0.00/0.70	  YES(?,O(n^1))
0.00/0.70	
0.00/0.70	The problem is match-bounded by 1. The enriched problem is
0.00/0.70	compatible with the following automaton.
0.00/0.70	{ c_0(2) -> 1
0.00/0.70	, c_0(3) -> 1
0.00/0.70	, c_1(5) -> 4
0.00/0.70	, c_1(6) -> 4
0.00/0.70	, c_1(6) -> 5
0.00/0.70	, c_1(7) -> 4
0.00/0.70	, c_1(7) -> 5
0.00/0.70	, c_1(7) -> 6
0.00/0.70	, a_0(2, 2) -> 1
0.00/0.70	, a_0(2, 2) -> 2
0.00/0.70	, a_0(2, 3) -> 1
0.00/0.70	, a_0(2, 3) -> 2
0.00/0.70	, a_0(3, 2) -> 1
0.00/0.70	, a_0(3, 2) -> 2
0.00/0.70	, a_0(3, 3) -> 1
0.00/0.70	, a_0(3, 3) -> 2
0.00/0.70	, a_1(4, 2) -> 1
0.00/0.70	, a_1(4, 3) -> 1
0.00/0.70	, 0_0() -> 1
0.00/0.70	, 0_0() -> 3
0.00/0.70	, 0_1() -> 4
0.00/0.70	, 0_1() -> 5
0.00/0.70	, 0_1() -> 6
0.00/0.70	, 0_1() -> 7 }
0.00/0.70	
0.00/0.70	Hurray, we answered YES(?,O(n^1))
0.00/0.71	EOF