----- Otter 3.0.3d, Feb 1995 ----- The job was started by mccune on gyro, Tue Feb 28 16:07:53 1995 The command was "otter3". 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(process_input). dependent: set(lrpo). clear(print_kept). clear(print_new_demod). clear(print_back_demod). assign(pick_given_ratio,4). assign(max_weight,25). assign(max_mem,16000). set(output_sequent). set(hyper_res). set(para_from_units_only). set(para_into_units_only). set(unit_deletion). assign(change_limit_after,3). assign(new_max_weight,20). list(usable). 0 [] -> x=x. 0 [] p(A,A,B)=A, p(A,B,A)=A, p(B,A,A)=A, f(A)=A, g(A)=A -> . end_of_list. list(sos). 0 [] -> p(p(x,y,y),p(x,p(y,z,f(y)),g(y)),u)=y. end_of_list. ------------> process usable: ** KEPT (wt=3): 1 [] -> x=x. ** KEPT (wt=26): 2 [] p(A,A,B)=A, p(A,B,A)=A, p(B,A,A)=A, f(A)=A, g(A)=A -> . Following clause subsumed by 1 during input processing: 0 [copy,1,flip.1] -> x=x. ------------> process sos: ** KEPT (wt=17): 3 [] -> p(p(x,y,y),p(x,p(y,z,f(y)),g(y)),u)=y. ---> New Demodulator: 4 [new_demod,3] -> p(p(x,y,y),p(x,p(y,z,f(y)),g(y)),u)=y. >>>> Starting back demodulation with 4. ======= end of input processing ======= =========== start of search =========== given clause #1: (wt=17) 3 [] -> p(p(x,y,y),p(x,p(y,z,f(y)),g(y)),u)=y. given clause #2: (wt=25) 5 [para_into,3.1.1.2.2,3.1.1] -> p(p(x,p(y,z,z),p(y,z,z)),p(x,z,g(p(y,z,z))),u)=p(y,z,z). given clause #3: (wt=21) 7 [para_into,5.1.1.1.2,3.1.1,demod,4,4,4] -> p(p(x,y,y),p(x,p(z,p(y,u,f(y)),g(y)),g(y)),v)=y. reducing weight limit to 20. given clause #4: (wt=12) 9 [para_into,7.1.1.2,3.1.1] -> p(p(p(x,y,y),y,y),y,z)=y. given clause #5: (wt=6) 15 [para_into,9.1.1.1,9.1.1] -> p(x,x,y)=x. given clause #6: (wt=25) 11 [para_from,7.1.1,5.1.1.2.3.1,demod,8,8,8] -> p(p(x,y,y),p(x,p(z,p(u,p(y,v,f(y)),g(y)),g(y)),g(y)),w)=y. given clause #7: (wt=13) 18 [para_from,9.1.1,5.1.1.2.3.1,demod,10,10,10] -> p(p(x,y,y),p(x,y,g(y)),z)=y. given clause #8: (wt=7) 32 [para_into,18.1.1.1,18.1.1,demod,19,16,flip.1] -> p(x,y,g(y))=y. given clause #9: (wt=9) 42 [back_demod,22,demod,33,33] -> p(p(x,y,y),y,z)=y. given clause #10: (wt=11) 40 [para_into,18.1.1.2,3.1.1,demod,4,16,flip.1] -> p(x,p(y,z,f(y)),g(y))=y. given clause #11: (wt=20) 17 [back_demod,2,demod,16,unit_del,1] p(A,B,A)=A, p(B,A,A)=A, f(A)=A, g(A)=A -> . given clause #12: (wt=7) 44 [para_into,40.1.1,42.1.1] -> p(x,y,f(x))=x. given clause #13: (wt=6) 46 [para_into,44.1.1,42.1.1,flip.1] -> p(x,y,y)=y. given clause #14: (wt=4) 49 [para_into,46.1.1,44.1.1,flip.1] -> f(x)=x. given clause #15: (wt=4) 54 [back_demod,51,demod,53,unit_del,1] g(A)=A -> . given clause #16: (wt=6) 52 [back_demod,44,demod,50] -> p(x,y,x)=x. ----> UNIT CONFLICT at 0.28 sec ----> 57 [binary,55.1,54.1] -> . Length of proof is 18. Level of proof is 11. ---------------- PROOF ---------------- 1 [] -> x=x. 2 [] p(A,A,B)=A, p(A,B,A)=A, p(B,A,A)=A, f(A)=A, g(A)=A -> . 4,3 [] -> p(p(x,y,y),p(x,p(y,z,f(y)),g(y)),u)=y. 5 [para_into,3.1.1.2.2,3.1.1] -> p(p(x,p(y,z,z),p(y,z,z)),p(x,z,g(p(y,z,z))),u)=p(y,z,z). 7 [para_into,5.1.1.1.2,3.1.1,demod,4,4,4] -> p(p(x,y,y),p(x,p(z,p(y,u,f(y)),g(y)),g(y)),v)=y. 10,9 [para_into,7.1.1.2,3.1.1] -> p(p(p(x,y,y),y,y),y,z)=y. 16,15 [para_into,9.1.1.1,9.1.1] -> p(x,x,y)=x. 17 [back_demod,2,demod,16,unit_del,1] p(A,B,A)=A, p(B,A,A)=A, f(A)=A, g(A)=A -> . 19,18 [para_from,9.1.1,5.1.1.2.3.1,demod,10,10,10] -> p(p(x,y,y),p(x,y,g(y)),z)=y. 22 [para_from,15.1.1,7.1.1.2.2.2] -> p(p(x,y,y),p(x,p(z,y,g(y)),g(y)),u)=y. 33,32 [para_into,18.1.1.1,18.1.1,demod,19,16,flip.1] -> p(x,y,g(y))=y. 40 [para_into,18.1.1.2,3.1.1,demod,4,16,flip.1] -> p(x,p(y,z,f(y)),g(y))=y. 42 [back_demod,22,demod,33,33] -> p(p(x,y,y),y,z)=y. 44 [para_into,40.1.1,42.1.1] -> p(x,y,f(x))=x. 47,46 [para_into,44.1.1,42.1.1,flip.1] -> p(x,y,y)=y. 48 [back_demod,17,demod,47,unit_del,1] p(A,B,A)=A, f(A)=A, g(A)=A -> . 50,49 [para_into,46.1.1,44.1.1,flip.1] -> f(x)=x. 51 [back_demod,48,demod,50,unit_del,1] p(A,B,A)=A, g(A)=A -> . 53,52 [back_demod,44,demod,50] -> p(x,y,x)=x. 54 [back_demod,51,demod,53,unit_del,1] g(A)=A -> . 55 [para_into,52.1.1,32.1.1,flip.1] -> g(x)=x. 57 [binary,55.1,54.1] -> . ------------ end of proof ------------- Search stopped by max_proofs option. ============ end of search ============ -------------- statistics ------------- clauses given 16 clauses generated 154 hyper_res generated 0 para_from generated 70 para_into generated 84 demod & eval rewrites 176 clauses wt,lit,sk delete 61 tautologies deleted 0 clauses forward subsumed 89 (subsumed by sos) 0 unit deletions 4 factor simplifications 0 clauses kept 31 new demodulators 25 empty clauses 1 clauses back demodulated 23 clauses back subsumed 0 usable size 7 sos size 1 demodulators size 6 passive size 0 hot size 0 Kbytes malloced 159 ----------- times (seconds) ----------- user CPU time 0.29 (0 hr, 0 min, 0 sec) system CPU time 0.14 (0 hr, 0 min, 0 sec) wall-clock time 1 (0 hr, 0 min, 1 sec) input time 0.02 clausify time 0.00 process input 0.00 hyper_res time 0.00 para_into time 0.02 para_from time 0.03 pre_process time 0.19 renumber time 0.02 demod time 0.07 order equalities 0.00 unit deleletion 0.00 factor simplify 0.00 weigh cl time 0.02 sort lits time 0.00 forward subsume 0.01 delete cl time 0.00 keep cl time 0.03 print_cl time 0.00 conflict time 0.01 new demod time 0.03 post_process time 0.01 back demod time 0.01 back subsume 0.00 factor time 0.00 unindex time 0.00 The job finished Tue Feb 28 16:07:54 1995