----- Otter 3.2, August 2001 ----- The process was started by ??? on ???, Mon Dec 29 22:25:44 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_distinct_vars,3). assign(max_literals,2). assign(max_mem,10000). assign(max_weight,20). 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("peirceanAx0.txt"). ------- start included file peirceanAx0.txt------- formula_list(usable). all x y z (k(x,k(y,z))=k(k(x,y),z)). all x (r(r(x))=x). all x y (r(u(x,y))=u(r(x),r(y))). all x y (r(k(x,y))=k(r(y),r(x))). end_of_list. -------> usable clausifies to: list(usable). 0 [] k(x,k(y,z))=k(k(x,y),z). 0 [] r(r(x))=x. 0 [] r(u(x,y))=u(r(x),r(y)). 0 [] r(k(x,y))=k(r(y),r(x)). end_of_list. ------- end included file peirceanAx0.txt------- include("peirceanAx2.txt"). ------- start included file peirceanAx2.txt------- formula_list(usable). all x (k(x,I)=x). all x y (u(k(r(x),c(k(x,y))),c(y))=c(y)). end_of_list. -------> usable clausifies to: list(usable). 0 [] k(x,I)=x. 0 [] u(k(r(x),c(k(x,y))),c(y))=c(y). end_of_list. ------- end included file peirceanAx2.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("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("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("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("26_27booleanLaws.txt"). ------- start included file 26_27booleanLaws.txt------- formula_list(usable). all x y z (i(x,y)&i(x,z)->i(x,n(y,z))). all x y (i(n(x,y),x)&i(n(x,y),y)). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(x,y)| -i(x,z)|i(x,n(y,z)). 0 [] i(n(x,y),x). 0 [] i(n(x,y),y). end_of_list. ------- end included file 26_27booleanLaws.txt------- include("xxii.txt"). ------- start included file xxii.txt------- formula_list(usable). all x (i(x,I)->k(x,x)=x). all x (i(x,I)->r(x)=x). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(x,I)|k(x,x)=x. 0 [] -i(x,I)|r(x)=x. end_of_list. ------- end included file xxii.txt------- include("vii.txt"). ------- start included file vii.txt------- formula_list(usable). all x y z (i(x,y)->i(k(x,z),k(y,z))). all x y z (i(x,y)->i(k(z,x),k(z,y))). all x y z (i(x,y)->i(d(x,z),d(y,z))). all x y z (i(x,y)->i(d(z,x),d(z,y))). all x y (i(x,y)->i(r(x),r(y))). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(x,y)|i(k(x,z),k(y,z)). 0 [] -i(x,y)|i(k(z,x),k(z,y)). 0 [] -i(x,y)|i(d(x,z),d(y,z)). 0 [] -i(x,y)|i(d(z,x),d(z,y)). 0 [] -i(x,y)|i(r(x),r(y)). end_of_list. ------- end included file vii.txt------- include("viii.txt"). ------- start included file viii.txt------- formula_list(usable). all x y w v i(k(n(x,w),n(y,v)),n(k(x,y),k(w,v))). end_of_list. -------> usable clausifies to: list(usable). 0 [] i(k(n(x,w),n(y,v)),n(k(x,y),k(w,v))). end_of_list. ------- end included file viii.txt------- include("xv_a.txt"). ------- start included file xv_a.txt------- formula_list(usable). all x y z v w i(n(w,k(n(y,z),v)),n(w,u(k(n(y,z),n(v,x)),k(y,n(v,c(x)))))). all y v w i(n(k(y,v),w),k(n(y,k(w,r(v))),n(v,k(r(y),w)))). all y v w i(n(k(y,v),w),k(y,n(v,k(r(y),w)))). end_of_list. -------> usable clausifies to: list(usable). 0 [] i(n(w,k(n(y,z),v)),n(w,u(k(n(y,z),n(v,x)),k(y,n(v,c(x)))))). 0 [] i(n(k(y,v),w),k(n(y,k(w,r(v))),n(v,k(r(y),w)))). 0 [] i(n(k(y,v),w),k(y,n(v,k(r(y),w)))). end_of_list. ------- end included file xv_a.txt------- include("xxvii_a.txt"). ------- start included file xxvii_a.txt------- formula_list(usable). all x y z (i(k(r(x),x),I)->i(n(k(x,y),k(x,z)),k(x,n(y,z)))). all x y z (i(k(r(x),x),I)->k(x,n(y,z))=n(k(x,y),k(x,z))). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(k(r(x),x),I)|i(n(k(x,y),k(x,z)),k(x,n(y,z))). 0 [] -i(k(r(x),x),I)|k(x,n(y,z))=n(k(x,y),k(x,z)). end_of_list. ------- end included file xxvii_a.txt------- include("subIdBis_ghost.txt"). ------- start included file subIdBis_ghost.txt------- formula_list(usable). all x y z (i(x,I)&i(y,I)->i(n(k(x,z),k(y,z)),k(n(x,y),z))). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(x,I)| -i(y,I)|i(n(k(x,z),k(y,z)),k(n(x,y),z)). end_of_list. ------- end included file subIdBis_ghost.txt------- include("subId_a_ghost.txt"). ------- start included file subId_a_ghost.txt------- formula_list(usable). -(all x y z i(k(n(x,y),z),n(k(x,z),k(y,z)))). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(k(n($c3,$c2),$c1),n(k($c3,$c1),k($c2,$c1))). end_of_list. ------- end included file subId_a_ghost.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=9): 7 [] -i(x,y)| -i(y,x)|x=y. ** KEPT (pick-wt=11): 8 [] -i(x,y)| -i(x,z)|i(x,n(y,z)). ** KEPT (pick-wt=8): 9 [] -i(x,I)|k(x,x)=x. ** KEPT (pick-wt=7): 10 [] -i(x,I)|r(x)=x. ** KEPT (pick-wt=10): 11 [] -i(x,y)|i(k(x,z),k(y,z)). ** KEPT (pick-wt=10): 12 [] -i(x,y)|i(k(z,x),k(z,y)). ** KEPT (pick-wt=10): 13 [] -i(x,y)|i(d(x,z),d(y,z)). ** KEPT (pick-wt=10): 14 [] -i(x,y)|i(d(z,x),d(z,y)). ** KEPT (pick-wt=8): 15 [] -i(x,y)|i(r(x),r(y)). ** KEPT (pick-wt=19): 16 [] -i(k(r(x),x),I)|i(n(k(x,y),k(x,z)),k(x,n(y,z))). ** KEPT (pick-wt=19): 18 [copy,17,flip.2] -i(k(r(x),x),I)|n(k(x,y),k(x,z))=k(x,n(y,z)). ** KEPT (pick-wt=19): 19 [] -i(x,I)| -i(y,I)|i(n(k(x,z),k(y,z)),k(n(x,y),z)). ** KEPT (pick-wt=13): 20 [] -i(k(n($c3,$c2),$c1),n(k($c3,$c1),k($c2,$c1))). ------------> process sos: ** KEPT (pick-wt=7): 21 [] u(x,y)=u(y,x). ** KEPT (pick-wt=11): 23 [copy,22,flip.1] u(u(x,y),z)=u(x,u(y,z)). ---> New Demodulator: 24 [new_demod,23] u(u(x,y),z)=u(x,u(y,z)). ** KEPT (pick-wt=14): 25 [] u(c(u(c(x),y)),c(u(c(x),c(y))))=x. ---> New Demodulator: 26 [new_demod,25] u(c(u(c(x),y)),c(u(c(x),c(y))))=x. ** KEPT (pick-wt=11): 28 [copy,27,flip.1] k(k(x,y),z)=k(x,k(y,z)). ---> New Demodulator: 29 [new_demod,28] k(k(x,y),z)=k(x,k(y,z)). ** KEPT (pick-wt=5): 30 [] r(r(x))=x. ---> New Demodulator: 31 [new_demod,30] r(r(x))=x. ** KEPT (pick-wt=10): 32 [] r(u(x,y))=u(r(x),r(y)). ---> New Demodulator: 33 [new_demod,32] r(u(x,y))=u(r(x),r(y)). ** KEPT (pick-wt=10): 34 [] r(k(x,y))=k(r(y),r(x)). ---> New Demodulator: 35 [new_demod,34] r(k(x,y))=k(r(y),r(x)). ** KEPT (pick-wt=5): 36 [] k(x,I)=x. ---> New Demodulator: 37 [new_demod,36] k(x,I)=x. ** KEPT (pick-wt=13): 38 [] u(k(r(x),c(k(x,y))),c(y))=c(y). ---> New Demodulator: 39 [new_demod,38] u(k(r(x),c(k(x,y))),c(y))=c(y). ** KEPT (pick-wt=10): 41 [copy,40,flip.1] c(u(c(x),c(y)))=n(x,y). ---> New Demodulator: 42 [new_demod,41] c(u(c(x),c(y)))=n(x,y). ** KEPT (pick-wt=10): 44 [copy,43,flip.1] u(n(x,c(y)),n(x,y))=x. ---> New Demodulator: 45 [new_demod,44] u(n(x,c(y)),n(x,y))=x. ** KEPT (pick-wt=5): 46 [] i(n(x,y),y). Following clause subsumed by 46 during input processing: 0 [] i(n(x,y),y). ** KEPT (pick-wt=11): 47 [] i(n(x,u(y,z)),u(y,n(x,z))). ** KEPT (pick-wt=10): 49 [copy,48,flip.1] u(n(x,y),n(x,c(y)))=x. ---> New Demodulator: 50 [new_demod,49] u(n(x,y),n(x,c(y)))=x. ** KEPT (pick-wt=5): 51 [] u(x,Z)=x. ---> New Demodulator: 52 [new_demod,51] u(x,Z)=x. ** KEPT (pick-wt=5): 53 [] i(n(x,y),x). Following clause subsumed by 46 during input processing: 0 [] i(n(x,y),y). ** KEPT (pick-wt=15): 54 [] i(k(n(x,y),n(z,u)),n(k(x,z),k(y,u))). ** KEPT (pick-wt=24): 55 [] i(n(x,k(n(y,z),u)),n(x,u(k(n(y,z),n(u,v)),k(y,n(u,c(v)))))). ** KEPT (pick-wt=19): 56 [] i(n(k(x,y),z),k(n(x,k(z,r(y))),n(y,k(r(x),z)))). ** KEPT (pick-wt=14): 57 [] i(n(k(x,y),z),k(x,n(y,k(r(x),z)))). Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] u(x,y)=u(y,x). >>>> Starting back demodulation with 24. >>>> Starting back demodulation with 26. >>>> Starting back demodulation with 29. >>>> Starting back demodulation with 31. >>>> Starting back demodulation with 33. >>>> Starting back demodulation with 35. >>>> Starting back demodulation with 37. >>>> Starting back demodulation with 39. >>>> Starting back demodulation with 42. >> back demodulating 25 with 42. >>>> Starting back demodulation with 45. >>>> Starting back demodulation with 50. >>>> Starting back demodulation with 52. >>>> Starting back demodulation with 59. ======= end of input processing ======= =========== start of search =========== ----> UNIT CONFLICT at 0.09 sec ----> 552 [binary,551.1,20.1] $F. Length of proof is 5. Level of proof is 5. ---------------- PROOF ---------------- 2 [] i(x,y)|u(x,y)!=y. 4 [] -i(x,y)|i(u(z,x),u(z,y)). 7 [] -i(x,y)| -i(y,x)|x=y. 8 [] -i(x,y)| -i(x,z)|i(x,n(y,z)). 20 [] -i(k(n($c3,$c2),$c1),n(k($c3,$c1),k($c2,$c1))). 52,51 [] u(x,Z)=x. 53 [] i(n(x,y),x). 54 [] i(k(n(x,y),n(z,u)),n(k(x,z),k(y,u))). 101 [hyper,51,2] i(Z,Z). 117 [hyper,101,4,demod,52,52] i(x,x). 123 [hyper,117,8,117] i(x,n(x,x)). 202 [hyper,123,7,53] n(x,x)=x. 551 [para_into,54.1.1.2,202.1.1] i(k(n(x,y),z),n(k(x,z),k(y,z))). 552 [binary,551.1,20.1] $F. ------------ end of proof ------------- Search stopped by max_proofs option. ============ end of search ============ -------------- statistics ------------- clauses given 51 clauses generated 1418 clauses kept 474 clauses forward subsumed 772 clauses back subsumed 30 Kbytes malloced 415 ----------- times (seconds) ----------- user CPU time 0.29 (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 Mon Dec 29 22:25:44 2003