YES(?,O(n^1))
0.16/0.21	YES(?,O(n^1))
0.16/0.21	
0.16/0.21	Problem:
0.16/0.21	 first(0(),X) -> nil()
0.16/0.21	 first(s(X),cons(Y)) -> cons(Y)
0.16/0.21	 from(X) -> cons(X)
0.16/0.21	
0.16/0.21	Proof:
0.16/0.21	 Bounds Processor:
0.16/0.21	  bound: 1
0.16/0.21	  enrichment: match
0.16/0.21	  automaton:
0.16/0.21	   final states: {7,9,8}
0.16/0.21	   transitions:
0.16/0.21	    cons1(7) -> 7*
0.16/0.21	    cons1(9) -> 7*
0.16/0.21	    cons1(8) -> 7*
0.16/0.21	    nil1() -> 7*
0.16/0.21	    first0(8,7) -> 7*
0.16/0.21	    first0(8,9) -> 7*
0.16/0.21	    first0(9,8) -> 7*
0.16/0.21	    first0(7,7) -> 7*
0.16/0.21	    first0(7,9) -> 7*
0.16/0.21	    first0(8,8) -> 7*
0.16/0.21	    first0(9,7) -> 7*
0.16/0.21	    first0(9,9) -> 7*
0.16/0.21	    first0(7,8) -> 7*
0.16/0.21	    00() -> 8*
0.16/0.21	    nil0() -> 7*
0.16/0.21	    s0(7) -> 9*
0.16/0.21	    s0(9) -> 9*
0.16/0.21	    s0(8) -> 9*
0.16/0.21	    cons0(7) -> 7*
0.16/0.21	    cons0(9) -> 7*
0.16/0.21	    cons0(8) -> 7*
0.16/0.21	    from0(7) -> 7*
0.16/0.21	    from0(9) -> 7*
0.16/0.21	    from0(8) -> 7*
0.16/0.21	  problem:
0.16/0.21	   
0.16/0.21	  Qed
0.16/0.21	EOF