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(g(f(a()),h(a(),f(a())))) -> f(h(g(f(a()),a()),g(f(a()),f(a())))) 0.16/0.22 0.16/0.22 Proof: 0.16/0.22 Bounds Processor: 0.16/0.22 bound: 1 0.16/0.22 enrichment: match 0.16/0.22 automaton: 0.16/0.22 final states: {4,3,2,1} 0.16/0.22 transitions: 0.16/0.22 f1(12) -> 1* 0.16/0.22 f1(6) -> 10,8,7 0.16/0.22 h1(11,9) -> 12* 0.16/0.22 g1(8,7) -> 9* 0.16/0.22 g1(10,6) -> 11* 0.16/0.22 a1() -> 6* 0.16/0.22 f0(2) -> 1* 0.16/0.22 f0(4) -> 1* 0.16/0.22 f0(1) -> 1* 0.16/0.22 f0(3) -> 1* 0.16/0.22 g0(3,1) -> 2* 0.16/0.22 g0(3,3) -> 2* 0.16/0.22 g0(4,2) -> 2* 0.16/0.22 g0(4,4) -> 2* 0.16/0.22 g0(1,2) -> 2* 0.16/0.22 g0(1,4) -> 2* 0.16/0.22 g0(2,1) -> 2* 0.16/0.22 g0(2,3) -> 2* 0.16/0.22 g0(3,2) -> 2* 0.16/0.22 g0(3,4) -> 2* 0.16/0.22 g0(4,1) -> 2* 0.16/0.22 g0(4,3) -> 2* 0.16/0.22 g0(1,1) -> 2* 0.16/0.22 g0(1,3) -> 2* 0.16/0.22 g0(2,2) -> 2* 0.16/0.22 g0(2,4) -> 2* 0.16/0.22 a0() -> 3* 0.16/0.22 h0(3,1) -> 4* 0.16/0.22 h0(3,3) -> 4* 0.16/0.22 h0(4,2) -> 4* 0.16/0.22 h0(4,4) -> 4* 0.16/0.22 h0(1,2) -> 4* 0.16/0.22 h0(1,4) -> 4* 0.16/0.22 h0(2,1) -> 4* 0.16/0.22 h0(2,3) -> 4* 0.16/0.22 h0(3,2) -> 4* 0.16/0.22 h0(3,4) -> 4* 0.16/0.22 h0(4,1) -> 4* 0.16/0.22 h0(4,3) -> 4* 0.16/0.22 h0(1,1) -> 4* 0.16/0.22 h0(1,3) -> 4* 0.16/0.22 h0(2,2) -> 4* 0.16/0.22 h0(2,4) -> 4* 0.16/0.22 problem: 0.16/0.22 0.16/0.22 Qed 0.16/0.23 EOF