YES(?,O(n^1))
0.00/0.38	YES(?,O(n^1))
0.00/0.38	
0.00/0.38	We are left with following problem, upon which TcT provides the
0.00/0.38	certificate YES(?,O(n^1)).
0.00/0.38	
0.00/0.38	Strict Trs:
0.00/0.38	  { f(X) -> if(X, c(), n__f(true()))
0.00/0.38	  , f(X) -> n__f(X)
0.00/0.38	  , if(true(), X, Y) -> X
0.00/0.38	  , if(false(), X, Y) -> activate(Y)
0.00/0.38	  , activate(X) -> X
0.00/0.38	  , activate(n__f(X)) -> f(X) }
0.00/0.38	Obligation:
0.00/0.38	  runtime complexity
0.00/0.38	Answer:
0.00/0.38	  YES(?,O(n^1))
0.00/0.38	
0.00/0.38	The input is overlay and right-linear. Switching to innermost
0.00/0.38	rewriting.
0.00/0.38	
0.00/0.38	We are left with following problem, upon which TcT provides the
0.00/0.38	certificate YES(?,O(n^1)).
0.00/0.38	
0.00/0.38	Strict Trs:
0.00/0.38	  { f(X) -> if(X, c(), n__f(true()))
0.00/0.38	  , f(X) -> n__f(X)
0.00/0.38	  , if(true(), X, Y) -> X
0.00/0.38	  , if(false(), X, Y) -> activate(Y)
0.00/0.38	  , activate(X) -> X
0.00/0.38	  , activate(n__f(X)) -> f(X) }
0.00/0.38	Obligation:
0.00/0.38	  innermost runtime complexity
0.00/0.38	Answer:
0.00/0.38	  YES(?,O(n^1))
0.00/0.38	
0.00/0.38	The problem is match-bounded by 3. The enriched problem is
0.00/0.38	compatible with the following automaton.
0.00/0.38	{ f_0(2) -> 1
0.00/0.38	, f_1(2) -> 1
0.00/0.38	, f_2(5) -> 1
0.00/0.38	, f_2(8) -> 1
0.00/0.38	, if_0(2, 2, 2) -> 1
0.00/0.38	, if_1(2, 3, 4) -> 1
0.00/0.38	, if_2(2, 6, 7) -> 1
0.00/0.38	, if_3(5, 9, 10) -> 1
0.00/0.38	, if_3(8, 9, 10) -> 1
0.00/0.38	, c_0() -> 1
0.00/0.38	, c_0() -> 2
0.00/0.38	, c_1() -> 1
0.00/0.38	, c_1() -> 3
0.00/0.38	, c_2() -> 1
0.00/0.38	, c_2() -> 6
0.00/0.38	, c_3() -> 1
0.00/0.38	, c_3() -> 9
0.00/0.38	, n__f_0(2) -> 1
0.00/0.38	, n__f_0(2) -> 2
0.00/0.38	, n__f_1(2) -> 1
0.00/0.38	, n__f_1(5) -> 1
0.00/0.38	, n__f_1(5) -> 4
0.00/0.38	, n__f_2(2) -> 1
0.00/0.38	, n__f_2(8) -> 1
0.00/0.38	, n__f_2(8) -> 7
0.00/0.38	, n__f_3(5) -> 1
0.00/0.38	, n__f_3(8) -> 1
0.00/0.38	, n__f_3(11) -> 10
0.00/0.38	, true_0() -> 1
0.00/0.38	, true_0() -> 2
0.00/0.38	, true_1() -> 5
0.00/0.38	, true_2() -> 8
0.00/0.38	, true_3() -> 11
0.00/0.38	, false_0() -> 1
0.00/0.38	, false_0() -> 2
0.00/0.38	, activate_0(2) -> 1
0.00/0.38	, activate_1(2) -> 1
0.00/0.38	, activate_1(4) -> 1
0.00/0.38	, activate_1(7) -> 1 }
0.00/0.38	
0.00/0.38	Hurray, we answered YES(?,O(n^1))
0.00/0.39	EOF