----- Otter 3.2, August 2001 ----- The process was started by ??? on ???, Sun Nov 30 22:26:33 2003 The command was "otter". set(auto). dependent: set(auto1). dependent: set(process_input). dependent: clear(print_kept). dependent: clear(print_new_demod). dependent: clear(print_back_demod). dependent: clear(print_back_sub). dependent: set(control_memory). dependent: assign(max_mem, 12000). dependent: assign(pick_given_ratio, 4). dependent: assign(stats_level, 1). dependent: assign(max_seconds, 10800). clear(print_given). assign(max_seconds,20). assign(max_distinct_vars,3). assign(max_literals,1). include("booleanAx.txt"). ------- start included file booleanAx.txt------- include("1_2booleanAx.txt"). ------- start included file 1_2booleanAx.txt------- formula_list(usable). all x y (u(x,y)=u(y,x)). all x y z (u(x,u(y,z))=u(u(x,y),z)). end_of_list. -------> usable clausifies to: list(usable). 0 [] u(x,y)=u(y,x). 0 [] u(x,u(y,z))=u(u(x,y),z). end_of_list. ------- end included file 1_2booleanAx.txt------- include("3booleanAx.txt"). ------- start included file 3booleanAx.txt------- formula_list(usable). all x y (u(c(u(c(x),y)),c(u(c(x),c(y))))=x). end_of_list. -------> usable clausifies to: list(usable). 0 [] u(c(u(c(x),y)),c(u(c(x),c(y))))=x. end_of_list. ------- end included file 3booleanAx.txt------- ------- end included file booleanAx.txt------- include("iDef.txt"). ------- start included file iDef.txt------- formula_list(usable). all x y (i(x,y)<->u(x,y)=y). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(x,y)|u(x,y)=y. 0 [] i(x,y)|u(x,y)!=y. end_of_list. ------- end included file iDef.txt------- include("nDef.txt"). ------- start included file nDef.txt------- formula_list(usable). all x y (n(x,y)=c(u(c(x),c(y)))). end_of_list. -------> usable clausifies to: list(usable). 0 [] n(x,y)=c(u(c(x),c(y))). end_of_list. ------- end included file nDef.txt------- include("uzDef.txt"). ------- start included file uzDef.txt------- formula_list(usable). D=c(I). U=u(I,D). Z=c(U). end_of_list. -------> usable clausifies to: list(usable). 0 [] D=c(I). 0 [] U=u(I,D). 0 [] Z=c(U). end_of_list. ------- end included file uzDef.txt------- include("booleanLaws.txt"). ------- start included file booleanLaws.txt------- include("1To4booleanLaws.txt"). ------- start included file 1To4booleanLaws.txt------- formula_list(usable). all x y z (i(x,u(y,z))->i(n(x,c(z)),y)). all x y z (i(x,y)->i(u(z,x),u(z,y))). all x y (x=u(n(x,c(y)),n(x,y))). all x y i(n(x,y),y). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(x,u(y,z))|i(n(x,c(z)),y). 0 [] -i(x,y)|i(u(z,x),u(z,y)). 0 [] x=u(n(x,c(y)),n(x,y)). 0 [] i(n(x,y),y). end_of_list. ------- end included file 1To4booleanLaws.txt------- include("4To8booleanLaws.txt"). ------- start included file 4To8booleanLaws.txt------- formula_list(usable). all x y i(n(x,y),y). all x y z i(n(x,u(y,z)),u(y,n(x,z))). all x y (x=u(n(x,y),n(x,c(y)))). all x y z (i(x,y)->i(u(z,x),u(z,y))). all x y z (i(x,y)->i(n(z,x),n(z,y))). end_of_list. -------> usable clausifies to: list(usable). 0 [] i(n(x,y),y). 0 [] i(n(x,u(y,z)),u(y,n(x,z))). 0 [] x=u(n(x,y),n(x,c(y))). 0 [] -i(x,y)|i(u(z,x),u(z,y)). 0 [] -i(x,y)|i(n(z,x),n(z,y)). end_of_list. ------- end included file 4To8booleanLaws.txt------- include("9_10booleanLaws.txt"). ------- start included file 9_10booleanLaws.txt------- formula_list(usable). all x (u(x,Z)=x). all x y z (i(x,y)&i(y,z)->i(x,z)). end_of_list. -------> usable clausifies to: list(usable). 0 [] u(x,Z)=x. 0 [] -i(x,y)| -i(y,z)|i(x,z). end_of_list. ------- end included file 9_10booleanLaws.txt------- include("11booleanLaws.txt"). ------- start included file 11booleanLaws.txt------- formula_list(usable). all x y (c(n(x,y))=u(c(x),c(y))). all x y (c(u(x,y))=n(c(x),c(y))). end_of_list. -------> usable clausifies to: list(usable). 0 [] c(n(x,y))=u(c(x),c(y)). 0 [] c(u(x,y))=n(c(x),c(y)). end_of_list. ------- end included file 11booleanLaws.txt------- include("12booleanLaws.txt"). ------- start included file 12booleanLaws.txt------- formula_list(usable). all x y z (i(x,z)&i(y,z)->i(u(x,y),z)). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(x,z)| -i(y,z)|i(u(x,y),z). end_of_list. ------- end included file 12booleanLaws.txt------- include("13booleanLaws.txt"). ------- start included file 13booleanLaws.txt------- formula_list(usable). all x y (i(x,y)&i(y,x)->x=y). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(x,y)| -i(y,x)|x=y. end_of_list. ------- end included file 13booleanLaws.txt------- include("14booleanLaws.txt"). ------- start included file 14booleanLaws.txt------- formula_list(usable). c(D)=I. c(Z)=U. end_of_list. -------> usable clausifies to: list(usable). 0 [] c(D)=I. 0 [] c(Z)=U. end_of_list. ------- end included file 14booleanLaws.txt------- include("15_16booleanLaws.txt"). ------- start included file 15_16booleanLaws.txt------- formula_list(usable). all x (c(c(x))=x). all x y (u(x,y)=y->c(u(y,c(x)))=Z). all x y (c(u(y,c(x)))=Z->u(x,y)=y). end_of_list. -------> usable clausifies to: list(usable). 0 [] c(c(x))=x. 0 [] u(x,y)!=y|c(u(y,c(x)))=Z. 0 [] c(u(y,c(x)))!=Z|u(x,y)=y. end_of_list. ------- end included file 15_16booleanLaws.txt------- include("17To19booleanLaws.txt"). ------- start included file 17To19booleanLaws.txt------- formula_list(usable). all x (u(x,x)=x). all x y z (u(x,y)=y&u(y,z)=z->u(x,z)=z). -(all x y (u(x,y)=y->u(c(y),c(x))=c(x))). end_of_list. -------> usable clausifies to: list(usable). 0 [] u(x,x)=x. 0 [] u(x,y)!=y|u(y,z)!=z|u(x,z)=z. 0 [] u($c2,$c1)=$c1. 0 [] u(c($c1),c($c2))!=c($c2). end_of_list. ------- end included file 17To19booleanLaws.txt------- ------- end included file booleanLaws.txt------- SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3. This is a Horn set with equality. The strategy will be Knuth-Bendix and hyper_res, with positive clauses in sos and nonpositive clauses in usable. dependent: set(knuth_bendix). dependent: set(para_from). dependent: set(para_into). dependent: clear(para_from_right). dependent: clear(para_into_right). dependent: set(para_from_vars). dependent: set(eq_units_both_ways). dependent: set(dynamic_demod_all). dependent: set(dynamic_demod). dependent: set(order_eq). dependent: set(back_demod). dependent: set(lrpo). dependent: set(hyper_res). dependent: clear(order_hyper). ------------> process usable: ** KEPT (pick-wt=8): 1 [] -i(x,y)|u(x,y)=y. ** KEPT (pick-wt=8): 2 [] i(x,y)|u(x,y)!=y. ** KEPT (pick-wt=11): 3 [] -i(x,u(y,z))|i(n(x,c(z)),y). ** KEPT (pick-wt=10): 4 [] -i(x,y)|i(u(z,x),u(z,y)). Following clause subsumed by 4 during input processing: 0 [] -i(x,y)|i(u(z,x),u(z,y)). ** KEPT (pick-wt=10): 5 [] -i(x,y)|i(n(z,x),n(z,y)). ** KEPT (pick-wt=9): 6 [] -i(x,y)| -i(y,z)|i(x,z). ** KEPT (pick-wt=11): 7 [] -i(x,y)| -i(z,y)|i(u(x,z),y). ** KEPT (pick-wt=9): 8 [] -i(x,y)| -i(y,x)|x=y. ** KEPT (pick-wt=12): 9 [] u(x,y)!=y|c(u(y,c(x)))=Z. ** KEPT (pick-wt=12): 10 [] c(u(x,c(y)))!=Z|u(y,x)=x. ** KEPT (pick-wt=15): 11 [] u(x,y)!=y|u(y,z)!=z|u(x,z)=z. ** KEPT (pick-wt=8): 12 [] u(c($c1),c($c2))!=c($c2). ------------> process sos: ** KEPT (pick-wt=7): 13 [] u(x,y)=u(y,x). ** KEPT (pick-wt=11): 15 [copy,14,flip.1] u(u(x,y),z)=u(x,u(y,z)). ---> New Demodulator: 16 [new_demod,15] u(u(x,y),z)=u(x,u(y,z)). ** KEPT (pick-wt=14): 17 [] u(c(u(c(x),y)),c(u(c(x),c(y))))=x. ---> New Demodulator: 18 [new_demod,17] u(c(u(c(x),y)),c(u(c(x),c(y))))=x. ** KEPT (pick-wt=10): 20 [copy,19,flip.1] c(u(c(x),c(y)))=n(x,y). ---> New Demodulator: 21 [new_demod,20] c(u(c(x),c(y)))=n(x,y). ** KEPT (pick-wt=4): 23 [copy,22,flip.1] c(I)=D. ---> New Demodulator: 24 [new_demod,23] c(I)=D. ** KEPT (pick-wt=5): 26 [copy,25,flip.1] u(I,D)=U. ---> New Demodulator: 27 [new_demod,26] u(I,D)=U. ** KEPT (pick-wt=4): 29 [copy,28,flip.1] c(U)=Z. ---> New Demodulator: 30 [new_demod,29] c(U)=Z. ** KEPT (pick-wt=10): 32 [copy,31,flip.1] u(n(x,c(y)),n(x,y))=x. ---> New Demodulator: 33 [new_demod,32] u(n(x,c(y)),n(x,y))=x. ** KEPT (pick-wt=5): 34 [] i(n(x,y),y). Following clause subsumed by 34 during input processing: 0 [] i(n(x,y),y). ** KEPT (pick-wt=11): 35 [] i(n(x,u(y,z)),u(y,n(x,z))). ** KEPT (pick-wt=10): 37 [copy,36,flip.1] u(n(x,y),n(x,c(y)))=x. ---> New Demodulator: 38 [new_demod,37] u(n(x,y),n(x,c(y)))=x. ** KEPT (pick-wt=5): 39 [] u(x,Z)=x. ---> New Demodulator: 40 [new_demod,39] u(x,Z)=x. ** KEPT (pick-wt=10): 41 [] c(n(x,y))=u(c(x),c(y)). ---> New Demodulator: 42 [new_demod,41] c(n(x,y))=u(c(x),c(y)). ** KEPT (pick-wt=10): 43 [] c(u(x,y))=n(c(x),c(y)). ---> New Demodulator: 44 [new_demod,43] c(u(x,y))=n(c(x),c(y)). ** KEPT (pick-wt=4): 45 [] c(D)=I. ---> New Demodulator: 46 [new_demod,45] c(D)=I. ** KEPT (pick-wt=4): 47 [] c(Z)=U. ---> New Demodulator: 48 [new_demod,47] c(Z)=U. ** KEPT (pick-wt=5): 49 [] c(c(x))=x. ---> New Demodulator: 50 [new_demod,49] c(c(x))=x. ** KEPT (pick-wt=5): 51 [] u(x,x)=x. ---> New Demodulator: 52 [new_demod,51] u(x,x)=x. ** KEPT (pick-wt=5): 53 [] u($c2,$c1)=$c1. ---> New Demodulator: 54 [new_demod,53] u($c2,$c1)=$c1. Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] u(x,y)=u(y,x). >>>> Starting back demodulation with 16. >>>> Starting back demodulation with 18. >>>> Starting back demodulation with 21. >> back demodulating 17 with 21. >>>> Starting back demodulation with 24. >>>> Starting back demodulation with 27. >>>> Starting back demodulation with 30. >>>> Starting back demodulation with 33. >>>> Starting back demodulation with 38. >>>> Starting back demodulation with 40. >>>> Starting back demodulation with 42. >>>> Starting back demodulation with 44. >> back demodulating 20 with 44. >> back demodulating 10 with 44. >> back demodulating 9 with 44. >>>> Starting back demodulation with 46. >>>> Starting back demodulation with 48. >>>> Starting back demodulation with 50. >>>> Starting back demodulation with 52. >>>> Starting back demodulation with 54. Following clause subsumed by 55 during input processing: 0 [copy,55,flip.1] x=x. ======= end of input processing ======= =========== start of search =========== ----> UNIT CONFLICT at 0.06 sec ----> 348 [binary,346.1,56.1] $F. Length of proof is 12. Level of proof is 9. ---------------- PROOF ---------------- 2 [] i(x,y)|u(x,y)!=y. 3 [] -i(x,u(y,z))|i(n(x,c(z)),y). 4 [] -i(x,y)|i(u(z,x),u(z,y)). 6 [] -i(x,y)| -i(y,z)|i(x,z). 8 [] -i(x,y)| -i(y,x)|x=y. 12 [] u(c($c1),c($c2))!=c($c2). 13 [] u(x,y)=u(y,x). 36 [] x=u(n(x,y),n(x,c(y))). 37 [copy,36,flip.1] u(n(x,y),n(x,c(y)))=x. 40,39 [] u(x,Z)=x. 41 [] c(n(x,y))=u(c(x),c(y)). 50,49 [] c(c(x))=x. 53 [] u($c2,$c1)=$c1. 56 [para_from,13.1.1,12.1.1] u(c($c2),c($c1))!=c($c2). 73,72 [para_into,39.1.1,13.1.1] u(Z,x)=x. 104 [hyper,53,2] i($c2,$c1). 116 [hyper,72,2] i(Z,x). 123 [hyper,116,4,demod,40] i(x,u(x,y)). 155 [hyper,123,6,104] i($c2,u($c1,x)). 219 [para_into,155.1.2,13.1.1] i($c2,u(x,$c1)). 297 [hyper,219,3] i(n($c2,c($c1)),x). 326 [hyper,297,8,116,flip.1] n($c2,c($c1))=Z. 344 [para_from,326.1.1,37.1.1.1,demod,50,73] n($c2,$c1)=$c2. 346 [para_from,344.1.1,41.1.1.1,flip.1] u(c($c2),c($c1))=c($c2). 348 [binary,346.1,56.1] $F. ------------ end of proof ------------- Search stopped by max_proofs option. ============ end of search ============ -------------- statistics ------------- clauses given 54 clauses generated 1269 clauses kept 261 clauses forward subsumed 699 clauses back subsumed 21 Kbytes malloced 255 ----------- times (seconds) ----------- user CPU time 0.27 (0 hr, 0 min, 0 sec) system CPU time 0.00 (0 hr, 0 min, 0 sec) wall-clock time 0 (0 hr, 0 min, 0 sec) hyper_res time 0.00 para_into time 0.00 para_from time 0.00 for_sub time 0.00 back_sub time 0.00 conflict time 0.00 demod time 0.00 That finishes the proof of the theorem. Process 0 finished Sun Nov 30 22:26:33 2003