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