----- Otter 3.2, August 2001 ----- The process was started by ??? on ???, Sun Nov 30 22:12:10 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)))). 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($c3,$c2). 0 [] -i(u($c1,$c3),u($c1,$c2)). end_of_list. ------- end included file 4To8booleanLaws.txt------- ------- end included file booleanLaws.txt------- SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2. 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)). ** KEPT (pick-wt=7): 5 [] -i(u($c1,$c3),u($c1,$c2)). ------------> process sos: ** KEPT (pick-wt=7): 6 [] u(x,y)=u(y,x). ** KEPT (pick-wt=11): 8 [copy,7,flip.1] u(u(x,y),z)=u(x,u(y,z)). ---> New Demodulator: 9 [new_demod,8] u(u(x,y),z)=u(x,u(y,z)). ** KEPT (pick-wt=14): 10 [] u(c(u(c(x),y)),c(u(c(x),c(y))))=x. ---> New Demodulator: 11 [new_demod,10] u(c(u(c(x),y)),c(u(c(x),c(y))))=x. ** KEPT (pick-wt=10): 13 [copy,12,flip.1] c(u(c(x),c(y)))=n(x,y). ---> New Demodulator: 14 [new_demod,13] c(u(c(x),c(y)))=n(x,y). ** KEPT (pick-wt=4): 16 [copy,15,flip.1] c(I)=D. ---> New Demodulator: 17 [new_demod,16] c(I)=D. ** KEPT (pick-wt=5): 19 [copy,18,flip.1] u(I,D)=U. ---> New Demodulator: 20 [new_demod,19] u(I,D)=U. ** KEPT (pick-wt=4): 22 [copy,21,flip.1] c(U)=Z. ---> New Demodulator: 23 [new_demod,22] c(U)=Z. ** KEPT (pick-wt=10): 25 [copy,24,flip.1] u(n(x,c(y)),n(x,y))=x. ---> New Demodulator: 26 [new_demod,25] u(n(x,c(y)),n(x,y))=x. ** KEPT (pick-wt=5): 27 [] i(n(x,y),y). Following clause subsumed by 27 during input processing: 0 [] i(n(x,y),y). ** KEPT (pick-wt=11): 28 [] i(n(x,u(y,z)),u(y,n(x,z))). ** KEPT (pick-wt=10): 30 [copy,29,flip.1] u(n(x,y),n(x,c(y)))=x. ---> New Demodulator: 31 [new_demod,30] u(n(x,y),n(x,c(y)))=x. ** KEPT (pick-wt=3): 32 [] i($c3,$c2). Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] u(x,y)=u(y,x). >>>> Starting back demodulation with 9. >>>> Starting back demodulation with 11. >>>> Starting back demodulation with 14. >> back demodulating 10 with 14. >>>> Starting back demodulation with 17. >>>> Starting back demodulation with 20. >>>> Starting back demodulation with 23. >>>> Starting back demodulation with 26. >>>> Starting back demodulation with 31. >>>> Starting back demodulation with 34. ======= end of input processing ======= =========== start of search =========== ----> UNIT CONFLICT at 0.03 sec ----> 39 [binary,38.1,5.1] $F. Length of proof is 1. Level of proof is 1. ---------------- PROOF ---------------- 4 [] -i(x,y)|i(u(z,x),u(z,y)). 5 [] -i(u($c1,$c3),u($c1,$c2)). 32 [] i($c3,$c2). 38 [hyper,32,4] i(u(x,$c3),u(x,$c2)). 39 [binary,38.1,5.1] $F. ------------ end of proof ------------- Search stopped by max_proofs option. ============ end of search ============ -------------- statistics ------------- clauses given 2 clauses generated 11 clauses kept 22 clauses forward subsumed 4 clauses back subsumed 0 Kbytes malloced 127 ----------- times (seconds) ----------- user CPU time 0.23 (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:12:10 2003