YES(?,O(n^1))
0.16/0.27	YES(?,O(n^1))
0.16/0.27	
0.16/0.27	Problem:
0.16/0.27	 p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(b(x2),a(a(b(x1)))),p(x3,x0))
0.16/0.27	
0.16/0.27	Proof:
0.16/0.27	 Bounds Processor:
0.16/0.27	  bound: 1
0.16/0.27	  enrichment: match
0.16/0.27	  automaton:
0.16/0.27	   final states: {4}
0.16/0.27	   transitions:
0.16/0.27	    p1(4,4) -> 11*
0.16/0.27	    p1(15,21) -> 16*
0.16/0.27	    p1(11,4) -> 11*
0.16/0.27	    p1(12,21) -> 16*
0.16/0.27	    p1(15,14) -> 16*
0.16/0.27	    p1(16,11) -> 11,4
0.16/0.27	    b1(14) -> 19*
0.16/0.27	    b1(4) -> 15,12
0.16/0.27	    b1(21) -> 19*
0.16/0.27	    b1(16) -> 15*
0.16/0.27	    b1(11) -> 12*
0.16/0.27	    a1(20) -> 21*
0.16/0.27	    a1(12) -> 13*
0.16/0.27	    a1(19) -> 20*
0.16/0.27	    a1(13) -> 14*
0.16/0.27	    p0(4,4) -> 4*
0.16/0.27	    b0(4) -> 4*
0.16/0.27	    a0(4) -> 4*
0.16/0.27	  problem:
0.16/0.27	   
0.16/0.27	  Qed
0.16/0.28	EOF