%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : SWW439-1 : TPTP v8.1.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n006.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Jul 27 13:22:33 EDT 2022 % Result : Unknown 31.40s 31.68s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SWW439-1 : TPTP v8.1.0. Released v5.2.0. % 0.10/0.12 % Command : otter-tptp-script %s % 0.12/0.33 % Computer : n006.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Wed Jul 27 03:01:17 EDT 2022 % 0.12/0.33 % CPUTime : % 1.84/2.06 ----- Otter 3.3f, August 2004 ----- % 1.84/2.06 The process was started by sandbox2 on n006.cluster.edu, % 1.84/2.06 Wed Jul 27 03:01:17 2022 % 1.84/2.06 The command was "./otter". The process ID is 6630. % 1.84/2.06 % 1.84/2.06 set(prolog_style_variables). % 1.84/2.06 set(auto). % 1.84/2.06 dependent: set(auto1). % 1.84/2.06 dependent: set(process_input). % 1.84/2.06 dependent: clear(print_kept). % 1.84/2.06 dependent: clear(print_new_demod). % 1.84/2.06 dependent: clear(print_back_demod). % 1.84/2.06 dependent: clear(print_back_sub). % 1.84/2.06 dependent: set(control_memory). % 1.84/2.06 dependent: assign(max_mem, 12000). % 1.84/2.06 dependent: assign(pick_given_ratio, 4). % 1.84/2.06 dependent: assign(stats_level, 1). % 1.84/2.06 dependent: assign(max_seconds, 10800). % 1.84/2.06 clear(print_given). % 1.84/2.06 % 1.84/2.06 list(usable). % 1.84/2.06 0 [] A=A. % 1.84/2.06 0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)). % 1.84/2.06 0 [] sep(lseg(X,X),Sigma)=Sigma. % 1.84/2.06 0 [] -heap(sep(next(nil,Y),Sigma)). % 1.84/2.06 0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil. % 1.84/2.06 0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))). % 1.84/2.06 0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z. % 1.84/2.06 0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z. % 1.84/2.06 0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)). % 1.84/2.06 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)). % 1.84/2.06 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(next(Z,W),Sigma))))|heap(sep(lseg(X,Z),sep(next(Z,W),Sigma))). % 1.84/2.06 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(lseg(Z,W),Sigma))))|Z=W|heap(sep(lseg(X,Z),sep(lseg(Z,W),Sigma))). % 1.84/2.06 0 [] x6!=x11. % 1.84/2.06 0 [] x6!=x14. % 1.84/2.06 0 [] x3!=x8. % 1.84/2.06 0 [] x3!=x15. % 1.84/2.06 0 [] x7!=x8. % 1.84/2.06 0 [] x14!=x16. % 1.84/2.06 0 [] x8!=x11. % 1.84/2.06 0 [] x8!=x15. % 1.84/2.06 0 [] x1!=x14. % 1.84/2.06 0 [] x13!=x15. % 1.84/2.06 0 [] x10!=x11. % 1.84/2.06 0 [] x10!=x13. % 1.84/2.06 0 [] x5!=x16. % 1.84/2.06 0 [] x5!=x9. % 1.84/2.06 0 [] heap(sep(lseg(x13,x5),sep(lseg(x13,x2),sep(lseg(x10,x3),sep(lseg(x1,x10),sep(lseg(x4,x12),sep(lseg(x2,x15),sep(lseg(x2,x17),sep(lseg(x2,x16),sep(lseg(x12,x16),sep(lseg(x9,x14),sep(lseg(x7,x1),sep(lseg(x3,x9),sep(lseg(x6,x2),emp)))))))))))))). % 1.84/2.06 0 [] x1=x1| -heap(emp). % 1.84/2.06 end_of_list. % 1.84/2.06 % 1.84/2.06 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3. % 1.84/2.06 % 1.84/2.06 This ia a non-Horn set with equality. The strategy will be % 1.84/2.06 Knuth-Bendix, ordered hyper_res, factoring, and unit % 1.84/2.06 deletion, with positive clauses in sos and nonpositive % 1.84/2.06 clauses in usable. % 1.84/2.06 % 1.84/2.06 dependent: set(knuth_bendix). % 1.84/2.06 dependent: set(anl_eq). % 1.84/2.06 dependent: set(para_from). % 1.84/2.06 dependent: set(para_into). % 1.84/2.06 dependent: clear(para_from_right). % 1.84/2.06 dependent: clear(para_into_right). % 1.84/2.06 dependent: set(para_from_vars). % 1.84/2.06 dependent: set(eq_units_both_ways). % 1.84/2.06 dependent: set(dynamic_demod_all). % 1.84/2.06 dependent: set(dynamic_demod). % 1.84/2.06 dependent: set(order_eq). % 1.84/2.06 dependent: set(back_demod). % 1.84/2.06 dependent: set(lrpo). % 1.84/2.06 dependent: set(hyper_res). % 1.84/2.06 dependent: set(unit_deletion). % 1.84/2.06 dependent: set(factor). % 1.84/2.06 % 1.84/2.06 ------------> process usable: % 1.84/2.06 ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)). % 1.84/2.06 ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil. % 1.84/2.06 ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))). % 1.84/2.06 ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C. % 1.84/2.06 ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C. % 1.84/2.06 ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)). % 1.84/2.06 ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)). % 1.84/2.06 ** KEPT (pick-wt=24): 8 [] -heap(sep(lseg(A,B),sep(lseg(B,C),sep(next(C,D),E))))|heap(sep(lseg(A,C),sep(next(C,D),E))). % 1.84/2.06 ** KEPT (pick-wt=27): 9 [] -heap(sep(lseg(A,B),sep(lseg(B,C),sep(lseg(C,D),E))))|C=D|heap(sep(lseg(A,C),sep(lseg(C,D),E))). % 1.84/2.06 ** KEPT (pick-wt=3): 10 [] x6!=x11. % 1.84/2.06 ** KEPT (pick-wt=3): 11 [] x6!=x14. % 1.84/2.06 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] x8!=x3. % 1.84/2.06 ** KEPT (pick-wt=3): 14 [] x3!=x15. % 1.84/2.06 ** KEPT (pick-wt=3): 16 [copy,15,flip.1] x8!=x7. % 1.84/2.06 ** KEPT (pick-wt=3): 18 [copy,17,flip.1] x16!=x14. % 1.84/2.06 ** KEPT (pick-wt=3): 19 [] x8!=x11. % 1.84/2.06 ** KEPT (pick-wt=3): 20 [] x8!=x15. % 1.84/2.06 ** KEPT (pick-wt=3): 22 [copy,21,flip.1] x14!=x1. % 1.84/2.06 ** KEPT (pick-wt=3): 24 [copy,23,flip.1] x15!=x13. % 1.84/2.06 ** KEPT (pick-wt=3): 26 [copy,25,flip.1] x11!=x10. % 1.84/2.06 ** KEPT (pick-wt=3): 28 [copy,27,flip.1] x13!=x10. % 1.84/2.06 ** KEPT (pick-wt=3): 29 [] x5!=x16. % 1.84/2.06 ** KEPT (pick-wt=3): 31 [copy,30,flip.1] x9!=x5. % 1.84/2.06 ** KEPT (pick-wt=5): 32 [] x1=x1| -heap(emp). % 1.84/2.06 % 1.84/2.06 ------------> process sos: % 1.84/2.06 ** KEPT (pick-wt=3): 34 [] A=A. % 31.40/31.68 ** KEPT (pick-wt=11): 35 [] sep(A,sep(B,C))=sep(B,sep(A,C)). % 31.40/31.68 ** KEPT (pick-wt=7): 36 [] sep(lseg(A,A),B)=B. % 31.40/31.68 ---> New Demodulator: 37 [new_demod,36] sep(lseg(A,A),B)=B. % 31.40/31.68 ** KEPT (pick-wt=54): 38 [] heap(sep(lseg(x13,x5),sep(lseg(x13,x2),sep(lseg(x10,x3),sep(lseg(x1,x10),sep(lseg(x4,x12),sep(lseg(x2,x15),sep(lseg(x2,x17),sep(lseg(x2,x16),sep(lseg(x12,x16),sep(lseg(x9,x14),sep(lseg(x7,x1),sep(lseg(x3,x9),sep(lseg(x6,x2),emp)))))))))))))). % 31.40/31.68 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] A=A. % 31.40/31.68 34 back subsumes 32. % 31.40/31.68 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)). % 31.40/31.68 >>>> Starting back demodulation with 37. % 31.40/31.68 % 31.40/31.68 ======= end of input processing ======= % 31.40/31.68 % 31.40/31.68 =========== start of search =========== % 31.40/31.68 % 31.40/31.68 % 31.40/31.68 Resetting weight limit to 15. % 31.40/31.68 % 31.40/31.68 % 31.40/31.68 Resetting weight limit to 15. % 31.40/31.68 % 31.40/31.68 sos_size=491 % 31.40/31.68 % 31.40/31.68 % 31.40/31.68 Resetting weight limit to 12. % 31.40/31.68 % 31.40/31.68 % 31.40/31.68 Resetting weight limit to 12. % 31.40/31.68 % 31.40/31.68 sos_size=539 % 31.40/31.68 % 31.40/31.68 Search stopped in tp_alloc by max_mem option. % 31.40/31.68 % 31.40/31.68 Search stopped in tp_alloc by max_mem option. % 31.40/31.68 % 31.40/31.68 ============ end of search ============ % 31.40/31.68 % 31.40/31.68 -------------- statistics ------------- % 31.40/31.68 clauses given 613 % 31.40/31.68 clauses generated 1459091 % 31.40/31.68 clauses kept 641 % 31.40/31.68 clauses forward subsumed 999 % 31.40/31.68 clauses back subsumed 1 % 31.40/31.68 Kbytes malloced 11718 % 31.40/31.68 % 31.40/31.68 ----------- times (seconds) ----------- % 31.40/31.68 user CPU time 29.61 (0 hr, 0 min, 29 sec) % 31.40/31.68 system CPU time 0.01 (0 hr, 0 min, 0 sec) % 31.40/31.68 wall-clock time 31 (0 hr, 0 min, 31 sec) % 31.40/31.68 % 31.40/31.68 Process 6630 finished Wed Jul 27 03:01:48 2022 % 31.40/31.68 Otter interrupted % 31.40/31.68 PROOF NOT FOUND %------------------------------------------------------------------------------