YES(?,O(n^1))
0.00/0.97	YES(?,O(n^1))
0.00/0.97	
0.00/0.97	We are left with following problem, upon which TcT provides the
0.00/0.97	certificate YES(?,O(n^1)).
0.00/0.97	
0.00/0.97	Strict Trs:
0.00/0.97	  { concat(leaf(), Y) -> Y
0.00/0.97	  , concat(cons(U, V), Y) -> cons(U, concat(V, Y))
0.00/0.97	  , lessleaves(X, leaf()) -> false()
0.00/0.97	  , lessleaves(leaf(), cons(W, Z)) -> true()
0.00/0.97	  , lessleaves(cons(U, V), cons(W, Z)) ->
0.00/0.97	    lessleaves(concat(U, V), concat(W, Z)) }
0.00/0.97	Obligation:
0.00/0.97	  runtime complexity
0.00/0.97	Answer:
0.00/0.97	  YES(?,O(n^1))
0.00/0.97	
0.00/0.97	The input is overlay and right-linear. Switching to innermost
0.00/0.97	rewriting.
0.00/0.97	
0.00/0.97	We are left with following problem, upon which TcT provides the
0.00/0.97	certificate YES(?,O(n^1)).
0.00/0.97	
0.00/0.97	Strict Trs:
0.00/0.97	  { concat(leaf(), Y) -> Y
0.00/0.97	  , concat(cons(U, V), Y) -> cons(U, concat(V, Y))
0.00/0.97	  , lessleaves(X, leaf()) -> false()
0.00/0.97	  , lessleaves(leaf(), cons(W, Z)) -> true()
0.00/0.97	  , lessleaves(cons(U, V), cons(W, Z)) ->
0.00/0.97	    lessleaves(concat(U, V), concat(W, Z)) }
0.00/0.97	Obligation:
0.00/0.97	  innermost runtime complexity
0.00/0.97	Answer:
0.00/0.97	  YES(?,O(n^1))
0.00/0.97	
0.00/0.97	The problem is match-bounded by 2. The enriched problem is
0.00/0.97	compatible with the following automaton.
0.00/0.97	{ concat_0(2, 2) -> 1
0.00/0.97	, concat_1(2, 2) -> 3
0.00/0.97	, concat_1(2, 2) -> 4
0.00/0.97	, concat_1(2, 2) -> 5
0.00/0.97	, concat_1(2, 3) -> 3
0.00/0.97	, concat_1(2, 3) -> 4
0.00/0.97	, concat_1(2, 3) -> 5
0.00/0.97	, concat_2(2, 3) -> 4
0.00/0.97	, concat_2(2, 3) -> 5
0.00/0.97	, leaf_0() -> 1
0.00/0.97	, leaf_0() -> 2
0.00/0.97	, leaf_0() -> 3
0.00/0.97	, leaf_0() -> 4
0.00/0.97	, leaf_0() -> 5
0.00/0.97	, cons_0(2, 2) -> 1
0.00/0.97	, cons_0(2, 2) -> 2
0.00/0.97	, cons_0(2, 2) -> 3
0.00/0.97	, cons_0(2, 2) -> 4
0.00/0.97	, cons_0(2, 2) -> 5
0.00/0.97	, cons_1(2, 3) -> 1
0.00/0.97	, cons_1(2, 3) -> 3
0.00/0.97	, cons_1(2, 3) -> 4
0.00/0.97	, cons_1(2, 3) -> 5
0.00/0.97	, lessleaves_0(2, 2) -> 1
0.00/0.97	, lessleaves_1(3, 3) -> 1
0.00/0.97	, lessleaves_2(4, 5) -> 1
0.00/0.97	, false_0() -> 1
0.00/0.97	, false_0() -> 2
0.00/0.97	, false_0() -> 3
0.00/0.97	, false_0() -> 4
0.00/0.97	, false_0() -> 5
0.00/0.97	, false_1() -> 1
0.00/0.97	, true_0() -> 1
0.00/0.97	, true_0() -> 2
0.00/0.97	, true_0() -> 3
0.00/0.97	, true_0() -> 4
0.00/0.97	, true_0() -> 5
0.00/0.97	, true_1() -> 1 }
0.00/0.97	
0.00/0.97	Hurray, we answered YES(?,O(n^1))
0.00/0.97	EOF