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