----- Otter 3.2, August 2001 ----- The process was started by ??? on ???, Sat Nov 29 23:03:05 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,1). formula_list(usable). all x (x=x). end_of_list. -------> usable clausifies to: list(usable). 0 [] x=x. end_of_list. 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("x_a.txt"). ------- start included file x_a.txt------- formula_list(usable). all x y z i(n(k(x,z),c(k(y,z))),k(n(x,c(y)),z)). end_of_list. -------> usable clausifies to: list(usable). 0 [] i(n(k(x,z),c(k(y,z))),k(n(x,c(y)),z)). end_of_list. ------- end included file x_a.txt------- include("x_b.txt"). ------- start included file x_b.txt------- formula_list(usable). -(all x y z i(n(k(z,x),c(k(z,y))),k(z,n(x,c(y))))). end_of_list. -------> usable clausifies to: list(usable). 0 [] -i(n(k($c1,$c3),c(k($c1,$c2))),k($c1,n($c3,c($c2)))). end_of_list. ------- end included file x_b.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)|i(r(x),r(y)). ** KEPT (pick-wt=15): 2 [] -i(n(k($c1,$c3),c(k($c1,$c2))),k($c1,n($c3,c($c2)))). ------------> process sos: ** KEPT (pick-wt=3): 3 [] x=x. ** KEPT (pick-wt=10): 4 [] r(u(x,y))=u(r(x),r(y)). ---> New Demodulator: 5 [new_demod,4] r(u(x,y))=u(r(x),r(y)). ** KEPT (pick-wt=7): 6 [] r(c(x))=c(r(x)). ---> New Demodulator: 7 [new_demod,6] r(c(x))=c(r(x)). ** KEPT (pick-wt=10): 8 [] r(n(x,y))=n(r(x),r(y)). ---> New Demodulator: 9 [new_demod,8] r(n(x,y))=n(r(x),r(y)). ** KEPT (pick-wt=5): 10 [] r(r(x))=x. ---> New Demodulator: 11 [new_demod,10] r(r(x))=x. ** KEPT (pick-wt=10): 12 [] r(d(x,y))=d(r(y),r(x)). ---> New Demodulator: 13 [new_demod,12] r(d(x,y))=d(r(y),r(x)). ** KEPT (pick-wt=10): 14 [] r(k(x,y))=k(r(y),r(x)). ---> New Demodulator: 15 [new_demod,14] r(k(x,y))=k(r(y),r(x)). ** KEPT (pick-wt=4): 16 [] r(I)=I. ---> New Demodulator: 17 [new_demod,16] r(I)=I. ** KEPT (pick-wt=4): 18 [] r(Z)=Z. ---> New Demodulator: 19 [new_demod,18] r(Z)=Z. ** KEPT (pick-wt=4): 20 [] r(U)=U. ---> New Demodulator: 21 [new_demod,20] r(U)=U. ** KEPT (pick-wt=15): 22 [] i(n(k(x,y),c(k(z,y))),k(n(x,c(z)),y)). Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] x=x. >>>> Starting back demodulation with 5. >>>> Starting back demodulation with 7. >>>> Starting back demodulation with 9. >>>> Starting back demodulation with 11. >>>> Starting back demodulation with 13. >>>> Starting back demodulation with 15. >>>> Starting back demodulation with 17. >>>> Starting back demodulation with 19. >>>> Starting back demodulation with 21. ======= end of input processing ======= =========== start of search =========== ----> UNIT CONFLICT at 0.02 sec ----> 48 [binary,47.1,2.1] $F. Length of proof is 4. Level of proof is 4. ---------------- PROOF ---------------- 1 [] -i(x,y)|i(r(x),r(y)). 2 [] -i(n(k($c1,$c3),c(k($c1,$c2))),k($c1,n($c3,c($c2)))). 7,6 [] r(c(x))=c(r(x)). 9,8 [] r(n(x,y))=n(r(x),r(y)). 11,10 [] r(r(x))=x. 15,14 [] r(k(x,y))=k(r(y),r(x)). 22 [] i(n(k(x,y),c(k(z,y))),k(n(x,c(z)),y)). 23 [hyper,22,1,demod,9,15,7,15,15,9,7] i(n(k(r(x),r(y)),c(k(r(x),r(z)))),k(r(x),n(r(y),c(r(z))))). 27 [para_into,23.1.1.1.1,10.1.1,demod,11,11] i(n(k(x,r(y)),c(k(x,r(z)))),k(x,n(r(y),c(r(z))))). 39 [para_into,27.1.1.1.2,10.1.1,demod,11] i(n(k(x,y),c(k(x,r(z)))),k(x,n(y,c(r(z))))). 47 [para_into,39.1.1.2.1.2,10.1.1,demod,11] i(n(k(x,y),c(k(x,z))),k(x,n(y,c(z)))). 48 [binary,47.1,2.1] $F. ------------ end of proof ------------- Search stopped by max_proofs option. ============ end of search ============ -------------- statistics ------------- clauses given 14 clauses generated 155 clauses kept 38 clauses forward subsumed 67 clauses back subsumed 19 Kbytes malloced 127 ----------- times (seconds) ----------- user CPU time 0.22 (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 Sat Nov 29 23:03:05 2003