----- Otter 3.2, August 2001 ----- The process was started by ??? on ???, Sun Nov 30 00:40:14 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). include("peirceanAx1.txt"). ------- start included file peirceanAx1.txt------- formula_list(usable). all x y z (k(u(x,y),z)=u(k(x,z),k(y,z))). end_of_list. -------> usable clausifies to: list(usable). 0 [] k(u(x,y),z)=u(k(x,z),k(y,z)). end_of_list. ------- end included file peirceanAx1.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("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("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("i.txt"). ------- start included file i.txt------- formula_list(usable). all x y (i(x,y)->i(r(x),r(y))). all x y (r(u(x,y))=u(r(x),r(y))). all x (r(c(x))=c(r(x))). all x y (r(n(x,y))=n(r(x),r(y))). all x (r(r(x))=x). all x y (r(d(x,y))=d(r(y),r(x))). all x y (r(k(x,y))=k(r(y),r(x))). r(I)=I. r(Z)=Z. r(U)=U. end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(x,y)|i(r(x),r(y)). 0 [] r(u(x,y))=u(r(x),r(y)). 0 [] r(c(x))=c(r(x)). 0 [] r(n(x,y))=n(r(x),r(y)). 0 [] r(r(x))=x. 0 [] r(d(x,y))=d(r(y),r(x)). 0 [] r(k(x,y))=k(r(y),r(x)). 0 [] r(I)=I. 0 [] r(Z)=Z. 0 [] r(U)=U. end_of_list. ------- end included file i.txt------- include("monotLaws.txt"). ------- start included file monotLaws.txt------- include("1To3monotLaws.txt"). ------- start included file 1To3monotLaws.txt------- formula_list(usable). all x y z (u(x,y)=y->u(k(z,x),k(z,y))=k(z,y)). all x y z (u(x,y)=y->u(c(u(z,y)),c(x))=c(x)). all x y z (u(x,y)=y->u(k(x,z),k(y,z))=k(y,z)). end_of_list. -------> usable clausifies to: list(usable). 0 [] u(x,y)!=y|u(k(z,x),k(z,y))=k(z,y). 0 [] u(x,y)!=y|u(c(u(z,y)),c(x))=c(x). 0 [] u(x,y)!=y|u(k(x,z),k(y,z))=k(y,z). end_of_list. ------- end included file 1To3monotLaws.txt------- include("4_5monotLaws.txt"). ------- start included file 4_5monotLaws.txt------- formula_list(usable). all x y w v i(k(n(x,w),n(y,v)),k(x,y)). all x y w v i(k(n(x,w),n(y,v)),k(w,v)). end_of_list. -------> usable clausifies to: list(usable). 0 [] i(k(n(x,w),n(y,v)),k(x,y)). 0 [] i(k(n(x,w),n(y,v)),k(w,v)). end_of_list. ------- end included file 4_5monotLaws.txt------- ------- end included file monotLaws.txt------- include("cycleLaw.txt"). ------- start included file cycleLaw.txt------- formula_list(usable). all x y z (u(k(r(x),c(u(c(z),k(x,y)))),c(y))=c(y)). all x (k(x,I)=x). all x (k(I,x)=x). end_of_list. -------> usable clausifies to: list(usable). 0 [] u(k(r(x),c(u(c(z),k(x,y)))),c(y))=c(y). 0 [] k(x,I)=x. 0 [] k(I,x)=x. end_of_list. ------- end included file cycleLaw.txt------- include("cycleLawsB.txt"). ------- start included file cycleLawsB.txt------- formula_list(usable). all x y z (n(y,k(x,n(z,c(k(r(x),y)))))=Z). -(all x y z v (n(k(x,z),y)=n(u(k(n(x,v),z),k(n(x,c(v)),z)),y))). end_of_list. -------> usable clausifies to: list(usable). 0 [] n(y,k(x,n(z,c(k(r(x),y)))))=Z. 0 [] n(k($c4,$c2),$c3)!=n(u(k(n($c4,$c1),$c2),k(n($c4,c($c1)),$c2)),$c3). end_of_list. ------- end included file cycleLawsB.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=10): 1 [] -i(x,y)|i(u(z,x),u(z,y)). ** KEPT (pick-wt=10): 2 [] -i(x,y)|i(n(z,x),n(z,y)). ** KEPT (pick-wt=9): 3 [] -i(x,y)| -i(y,z)|i(x,z). ** KEPT (pick-wt=12): 4 [] u(x,y)!=y|c(u(y,c(x)))=Z. ** KEPT (pick-wt=12): 5 [] c(u(x,c(y)))!=Z|u(y,x)=x. ** KEPT (pick-wt=8): 6 [] -i(x,y)|i(r(x),r(y)). ** KEPT (pick-wt=16): 7 [] u(x,y)!=y|u(k(z,x),k(z,y))=k(z,y). ** KEPT (pick-wt=15): 8 [] u(x,y)!=y|u(c(u(z,y)),c(x))=c(x). ** KEPT (pick-wt=16): 9 [] u(x,y)!=y|u(k(x,z),k(y,z))=k(y,z). ** KEPT (pick-wt=20): 11 [copy,10,flip.1] n(u(k(n($c4,$c1),$c2),k(n($c4,c($c1)),$c2)),$c3)!=n(k($c4,$c2),$c3). ------------> process sos: ** KEPT (pick-wt=13): 13 [copy,12,flip.1] u(k(x,y),k(z,y))=k(u(x,z),y). ---> New Demodulator: 14 [new_demod,13] u(k(x,y),k(z,y))=k(u(x,z),y). ** KEPT (pick-wt=10): 16 [copy,15,flip.1] c(u(c(x),c(y)))=n(x,y). ---> New Demodulator: 17 [new_demod,16] c(u(c(x),c(y)))=n(x,y). ** KEPT (pick-wt=5): 18 [] i(n(x,y),y). ** KEPT (pick-wt=11): 19 [] i(n(x,u(y,z)),u(y,n(x,z))). ** KEPT (pick-wt=10): 21 [copy,20,flip.1] u(n(x,y),n(x,c(y)))=x. ---> New Demodulator: 22 [new_demod,21] u(n(x,y),n(x,c(y)))=x. ** KEPT (pick-wt=5): 23 [] u(x,Z)=x. ---> New Demodulator: 24 [new_demod,23] u(x,Z)=x. ** KEPT (pick-wt=5): 25 [] c(c(x))=x. ---> New Demodulator: 26 [new_demod,25] c(c(x))=x. ** KEPT (pick-wt=10): 27 [] r(u(x,y))=u(r(x),r(y)). ---> New Demodulator: 28 [new_demod,27] r(u(x,y))=u(r(x),r(y)). ** KEPT (pick-wt=7): 29 [] r(c(x))=c(r(x)). ---> New Demodulator: 30 [new_demod,29] r(c(x))=c(r(x)). ** KEPT (pick-wt=10): 31 [] r(n(x,y))=n(r(x),r(y)). ---> New Demodulator: 32 [new_demod,31] r(n(x,y))=n(r(x),r(y)). ** KEPT (pick-wt=5): 33 [] r(r(x))=x. ---> New Demodulator: 34 [new_demod,33] r(r(x))=x. ** KEPT (pick-wt=10): 35 [] r(d(x,y))=d(r(y),r(x)). ---> New Demodulator: 36 [new_demod,35] r(d(x,y))=d(r(y),r(x)). ** KEPT (pick-wt=10): 37 [] r(k(x,y))=k(r(y),r(x)). ---> New Demodulator: 38 [new_demod,37] r(k(x,y))=k(r(y),r(x)). ** KEPT (pick-wt=4): 39 [] r(I)=I. ---> New Demodulator: 40 [new_demod,39] r(I)=I. ** KEPT (pick-wt=4): 41 [] r(Z)=Z. ---> New Demodulator: 42 [new_demod,41] r(Z)=Z. ** KEPT (pick-wt=4): 43 [] r(U)=U. ---> New Demodulator: 44 [new_demod,43] r(U)=U. ** KEPT (pick-wt=11): 45 [] i(k(n(x,y),n(z,u)),k(x,z)). ** KEPT (pick-wt=11): 46 [] i(k(n(x,y),n(z,u)),k(y,u)). ** KEPT (pick-wt=16): 47 [] u(k(r(x),c(u(c(y),k(x,z)))),c(z))=c(z). ---> New Demodulator: 48 [new_demod,47] u(k(r(x),c(u(c(y),k(x,z)))),c(z))=c(z). ** KEPT (pick-wt=5): 49 [] k(x,I)=x. ---> New Demodulator: 50 [new_demod,49] k(x,I)=x. ** KEPT (pick-wt=5): 51 [] k(I,x)=x. ---> New Demodulator: 52 [new_demod,51] k(I,x)=x. ** KEPT (pick-wt=13): 53 [] n(x,k(y,n(z,c(k(r(y),x)))))=Z. ---> New Demodulator: 54 [new_demod,53] n(x,k(y,n(z,c(k(r(y),x)))))=Z. >>>> Starting back demodulation with 14. >> back demodulating 11 with 14. >> back demodulating 9 with 14. >>>> Starting back demodulation with 17. >>>> Starting back demodulation with 22. >>>> Starting back demodulation with 24. >>>> Starting back demodulation with 26. >>>> Starting back demodulation with 28. >>>> Starting back demodulation with 30. >>>> Starting back demodulation with 32. >>>> Starting back demodulation with 34. >>>> Starting back demodulation with 36. >>>> Starting back demodulation with 38. >>>> Starting back demodulation with 40. >>>> Starting back demodulation with 42. >>>> Starting back demodulation with 44. >>>> 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] n(k($c4,$c2),$c3)!=n(k($c4,$c2),$c3). ======= end of input processing ======= =========== start of search =========== ----> UNIT CONFLICT at 0.03 sec ----> 81 [binary,80.1,55.1] $F. Length of proof is 6. Level of proof is 2. ---------------- PROOF ---------------- 10 [] n(k($c4,$c2),$c3)!=n(u(k(n($c4,$c1),$c2),k(n($c4,c($c1)),$c2)),$c3). 11 [copy,10,flip.1] n(u(k(n($c4,$c1),$c2),k(n($c4,c($c1)),$c2)),$c3)!=n(k($c4,$c2),$c3). 12 [] k(u(x,y),z)=u(k(x,z),k(y,z)). 14,13 [copy,12,flip.1] u(k(x,y),k(z,y))=k(u(x,z),y). 15 [] n(x,y)=c(u(c(x),c(y))). 16 [copy,15,flip.1] c(u(c(x),c(y)))=n(x,y). 20 [] x=u(n(x,y),n(x,c(y))). 22,21 [copy,20,flip.1] u(n(x,y),n(x,c(y)))=x. 55 [back_demod,11,demod,14,22] n(k($c4,$c2),$c3)!=n(k($c4,$c2),$c3). 80 [para_into,16.1.1,16.1.1] n(x,y)=n(x,y). 81 [binary,80.1,55.1] $F. ------------ end of proof ------------- Search stopped by max_proofs option. ============ end of search ============ -------------- statistics ------------- clauses given 6 clauses generated 27 clauses kept 56 clauses forward subsumed 9 clauses back subsumed 0 Kbytes malloced 159 ----------- 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 1 (0 hr, 0 min, 1 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 00:40:15 2003