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