%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : SWW460-1 : TPTP v8.1.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n025.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:34 EDT 2022 % Result : Unknown 28.42s 28.61s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SWW460-1 : TPTP v8.1.0. Released v5.2.0. % 0.11/0.12 % Command : otter-tptp-script %s % 0.12/0.33 % Computer : n025.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:04:00 EDT 2022 % 0.12/0.33 % CPUTime : % 1.95/2.14 ----- Otter 3.3f, August 2004 ----- % 1.95/2.14 The process was started by sandbox2 on n025.cluster.edu, % 1.95/2.14 Wed Jul 27 03:04:00 2022 % 1.95/2.14 The command was "./otter". The process ID is 30845. % 1.95/2.14 % 1.95/2.14 set(prolog_style_variables). % 1.95/2.14 set(auto). % 1.95/2.14 dependent: set(auto1). % 1.95/2.14 dependent: set(process_input). % 1.95/2.14 dependent: clear(print_kept). % 1.95/2.14 dependent: clear(print_new_demod). % 1.95/2.14 dependent: clear(print_back_demod). % 1.95/2.14 dependent: clear(print_back_sub). % 1.95/2.14 dependent: set(control_memory). % 1.95/2.14 dependent: assign(max_mem, 12000). % 1.95/2.14 dependent: assign(pick_given_ratio, 4). % 1.95/2.14 dependent: assign(stats_level, 1). % 1.95/2.14 dependent: assign(max_seconds, 10800). % 1.95/2.14 clear(print_given). % 1.95/2.14 % 1.95/2.14 list(usable). % 1.95/2.14 0 [] A=A. % 1.95/2.14 0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)). % 1.95/2.14 0 [] sep(lseg(X,X),Sigma)=Sigma. % 1.95/2.14 0 [] -heap(sep(next(nil,Y),Sigma)). % 1.95/2.14 0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil. % 1.95/2.14 0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))). % 1.95/2.14 0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z. % 1.95/2.14 0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z. % 1.95/2.14 0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)). % 1.95/2.14 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)). % 1.95/2.14 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.95/2.14 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.95/2.14 0 [] heap(sep(next(x3,x4),sep(next(x8,x14),sep(next(x2,x11),sep(lseg(x5,x15),sep(next(x14,x1),sep(next(x12,x11),sep(next(x13,x1),sep(next(x9,x11),sep(next(x16,x14),sep(next(x1,x2),sep(lseg(x4,x15),sep(next(x7,x11),sep(next(x10,x6),sep(lseg(x6,x5),sep(next(x11,x1),sep(next(x15,x6),emp))))))))))))))))). % 1.95/2.14 0 [] -heap(sep(lseg(x13,x1),sep(lseg(x12,x11),sep(lseg(x8,x14),sep(lseg(x16,x14),sep(lseg(x3,x15),sep(lseg(x2,x11),sep(lseg(x9,x11),sep(lseg(x14,x1),sep(lseg(x15,x6),sep(lseg(x10,x15),sep(lseg(x7,x2),emp)))))))))))). % 1.95/2.14 end_of_list. % 1.95/2.14 % 1.95/2.14 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3. % 1.95/2.14 % 1.95/2.14 This ia a non-Horn set with equality. The strategy will be % 1.95/2.14 Knuth-Bendix, ordered hyper_res, factoring, and unit % 1.95/2.14 deletion, with positive clauses in sos and nonpositive % 1.95/2.14 clauses in usable. % 1.95/2.14 % 1.95/2.14 dependent: set(knuth_bendix). % 1.95/2.14 dependent: set(anl_eq). % 1.95/2.14 dependent: set(para_from). % 1.95/2.14 dependent: set(para_into). % 1.95/2.14 dependent: clear(para_from_right). % 1.95/2.14 dependent: clear(para_into_right). % 1.95/2.14 dependent: set(para_from_vars). % 1.95/2.14 dependent: set(eq_units_both_ways). % 1.95/2.14 dependent: set(dynamic_demod_all). % 1.95/2.14 dependent: set(dynamic_demod). % 1.95/2.14 dependent: set(order_eq). % 1.95/2.14 dependent: set(back_demod). % 1.95/2.14 dependent: set(lrpo). % 1.95/2.14 dependent: set(hyper_res). % 1.95/2.14 dependent: set(unit_deletion). % 1.95/2.14 dependent: set(factor). % 1.95/2.14 % 1.95/2.14 ------------> process usable: % 1.95/2.14 ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)). % 1.95/2.14 ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil. % 1.95/2.14 ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))). % 1.95/2.14 ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C. % 1.95/2.14 ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C. % 1.95/2.14 ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)). % 1.95/2.14 ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)). % 1.95/2.14 ** 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.95/2.14 ** 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.95/2.14 ** KEPT (pick-wt=46): 10 [] -heap(sep(lseg(x13,x1),sep(lseg(x12,x11),sep(lseg(x8,x14),sep(lseg(x16,x14),sep(lseg(x3,x15),sep(lseg(x2,x11),sep(lseg(x9,x11),sep(lseg(x14,x1),sep(lseg(x15,x6),sep(lseg(x10,x15),sep(lseg(x7,x2),emp)))))))))))). % 1.95/2.14 % 1.95/2.14 ------------> process sos: % 1.95/2.14 ** KEPT (pick-wt=3): 12 [] A=A. % 1.95/2.14 ** KEPT (pick-wt=11): 13 [] sep(A,sep(B,C))=sep(B,sep(A,C)). % 1.95/2.14 ** KEPT (pick-wt=7): 14 [] sep(lseg(A,A),B)=B. % 1.95/2.14 ---> New Demodulator: 15 [new_demod,14] sep(lseg(A,A),B)=B. % 1.95/2.14 ** KEPT (pick-wt=66): 16 [] heap(sep(next(x3,x4),sep(next(x8,x14),sep(next(x2,x11),sep(lseg(x5,x15),sep(next(x14,x1),sep(next(x12,x11),sep(next(x13,x1),sep(next(x9,x11),sep(next(x16,x14),sep(next(x1,x2),sep(lseg(x4,x15),sep(next(x7,x11),sep(next(x10,x6),sep(lseg(x6,x5),sep(next(x11,x1),sep(next(x15,x6),emp))))))))))))))))). % 28.42/28.61 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A. % 28.42/28.61 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)). % 28.42/28.61 >>>> Starting back demodulation with 15. % 28.42/28.61 % 28.42/28.61 ======= end of input processing ======= % 28.42/28.61 % 28.42/28.61 =========== start of search =========== % 28.42/28.61 % 28.42/28.61 % 28.42/28.61 Resetting weight limit to 16. % 28.42/28.61 % 28.42/28.61 % 28.42/28.61 Resetting weight limit to 16. % 28.42/28.61 % 28.42/28.61 sos_size=586 % 28.42/28.61 % 28.42/28.61 % 28.42/28.61 Resetting weight limit to 12. % 28.42/28.61 % 28.42/28.61 % 28.42/28.61 Resetting weight limit to 12. % 28.42/28.61 % 28.42/28.61 sos_size=685 % 28.42/28.61 % 28.42/28.61 Search stopped in tp_alloc by max_mem option. % 28.42/28.61 % 28.42/28.61 Search stopped in tp_alloc by max_mem option. % 28.42/28.61 % 28.42/28.61 ============ end of search ============ % 28.42/28.61 % 28.42/28.61 -------------- statistics ------------- % 28.42/28.61 clauses given 675 % 28.42/28.61 clauses generated 1481535 % 28.42/28.61 clauses kept 781 % 28.42/28.61 clauses forward subsumed 1377 % 28.42/28.61 clauses back subsumed 6 % 28.42/28.61 Kbytes malloced 11718 % 28.42/28.61 % 28.42/28.61 ----------- times (seconds) ----------- % 28.42/28.61 user CPU time 26.45 (0 hr, 0 min, 26 sec) % 28.42/28.61 system CPU time 0.01 (0 hr, 0 min, 0 sec) % 28.42/28.61 wall-clock time 28 (0 hr, 0 min, 28 sec) % 28.42/28.61 % 28.42/28.61 Process 30845 finished Wed Jul 27 03:04:28 2022 % 28.42/28.61 Otter interrupted % 28.42/28.61 PROOF NOT FOUND %------------------------------------------------------------------------------