TSTP Solution File: SWW410-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWW410-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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 18.66s 18.83s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWW410-1 : TPTP v8.1.0. Released v5.2.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n004.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:55:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.93/2.10 ----- Otter 3.3f, August 2004 -----
% 1.93/2.10 The process was started by sandbox on n004.cluster.edu,
% 1.93/2.10 Wed Jul 27 02:55:36 2022
% 1.93/2.10 The command was "./otter". The process ID is 17876.
% 1.93/2.10
% 1.93/2.10 set(prolog_style_variables).
% 1.93/2.10 set(auto).
% 1.93/2.10 dependent: set(auto1).
% 1.93/2.10 dependent: set(process_input).
% 1.93/2.10 dependent: clear(print_kept).
% 1.93/2.10 dependent: clear(print_new_demod).
% 1.93/2.10 dependent: clear(print_back_demod).
% 1.93/2.10 dependent: clear(print_back_sub).
% 1.93/2.10 dependent: set(control_memory).
% 1.93/2.10 dependent: assign(max_mem, 12000).
% 1.93/2.10 dependent: assign(pick_given_ratio, 4).
% 1.93/2.10 dependent: assign(stats_level, 1).
% 1.93/2.10 dependent: assign(max_seconds, 10800).
% 1.93/2.10 clear(print_given).
% 1.93/2.10
% 1.93/2.10 list(usable).
% 1.93/2.10 0 [] A=A.
% 1.93/2.10 0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)).
% 1.93/2.10 0 [] sep(lseg(X,X),Sigma)=Sigma.
% 1.93/2.10 0 [] -heap(sep(next(nil,Y),Sigma)).
% 1.93/2.10 0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil.
% 1.93/2.10 0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))).
% 1.93/2.10 0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z.
% 1.93/2.10 0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z.
% 1.93/2.10 0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)).
% 1.93/2.10 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)).
% 1.93/2.10 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.93/2.10 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.93/2.10 0 [] nil!=x1.
% 1.93/2.10 0 [] nil!=x2.
% 1.93/2.10 0 [] x1!=x3.
% 1.93/2.10 0 [] x3!=x2.
% 1.93/2.10 0 [] heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))).
% 1.93/2.10 0 [] -heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))).
% 1.93/2.10 end_of_list.
% 1.93/2.10
% 1.93/2.10 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.93/2.10
% 1.93/2.10 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.10 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.10 deletion, with positive clauses in sos and nonpositive
% 1.93/2.10 clauses in usable.
% 1.93/2.10
% 1.93/2.10 dependent: set(knuth_bendix).
% 1.93/2.10 dependent: set(anl_eq).
% 1.93/2.10 dependent: set(para_from).
% 1.93/2.10 dependent: set(para_into).
% 1.93/2.10 dependent: clear(para_from_right).
% 1.93/2.10 dependent: clear(para_into_right).
% 1.93/2.10 dependent: set(para_from_vars).
% 1.93/2.10 dependent: set(eq_units_both_ways).
% 1.93/2.10 dependent: set(dynamic_demod_all).
% 1.93/2.10 dependent: set(dynamic_demod).
% 1.93/2.10 dependent: set(order_eq).
% 1.93/2.10 dependent: set(back_demod).
% 1.93/2.10 dependent: set(lrpo).
% 1.93/2.10 dependent: set(hyper_res).
% 1.93/2.10 dependent: set(unit_deletion).
% 1.93/2.10 dependent: set(factor).
% 1.93/2.10
% 1.93/2.10 ------------> process usable:
% 1.93/2.10 ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)).
% 1.93/2.10 ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil.
% 1.93/2.10 ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))).
% 1.93/2.10 ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C.
% 1.93/2.10 ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C.
% 1.93/2.10 ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 1.93/2.10 ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)).
% 1.93/2.10 ** 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.93/2.10 ** 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.93/2.10 ** KEPT (pick-wt=3): 11 [copy,10,flip.1] x1!=nil.
% 1.93/2.10 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] x2!=nil.
% 1.93/2.10 ** KEPT (pick-wt=3): 15 [copy,14,flip.1] x3!=x1.
% 1.93/2.10 ** KEPT (pick-wt=3): 16 [] x3!=x2.
% 1.93/2.10 ** KEPT (pick-wt=10): 17 [] -heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))).
% 1.93/2.10
% 1.93/2.10 ------------> process sos:
% 1.93/2.10 ** KEPT (pick-wt=3): 19 [] A=A.
% 1.93/2.10 ** KEPT (pick-wt=11): 20 [] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 1.93/2.10 ** KEPT (pick-wt=7): 21 [] sep(lseg(A,A),B)=B.
% 1.93/2.10 ---> New Demodulator: 22 [new_demod,21] sep(lseg(A,A),B)=B.
% 1.93/2.10 ** KEPT (pick-wt=14): 23 [] heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))).
% 1.93/2.10 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] A=A.
% 1.93/2.10 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 1.93/2.10 >>>> Starting back demodulation with 22.
% 1.93/2.10
% 1.93/2.10 ======= end of input processing =======
% 1.93/2.10
% 1.93/2.10 =========== start of search ===========
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Resetting weight limit to 14.
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Resetting weight limit to 14.
% 1.93/2.10
% 1.93/2.10 sos_size=470
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Resetting weight limit to 12.
% 18.66/18.83
% 18.66/18.83
% 18.66/18.83 Resetting weight limit to 12.
% 18.66/18.83
% 18.66/18.83 sos_size=498
% 18.66/18.83
% 18.66/18.83 Search stopped because sos empty.
% 18.66/18.83
% 18.66/18.83
% 18.66/18.83 Search stopped because sos empty.
% 18.66/18.83
% 18.66/18.83 ============ end of search ============
% 18.66/18.83
% 18.66/18.83 -------------- statistics -------------
% 18.66/18.83 clauses given 560
% 18.66/18.83 clauses generated 790131
% 18.66/18.83 clauses kept 579
% 18.66/18.83 clauses forward subsumed 1184
% 18.66/18.83 clauses back subsumed 4
% 18.66/18.83 Kbytes malloced 7812
% 18.66/18.83
% 18.66/18.83 ----------- times (seconds) -----------
% 18.66/18.83 user CPU time 16.83 (0 hr, 0 min, 16 sec)
% 18.66/18.83 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 18.66/18.83 wall-clock time 18 (0 hr, 0 min, 18 sec)
% 18.66/18.83
% 18.66/18.83 Process 17876 finished Wed Jul 27 02:55:54 2022
% 18.66/18.83 Otter interrupted
% 18.66/18.83 PROOF NOT FOUND
%------------------------------------------------------------------------------