YES(?,O(n^1))
14.09/7.89	YES(?,O(n^1))
14.09/7.89	
14.09/7.89	We are left with following problem, upon which TcT provides the
14.09/7.89	certificate YES(?,O(n^1)).
14.09/7.89	
14.09/7.89	Strict Trs:
14.09/7.89	  { f(f(a(), x), a()) -> f(f(a(), f(a(), f(a(), a()))), x) }
14.09/7.89	Obligation:
14.09/7.89	  derivational complexity
14.09/7.89	Answer:
14.09/7.89	  YES(?,O(n^1))
14.09/7.89	
14.09/7.89	We uncurry the input using the following uncurry rules.
14.09/7.89	
14.09/7.89	  { f(a(), x_1) -> a_1(x_1)
14.09/7.89	  , f(a_1(x_1), x_2) -> a_2(x_1, x_2) }
14.09/7.89	
14.09/7.89	We are left with following problem, upon which TcT provides the
14.09/7.89	certificate YES(?,O(n^1)).
14.09/7.89	
14.09/7.89	Strict Trs: { a_2(x, a()) -> a_2(a_1(a_1(a())), x) }
14.09/7.89	Weak Trs:
14.09/7.89	  { f(a(), x_1) -> a_1(x_1)
14.09/7.89	  , f(a_1(x_1), x_2) -> a_2(x_1, x_2) }
14.09/7.89	Obligation:
14.09/7.89	  derivational complexity
14.09/7.89	Answer:
14.09/7.89	  YES(?,O(n^1))
14.09/7.89	
14.09/7.89	The problem is match-bounded by 1. The enriched problem is
14.09/7.89	compatible with the following automaton.
14.09/7.89	{ f_0(1, 1) -> 1
14.09/7.89	, a_2_0(1, 1) -> 1
14.09/7.89	, a_2_1(2, 1) -> 1
14.09/7.89	, a_2_1(2, 2) -> 1
14.09/7.89	, a_0() -> 1
14.09/7.89	, a_1() -> 4
14.09/7.89	, a_1_0(1) -> 1
14.09/7.89	, a_1_1(3) -> 2
14.09/7.89	, a_1_1(4) -> 3 }
14.09/7.89	
14.09/7.89	Hurray, we answered YES(?,O(n^1))
14.23/7.91	EOF