YES(?,O(n^1))
0.00/0.47	YES(?,O(n^1))
0.00/0.47	
0.00/0.47	We are left with following problem, upon which TcT provides the
0.00/0.47	certificate YES(?,O(n^1)).
0.00/0.47	
0.00/0.47	Strict Trs:
0.00/0.47	  { ++(x, nil()) -> x
0.00/0.47	  , ++(++(x, y), z) -> ++(x, ++(y, z))
0.00/0.47	  , ++(nil(), y) -> y
0.00/0.47	  , ++(.(x, y), z) -> .(x, ++(y, z)) }
0.00/0.47	Obligation:
0.00/0.47	  innermost runtime complexity
0.00/0.47	Answer:
0.00/0.47	  YES(?,O(n^1))
0.00/0.47	
0.00/0.47	The problem is match-bounded by 1. The enriched problem is
0.00/0.47	compatible with the following automaton.
0.00/0.47	{ ++_0(2, 2) -> 1
0.00/0.47	, ++_1(2, 2) -> 3
0.00/0.47	, nil_0() -> 1
0.00/0.47	, nil_0() -> 2
0.00/0.47	, nil_0() -> 3
0.00/0.47	, ._0(2, 2) -> 1
0.00/0.47	, ._0(2, 2) -> 2
0.00/0.47	, ._0(2, 2) -> 3
0.00/0.47	, ._1(2, 3) -> 1
0.00/0.47	, ._1(2, 3) -> 3 }
0.00/0.47	
0.00/0.47	Hurray, we answered YES(?,O(n^1))
0.00/0.48	EOF