YES(?,O(n^1)) 0.16/0.34 YES(?,O(n^1)) 0.16/0.34 0.16/0.34 Problem: 0.16/0.34 not(true()) -> false() 0.16/0.34 not(false()) -> true() 0.16/0.34 evenodd(x,0()) -> not(evenodd(x,s(0()))) 0.16/0.34 evenodd(0(),s(0())) -> false() 0.16/0.34 evenodd(s(x),s(0())) -> evenodd(x,0()) 0.16/0.34 0.16/0.34 Proof: 0.16/0.34 Bounds Processor: 0.16/0.34 bound: 3 0.16/0.34 enrichment: match 0.16/0.34 automaton: 0.16/0.34 final states: {6,5} 0.16/0.34 transitions: 0.16/0.34 false3() -> 6,18,9 0.16/0.34 evenodd1(3,7) -> 18,9,6 0.16/0.34 evenodd1(4,8) -> 9* 0.16/0.34 evenodd1(1,8) -> 9* 0.16/0.34 evenodd1(2,7) -> 18,9,6 0.16/0.34 evenodd1(3,8) -> 9* 0.16/0.34 evenodd1(4,7) -> 18,9,6 0.16/0.34 evenodd1(1,7) -> 18,9,6 0.16/0.34 evenodd1(2,8) -> 9* 0.16/0.34 true3() -> 9,6,18 0.16/0.34 01() -> 7* 0.16/0.34 false1() -> 18,9,6,5 0.16/0.34 not1(9) -> 6* 0.16/0.34 s1(7) -> 8* 0.16/0.34 true1() -> 5* 0.16/0.34 not2(18) -> 18,9,6 0.16/0.34 not0(2) -> 5* 0.16/0.34 not0(4) -> 5* 0.16/0.34 not0(1) -> 5* 0.16/0.34 not0(3) -> 5* 0.16/0.34 evenodd2(3,17) -> 18* 0.16/0.34 evenodd2(2,17) -> 18* 0.16/0.34 evenodd2(4,17) -> 18* 0.16/0.34 evenodd2(1,17) -> 18* 0.16/0.34 true0() -> 1* 0.16/0.34 s2(16) -> 17* 0.16/0.34 false0() -> 2* 0.16/0.34 02() -> 16* 0.16/0.34 evenodd0(3,1) -> 6* 0.16/0.34 evenodd0(3,3) -> 6* 0.16/0.34 evenodd0(4,2) -> 6* 0.16/0.34 evenodd0(4,4) -> 6* 0.16/0.34 evenodd0(1,2) -> 6* 0.16/0.34 evenodd0(1,4) -> 6* 0.16/0.34 evenodd0(2,1) -> 6* 0.16/0.34 evenodd0(2,3) -> 6* 0.16/0.34 evenodd0(3,2) -> 6* 0.16/0.34 evenodd0(3,4) -> 6* 0.16/0.34 evenodd0(4,1) -> 6* 0.16/0.34 evenodd0(4,3) -> 6* 0.16/0.34 evenodd0(1,1) -> 6* 0.16/0.34 evenodd0(1,3) -> 6* 0.16/0.34 evenodd0(2,2) -> 6* 0.16/0.34 evenodd0(2,4) -> 6* 0.16/0.34 true2() -> 18,9,6 0.16/0.34 00() -> 3* 0.16/0.34 false2() -> 6* 0.16/0.34 s0(2) -> 4* 0.16/0.34 s0(4) -> 4* 0.16/0.34 s0(1) -> 4* 0.16/0.34 s0(3) -> 4* 0.16/0.34 problem: 0.16/0.34 0.16/0.34 Qed 0.16/0.34 EOF