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