%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : SWW404-1 : TPTP v8.1.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n015.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:31 EDT 2022 % Result : Unknown 19.53s 19.72s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SWW404-1 : TPTP v8.1.0. Released v5.2.0. % 0.03/0.11 % Command : otter-tptp-script %s % 0.11/0.31 % Computer : n015.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 300 % 0.11/0.31 % DateTime : Wed Jul 27 03:01:56 EDT 2022 % 0.11/0.31 % CPUTime : % 1.98/2.16 ----- Otter 3.3f, August 2004 ----- % 1.98/2.16 The process was started by sandbox2 on n015.cluster.edu, % 1.98/2.16 Wed Jul 27 03:01:56 2022 % 1.98/2.16 The command was "./otter". The process ID is 14926. % 1.98/2.16 % 1.98/2.16 set(prolog_style_variables). % 1.98/2.16 set(auto). % 1.98/2.16 dependent: set(auto1). % 1.98/2.16 dependent: set(process_input). % 1.98/2.16 dependent: clear(print_kept). % 1.98/2.16 dependent: clear(print_new_demod). % 1.98/2.16 dependent: clear(print_back_demod). % 1.98/2.16 dependent: clear(print_back_sub). % 1.98/2.16 dependent: set(control_memory). % 1.98/2.16 dependent: assign(max_mem, 12000). % 1.98/2.16 dependent: assign(pick_given_ratio, 4). % 1.98/2.16 dependent: assign(stats_level, 1). % 1.98/2.16 dependent: assign(max_seconds, 10800). % 1.98/2.16 clear(print_given). % 1.98/2.16 % 1.98/2.16 list(usable). % 1.98/2.16 0 [] A=A. % 1.98/2.16 0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)). % 1.98/2.16 0 [] sep(lseg(X,X),Sigma)=Sigma. % 1.98/2.16 0 [] -heap(sep(next(nil,Y),Sigma)). % 1.98/2.16 0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil. % 1.98/2.16 0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))). % 1.98/2.16 0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z. % 1.98/2.16 0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z. % 1.98/2.16 0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)). % 1.98/2.16 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)). % 1.98/2.16 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.98/2.16 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.98/2.16 0 [] nil!=x1. % 1.98/2.16 0 [] nil!=x2. % 1.98/2.16 0 [] nil!=x3. % 1.98/2.16 0 [] x1!=x2. % 1.98/2.16 0 [] x1!=x3. % 1.98/2.16 0 [] heap(sep(lseg(x2,x3),sep(next(x1,x2),sep(next(x3,x1),emp)))). % 1.98/2.16 0 [] x4=x3| -heap(sep(lseg(x4,x3),sep(next(x3,x4),emp))). % 1.98/2.16 end_of_list. % 1.98/2.16 % 1.98/2.16 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3. % 1.98/2.16 % 1.98/2.16 This ia a non-Horn set with equality. The strategy will be % 1.98/2.16 Knuth-Bendix, ordered hyper_res, factoring, and unit % 1.98/2.16 deletion, with positive clauses in sos and nonpositive % 1.98/2.16 clauses in usable. % 1.98/2.16 % 1.98/2.16 dependent: set(knuth_bendix). % 1.98/2.16 dependent: set(anl_eq). % 1.98/2.16 dependent: set(para_from). % 1.98/2.16 dependent: set(para_into). % 1.98/2.16 dependent: clear(para_from_right). % 1.98/2.16 dependent: clear(para_into_right). % 1.98/2.16 dependent: set(para_from_vars). % 1.98/2.16 dependent: set(eq_units_both_ways). % 1.98/2.16 dependent: set(dynamic_demod_all). % 1.98/2.16 dependent: set(dynamic_demod). % 1.98/2.16 dependent: set(order_eq). % 1.98/2.16 dependent: set(back_demod). % 1.98/2.16 dependent: set(lrpo). % 1.98/2.16 dependent: set(hyper_res). % 1.98/2.16 dependent: set(unit_deletion). % 1.98/2.16 dependent: set(factor). % 1.98/2.16 % 1.98/2.16 ------------> process usable: % 1.98/2.16 ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)). % 1.98/2.16 ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil. % 1.98/2.16 ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))). % 1.98/2.16 ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C. % 1.98/2.16 ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C. % 1.98/2.16 ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)). % 1.98/2.16 ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)). % 1.98/2.16 ** 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.98/2.16 ** 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.98/2.16 ** KEPT (pick-wt=3): 11 [copy,10,flip.1] x1!=nil. % 1.98/2.16 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] x2!=nil. % 1.98/2.16 ** KEPT (pick-wt=3): 15 [copy,14,flip.1] x3!=nil. % 1.98/2.16 ** KEPT (pick-wt=3): 17 [copy,16,flip.1] x2!=x1. % 1.98/2.16 ** KEPT (pick-wt=3): 19 [copy,18,flip.1] x3!=x1. % 1.98/2.16 ** KEPT (pick-wt=13): 20 [] x4=x3| -heap(sep(lseg(x4,x3),sep(next(x3,x4),emp))). % 1.98/2.16 % 1.98/2.16 ------------> process sos: % 1.98/2.16 ** KEPT (pick-wt=3): 22 [] A=A. % 1.98/2.16 ** KEPT (pick-wt=11): 23 [] sep(A,sep(B,C))=sep(B,sep(A,C)). % 1.98/2.16 ** KEPT (pick-wt=7): 24 [] sep(lseg(A,A),B)=B. % 1.98/2.16 ---> New Demodulator: 25 [new_demod,24] sep(lseg(A,A),B)=B. % 1.98/2.16 ** KEPT (pick-wt=14): 26 [] heap(sep(lseg(x2,x3),sep(next(x1,x2),sep(next(x3,x1),emp)))). % 1.98/2.16 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] A=A. % 1.98/2.16 Following clause subsumed by 23 during input processing: 0 [copy,23,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)). % 1.98/2.16 >>>> Starting back demodulation with 25. % 1.98/2.16 % 1.98/2.16 ======= end of input processing ======= % 1.98/2.16 % 1.98/2.16 =========== start of search =========== % 1.98/2.16 % 1.98/2.16 % 1.98/2.16 Resetting weight limit to 13. % 19.53/19.72 % 19.53/19.72 % 19.53/19.72 Resetting weight limit to 13. % 19.53/19.72 % 19.53/19.72 sos_size=479 % 19.53/19.72 % 19.53/19.72 % 19.53/19.72 Resetting weight limit to 12. % 19.53/19.72 % 19.53/19.72 % 19.53/19.72 Resetting weight limit to 12. % 19.53/19.72 % 19.53/19.72 sos_size=481 % 19.53/19.72 % 19.53/19.72 Search stopped because sos empty. % 19.53/19.72 % 19.53/19.72 % 19.53/19.72 Search stopped because sos empty. % 19.53/19.72 % 19.53/19.72 ============ end of search ============ % 19.53/19.72 % 19.53/19.72 -------------- statistics ------------- % 19.53/19.72 clauses given 552 % 19.53/19.72 clauses generated 779776 % 19.53/19.72 clauses kept 573 % 19.53/19.72 clauses forward subsumed 1180 % 19.53/19.72 clauses back subsumed 5 % 19.53/19.72 Kbytes malloced 7812 % 19.53/19.72 % 19.53/19.72 ----------- times (seconds) ----------- % 19.53/19.72 user CPU time 17.61 (0 hr, 0 min, 17 sec) % 19.53/19.72 system CPU time 0.01 (0 hr, 0 min, 0 sec) % 19.53/19.72 wall-clock time 20 (0 hr, 0 min, 20 sec) % 19.53/19.72 % 19.53/19.72 Process 14926 finished Wed Jul 27 03:02:16 2022 % 19.53/19.72 Otter interrupted % 19.53/19.72 PROOF NOT FOUND %------------------------------------------------------------------------------