%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : SWW456-1 : TPTP v8.1.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n009.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 22.07s 22.29s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SWW456-1 : TPTP v8.1.0. Released v5.2.0. % 0.13/0.14 % Command : otter-tptp-script %s % 0.13/0.35 % Computer : n009.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Wed Jul 27 03:03:06 EDT 2022 % 0.13/0.35 % CPUTime : % 1.69/1.87 ----- Otter 3.3f, August 2004 ----- % 1.69/1.87 The process was started by sandbox on n009.cluster.edu, % 1.69/1.87 Wed Jul 27 03:03:06 2022 % 1.69/1.87 The command was "./otter". The process ID is 20400. % 1.69/1.87 % 1.69/1.87 set(prolog_style_variables). % 1.69/1.87 set(auto). % 1.69/1.87 dependent: set(auto1). % 1.69/1.87 dependent: set(process_input). % 1.69/1.87 dependent: clear(print_kept). % 1.69/1.87 dependent: clear(print_new_demod). % 1.69/1.87 dependent: clear(print_back_demod). % 1.69/1.87 dependent: clear(print_back_sub). % 1.69/1.87 dependent: set(control_memory). % 1.69/1.87 dependent: assign(max_mem, 12000). % 1.69/1.87 dependent: assign(pick_given_ratio, 4). % 1.69/1.87 dependent: assign(stats_level, 1). % 1.69/1.87 dependent: assign(max_seconds, 10800). % 1.69/1.87 clear(print_given). % 1.69/1.87 % 1.69/1.87 list(usable). % 1.69/1.87 0 [] A=A. % 1.69/1.87 0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)). % 1.69/1.87 0 [] sep(lseg(X,X),Sigma)=Sigma. % 1.69/1.87 0 [] -heap(sep(next(nil,Y),Sigma)). % 1.69/1.87 0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil. % 1.69/1.87 0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))). % 1.69/1.87 0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z. % 1.69/1.87 0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z. % 1.69/1.87 0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)). % 1.69/1.87 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)). % 1.69/1.87 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.69/1.87 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.69/1.87 0 [] heap(sep(next(x11,x8),sep(next(x5,x13),sep(next(x10,x5),sep(next(x9,x7),sep(next(x7,x3),sep(next(x3,x10),sep(next(x12,x3),sep(next(x13,x9),sep(next(x6,x4),sep(lseg(x2,x5),sep(next(x14,x12),sep(next(x1,x3),sep(next(x8,x13),sep(lseg(x4,x12),emp))))))))))))))). % 1.69/1.87 0 [] -heap(sep(lseg(x1,x3),sep(lseg(x2,x5),sep(lseg(x14,x12),sep(lseg(x5,x13),sep(lseg(x6,x3),sep(lseg(x11,x8),sep(lseg(x8,x5),emp)))))))). % 1.69/1.87 end_of_list. % 1.69/1.87 % 1.69/1.87 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3. % 1.69/1.87 % 1.69/1.87 This ia a non-Horn set with equality. The strategy will be % 1.69/1.87 Knuth-Bendix, ordered hyper_res, factoring, and unit % 1.69/1.87 deletion, with positive clauses in sos and nonpositive % 1.69/1.87 clauses in usable. % 1.69/1.87 % 1.69/1.87 dependent: set(knuth_bendix). % 1.69/1.87 dependent: set(anl_eq). % 1.69/1.87 dependent: set(para_from). % 1.69/1.87 dependent: set(para_into). % 1.69/1.87 dependent: clear(para_from_right). % 1.69/1.87 dependent: clear(para_into_right). % 1.69/1.87 dependent: set(para_from_vars). % 1.69/1.87 dependent: set(eq_units_both_ways). % 1.69/1.87 dependent: set(dynamic_demod_all). % 1.69/1.87 dependent: set(dynamic_demod). % 1.69/1.87 dependent: set(order_eq). % 1.69/1.87 dependent: set(back_demod). % 1.69/1.87 dependent: set(lrpo). % 1.69/1.87 dependent: set(hyper_res). % 1.69/1.87 dependent: set(unit_deletion). % 1.69/1.87 dependent: set(factor). % 1.69/1.87 % 1.69/1.87 ------------> process usable: % 1.69/1.87 ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)). % 1.69/1.87 ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil. % 1.69/1.87 ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))). % 1.69/1.87 ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C. % 1.69/1.87 ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C. % 1.69/1.87 ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)). % 1.69/1.87 ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)). % 1.69/1.87 ** 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.69/1.87 ** 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.69/1.87 ** KEPT (pick-wt=30): 10 [] -heap(sep(lseg(x1,x3),sep(lseg(x2,x5),sep(lseg(x14,x12),sep(lseg(x5,x13),sep(lseg(x6,x3),sep(lseg(x11,x8),sep(lseg(x8,x5),emp)))))))). % 1.69/1.87 % 1.69/1.87 ------------> process sos: % 1.69/1.87 ** KEPT (pick-wt=3): 12 [] A=A. % 1.69/1.87 ** KEPT (pick-wt=11): 13 [] sep(A,sep(B,C))=sep(B,sep(A,C)). % 1.69/1.87 ** KEPT (pick-wt=7): 14 [] sep(lseg(A,A),B)=B. % 1.69/1.87 ---> New Demodulator: 15 [new_demod,14] sep(lseg(A,A),B)=B. % 1.69/1.87 ** KEPT (pick-wt=58): 16 [] heap(sep(next(x11,x8),sep(next(x5,x13),sep(next(x10,x5),sep(next(x9,x7),sep(next(x7,x3),sep(next(x3,x10),sep(next(x12,x3),sep(next(x13,x9),sep(next(x6,x4),sep(lseg(x2,x5),sep(next(x14,x12),sep(next(x1,x3),sep(next(x8,x13),sep(lseg(x4,x12),emp))))))))))))))). % 1.69/1.87 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A. % 1.69/1.87 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)). % 22.07/22.29 >>>> Starting back demodulation with 15. % 22.07/22.29 % 22.07/22.29 ======= end of input processing ======= % 22.07/22.29 % 22.07/22.29 =========== start of search =========== % 22.07/22.29 % 22.07/22.29 % 22.07/22.29 Resetting weight limit to 16. % 22.07/22.29 % 22.07/22.29 % 22.07/22.29 Resetting weight limit to 16. % 22.07/22.29 % 22.07/22.29 sos_size=522 % 22.07/22.29 % 22.07/22.29 % 22.07/22.29 Resetting weight limit to 12. % 22.07/22.29 % 22.07/22.29 % 22.07/22.29 Resetting weight limit to 12. % 22.07/22.29 % 22.07/22.29 sos_size=621 % 22.07/22.29 % 22.07/22.29 Search stopped in tp_alloc by max_mem option. % 22.07/22.29 % 22.07/22.29 Search stopped in tp_alloc by max_mem option. % 22.07/22.29 % 22.07/22.29 ============ end of search ============ % 22.07/22.29 % 22.07/22.29 -------------- statistics ------------- % 22.07/22.29 clauses given 637 % 22.07/22.29 clauses generated 1199555 % 22.07/22.29 clauses kept 724 % 22.07/22.29 clauses forward subsumed 1453 % 22.07/22.29 clauses back subsumed 10 % 22.07/22.29 Kbytes malloced 11718 % 22.07/22.29 % 22.07/22.29 ----------- times (seconds) ----------- % 22.07/22.29 user CPU time 20.41 (0 hr, 0 min, 20 sec) % 22.07/22.29 system CPU time 0.01 (0 hr, 0 min, 0 sec) % 22.07/22.29 wall-clock time 22 (0 hr, 0 min, 22 sec) % 22.07/22.29 % 22.07/22.29 Process 20400 finished Wed Jul 27 03:03:28 2022 % 22.07/22.29 Otter interrupted % 22.07/22.29 PROOF NOT FOUND %------------------------------------------------------------------------------