TSTP Solution File: SWW425-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SWW425-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 13.13s 13.26s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWW425-1 : TPTP v8.1.0. Released v5.2.0.
% 0.04/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:53:45 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 2.02/2.19  ----- Otter 3.3f, August 2004 -----
% 2.02/2.19  The process was started by sandbox2 on n013.cluster.edu,
% 2.02/2.19  Wed Jul 27 02:53:45 2022
% 2.02/2.19  The command was "./otter".  The process ID is 5771.
% 2.02/2.19  
% 2.02/2.19  set(prolog_style_variables).
% 2.02/2.19  set(auto).
% 2.02/2.19     dependent: set(auto1).
% 2.02/2.19     dependent: set(process_input).
% 2.02/2.19     dependent: clear(print_kept).
% 2.02/2.19     dependent: clear(print_new_demod).
% 2.02/2.19     dependent: clear(print_back_demod).
% 2.02/2.19     dependent: clear(print_back_sub).
% 2.02/2.19     dependent: set(control_memory).
% 2.02/2.19     dependent: assign(max_mem, 12000).
% 2.02/2.19     dependent: assign(pick_given_ratio, 4).
% 2.02/2.19     dependent: assign(stats_level, 1).
% 2.02/2.19     dependent: assign(max_seconds, 10800).
% 2.02/2.19  clear(print_given).
% 2.02/2.19  
% 2.02/2.19  list(usable).
% 2.02/2.19  0 [] A=A.
% 2.02/2.19  0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)).
% 2.02/2.19  0 [] sep(lseg(X,X),Sigma)=Sigma.
% 2.02/2.19  0 [] -heap(sep(next(nil,Y),Sigma)).
% 2.02/2.19  0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil.
% 2.02/2.19  0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))).
% 2.02/2.19  0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z.
% 2.02/2.19  0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z.
% 2.02/2.19  0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)).
% 2.02/2.19  0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)).
% 2.02/2.19  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.02/2.19  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.02/2.19  0 [] x1!=x6.
% 2.02/2.19  0 [] x1!=x7.
% 2.02/2.19  0 [] x1!=x10.
% 2.02/2.19  0 [] x4!=x8.
% 2.02/2.19  0 [] x4!=x7.
% 2.02/2.19  0 [] x4!=x9.
% 2.02/2.19  0 [] x3!=x8.
% 2.02/2.19  0 [] x7!=x10.
% 2.02/2.19  0 [] x2!=x6.
% 2.02/2.19  0 [] x2!=x3.
% 2.02/2.19  0 [] x2!=x7.
% 2.02/2.19  0 [] heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))).
% 2.02/2.19  0 [] x1=x1| -heap(emp).
% 2.02/2.19  end_of_list.
% 2.02/2.19  
% 2.02/2.19  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.02/2.19  
% 2.02/2.19  This ia a non-Horn set with equality.  The strategy will be
% 2.02/2.19  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.02/2.19  deletion, with positive clauses in sos and nonpositive
% 2.02/2.19  clauses in usable.
% 2.02/2.19  
% 2.02/2.19     dependent: set(knuth_bendix).
% 2.02/2.19     dependent: set(anl_eq).
% 2.02/2.19     dependent: set(para_from).
% 2.02/2.19     dependent: set(para_into).
% 2.02/2.19     dependent: clear(para_from_right).
% 2.02/2.19     dependent: clear(para_into_right).
% 2.02/2.19     dependent: set(para_from_vars).
% 2.02/2.19     dependent: set(eq_units_both_ways).
% 2.02/2.19     dependent: set(dynamic_demod_all).
% 2.02/2.19     dependent: set(dynamic_demod).
% 2.02/2.19     dependent: set(order_eq).
% 2.02/2.19     dependent: set(back_demod).
% 2.02/2.19     dependent: set(lrpo).
% 2.02/2.19     dependent: set(hyper_res).
% 2.02/2.19     dependent: set(unit_deletion).
% 2.02/2.19     dependent: set(factor).
% 2.02/2.19  
% 2.02/2.19  ------------> process usable:
% 2.02/2.19  ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)).
% 2.02/2.19  ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil.
% 2.02/2.19  ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))).
% 2.02/2.19  ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C.
% 2.02/2.19  ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C.
% 2.02/2.19  ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 2.02/2.19  ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)).
% 2.02/2.19  ** 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.02/2.19  ** 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.02/2.19  ** KEPT (pick-wt=3): 11 [copy,10,flip.1] x6!=x1.
% 2.02/2.19  ** KEPT (pick-wt=3): 13 [copy,12,flip.1] x7!=x1.
% 2.02/2.19  ** KEPT (pick-wt=3): 15 [copy,14,flip.1] x10!=x1.
% 2.02/2.19  ** KEPT (pick-wt=3): 17 [copy,16,flip.1] x8!=x4.
% 2.02/2.19  ** KEPT (pick-wt=3): 19 [copy,18,flip.1] x7!=x4.
% 2.02/2.19  ** KEPT (pick-wt=3): 21 [copy,20,flip.1] x9!=x4.
% 2.02/2.19  ** KEPT (pick-wt=3): 23 [copy,22,flip.1] x8!=x3.
% 2.02/2.19  ** KEPT (pick-wt=3): 24 [] x7!=x10.
% 2.02/2.19  ** KEPT (pick-wt=3): 26 [copy,25,flip.1] x6!=x2.
% 2.02/2.19  ** KEPT (pick-wt=3): 28 [copy,27,flip.1] x3!=x2.
% 2.02/2.19  ** KEPT (pick-wt=3): 30 [copy,29,flip.1] x7!=x2.
% 2.02/2.19  ** KEPT (pick-wt=5): 31 [] x1=x1| -heap(emp).
% 2.02/2.19  
% 2.02/2.19  ------------> process sos:
% 2.02/2.19  ** KEPT (pick-wt=3): 33 [] A=A.
% 2.02/2.19  ** KEPT (pick-wt=11): 34 [] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 2.02/2.19  ** KEPT (pick-wt=7): 35 [] sep(lseg(A,A),B)=B.
% 2.02/2.19  ---> New Demodulator: 36 [new_demod,35] sep(lseg(A,A),B)=B.
% 2.02/2.19  ** KEPT (pick-wt=34): 37 [] heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))).
% 13.13/13.26    Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] A=A.
% 13.13/13.26  33 back subsumes 31.
% 13.13/13.26    Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 13.13/13.26  >>>> Starting back demodulation with 36.
% 13.13/13.26  
% 13.13/13.26  ======= end of input processing =======
% 13.13/13.26  
% 13.13/13.26  =========== start of search ===========
% 13.13/13.26  
% 13.13/13.26  
% 13.13/13.26  Resetting weight limit to 15.
% 13.13/13.26  
% 13.13/13.26  
% 13.13/13.26  Resetting weight limit to 15.
% 13.13/13.26  
% 13.13/13.26  sos_size=345
% 13.13/13.26  
% 13.13/13.26  
% 13.13/13.26  Resetting weight limit to 12.
% 13.13/13.26  
% 13.13/13.26  
% 13.13/13.26  Resetting weight limit to 12.
% 13.13/13.26  
% 13.13/13.26  sos_size=383
% 13.13/13.26  
% 13.13/13.26  Search stopped because sos empty.
% 13.13/13.26  
% 13.13/13.26  
% 13.13/13.26  Search stopped because sos empty.
% 13.13/13.26  
% 13.13/13.26  ============ end of search ============
% 13.13/13.26  
% 13.13/13.26  -------------- statistics -------------
% 13.13/13.26  clauses given                453
% 13.13/13.26  clauses generated         673645
% 13.13/13.26  clauses kept                 475
% 13.13/13.26  clauses forward subsumed     863
% 13.13/13.26  clauses back subsumed          1
% 13.13/13.26  Kbytes malloced             8789
% 13.13/13.26  
% 13.13/13.26  ----------- times (seconds) -----------
% 13.13/13.26  user CPU time         11.07          (0 hr, 0 min, 11 sec)
% 13.13/13.26  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 13.13/13.26  wall-clock time       13             (0 hr, 0 min, 13 sec)
% 13.13/13.26  
% 13.13/13.26  Process 5771 finished Wed Jul 27 02:53:58 2022
% 13.13/13.26  Otter interrupted
% 13.13/13.26  PROOF NOT FOUND
%------------------------------------------------------------------------------