YES(?,O(n^1))
0.16/0.22	YES(?,O(n^1))
0.16/0.22	
0.16/0.22	Problem:
0.16/0.22	 f(0()) -> cons(0())
0.16/0.22	 f(s(0())) -> f(p(s(0())))
0.16/0.22	 p(s(0())) -> 0()
0.16/0.22	
0.16/0.22	Proof:
0.16/0.22	 Bounds Processor:
0.16/0.22	  bound: 2
0.16/0.22	  enrichment: match
0.16/0.22	  automaton:
0.16/0.22	   final states: {5,4}
0.16/0.22	   transitions:
0.16/0.22	    01() -> 8*
0.16/0.22	    f1(12) -> 13*
0.16/0.22	    p1(11) -> 12*
0.16/0.22	    s1(10) -> 11*
0.16/0.22	    cons1(8) -> 9*
0.16/0.22	    02() -> 18*
0.16/0.22	    f0(2) -> 4*
0.16/0.22	    f0(1) -> 4*
0.16/0.22	    f0(3) -> 4*
0.16/0.22	    cons2(22) -> 23*
0.16/0.22	    00() -> 1*
0.16/0.22	    cons0(2) -> 2*
0.16/0.22	    cons0(1) -> 2*
0.16/0.22	    cons0(3) -> 2*
0.16/0.22	    s0(2) -> 3*
0.16/0.22	    s0(1) -> 3*
0.16/0.22	    s0(3) -> 3*
0.16/0.22	    p0(2) -> 5*
0.16/0.22	    p0(1) -> 5*
0.16/0.22	    p0(3) -> 5*
0.16/0.22	    8 -> 5,10
0.16/0.22	    9 -> 4*
0.16/0.22	    13 -> 4*
0.16/0.22	    18 -> 22,12
0.16/0.22	    23 -> 13,4
0.16/0.22	  problem:
0.16/0.22	   
0.16/0.22	  Qed
0.16/0.23	EOF