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