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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SWW435-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n024.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:33 EDT 2022

% Result   : Unknown 27.13s 27.39s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWW435-1 : TPTP v8.1.0. Released v5.2.0.
% 0.12/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 03:02:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.58/1.81  ----- Otter 3.3f, August 2004 -----
% 1.58/1.81  The process was started by sandbox2 on n024.cluster.edu,
% 1.58/1.81  Wed Jul 27 03:02:10 2022
% 1.58/1.81  The command was "./otter".  The process ID is 11626.
% 1.58/1.81  
% 1.58/1.81  set(prolog_style_variables).
% 1.58/1.81  set(auto).
% 1.58/1.81     dependent: set(auto1).
% 1.58/1.81     dependent: set(process_input).
% 1.58/1.81     dependent: clear(print_kept).
% 1.58/1.81     dependent: clear(print_new_demod).
% 1.58/1.81     dependent: clear(print_back_demod).
% 1.58/1.81     dependent: clear(print_back_sub).
% 1.58/1.81     dependent: set(control_memory).
% 1.58/1.81     dependent: assign(max_mem, 12000).
% 1.58/1.81     dependent: assign(pick_given_ratio, 4).
% 1.58/1.81     dependent: assign(stats_level, 1).
% 1.58/1.81     dependent: assign(max_seconds, 10800).
% 1.58/1.81  clear(print_given).
% 1.58/1.81  
% 1.58/1.81  list(usable).
% 1.58/1.81  0 [] A=A.
% 1.58/1.81  0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)).
% 1.58/1.81  0 [] sep(lseg(X,X),Sigma)=Sigma.
% 1.58/1.81  0 [] -heap(sep(next(nil,Y),Sigma)).
% 1.58/1.81  0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil.
% 1.58/1.81  0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))).
% 1.58/1.81  0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z.
% 1.58/1.81  0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z.
% 1.58/1.81  0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)).
% 1.58/1.81  0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)).
% 1.58/1.81  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.58/1.81  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.58/1.81  0 [] x6!=x11.
% 1.58/1.81  0 [] x11!=x14.
% 1.58/1.81  0 [] x3!=x8.
% 1.58/1.81  0 [] x3!=x7.
% 1.58/1.81  0 [] x2!=x8.
% 1.58/1.81  0 [] x1!=x11.
% 1.58/1.81  0 [] x4!=x13.
% 1.58/1.81  0 [] x10!=x11.
% 1.58/1.81  0 [] x5!=x12.
% 1.58/1.81  0 [] x5!=x15.
% 1.58/1.81  0 [] heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x12,x3),sep(lseg(x9,x11),sep(lseg(x13,x15),sep(lseg(x7,x9),sep(lseg(x7,x1),sep(lseg(x7,x11),sep(lseg(x3,x12),sep(lseg(x4,x12),sep(lseg(x6,x12),sep(lseg(x6,x4),emp))))))))))))).
% 1.58/1.81  0 [] x1=x1| -heap(emp).
% 1.58/1.81  end_of_list.
% 1.58/1.81  
% 1.58/1.81  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.58/1.81  
% 1.58/1.81  This ia a non-Horn set with equality.  The strategy will be
% 1.58/1.81  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.58/1.81  deletion, with positive clauses in sos and nonpositive
% 1.58/1.81  clauses in usable.
% 1.58/1.81  
% 1.58/1.81     dependent: set(knuth_bendix).
% 1.58/1.81     dependent: set(anl_eq).
% 1.58/1.81     dependent: set(para_from).
% 1.58/1.81     dependent: set(para_into).
% 1.58/1.81     dependent: clear(para_from_right).
% 1.58/1.81     dependent: clear(para_into_right).
% 1.58/1.81     dependent: set(para_from_vars).
% 1.58/1.81     dependent: set(eq_units_both_ways).
% 1.58/1.81     dependent: set(dynamic_demod_all).
% 1.58/1.81     dependent: set(dynamic_demod).
% 1.58/1.81     dependent: set(order_eq).
% 1.58/1.81     dependent: set(back_demod).
% 1.58/1.81     dependent: set(lrpo).
% 1.58/1.81     dependent: set(hyper_res).
% 1.58/1.81     dependent: set(unit_deletion).
% 1.58/1.81     dependent: set(factor).
% 1.58/1.81  
% 1.58/1.81  ------------> process usable:
% 1.58/1.81  ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)).
% 1.58/1.81  ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil.
% 1.58/1.81  ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))).
% 1.58/1.81  ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C.
% 1.58/1.81  ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C.
% 1.58/1.81  ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 1.58/1.81  ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)).
% 1.58/1.81  ** 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.58/1.81  ** 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.58/1.81  ** KEPT (pick-wt=3): 10 [] x6!=x11.
% 1.58/1.81  ** KEPT (pick-wt=3): 12 [copy,11,flip.1] x14!=x11.
% 1.58/1.81  ** KEPT (pick-wt=3): 14 [copy,13,flip.1] x8!=x3.
% 1.58/1.81  ** KEPT (pick-wt=3): 16 [copy,15,flip.1] x7!=x3.
% 1.58/1.81  ** KEPT (pick-wt=3): 18 [copy,17,flip.1] x8!=x2.
% 1.58/1.81  ** KEPT (pick-wt=3): 20 [copy,19,flip.1] x11!=x1.
% 1.58/1.81  ** KEPT (pick-wt=3): 21 [] x4!=x13.
% 1.58/1.81  ** KEPT (pick-wt=3): 23 [copy,22,flip.1] x11!=x10.
% 1.58/1.81  ** KEPT (pick-wt=3): 24 [] x5!=x12.
% 1.58/1.81  ** KEPT (pick-wt=3): 25 [] x5!=x15.
% 1.58/1.81  ** KEPT (pick-wt=5): 26 [] x1=x1| -heap(emp).
% 1.58/1.81  
% 1.58/1.81  ------------> process sos:
% 1.58/1.81  ** KEPT (pick-wt=3): 28 [] A=A.
% 1.58/1.81  ** KEPT (pick-wt=11): 29 [] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 1.58/1.81  ** KEPT (pick-wt=7): 30 [] sep(lseg(A,A),B)=B.
% 1.58/1.81  ---> New Demodulator: 31 [new_demod,30] sep(lseg(A,A),B)=B.
% 1.58/1.81  ** KEPT (pick-wt=50): 32 [] heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x12,x3),sep(lseg(x9,x11),sep(lseg(x13,x15),sep(lseg(x7,x9),sep(lseg(x7,x1),sep(lseg(x7,x11),sep(lseg(x3,x12),sep(lseg(x4,x12),sep(lseg(x6,x12),sep(lseg(x6,x4),emp))))))))))))).
% 27.13/27.39    Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] A=A.
% 27.13/27.39  28 back subsumes 26.
% 27.13/27.39    Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 27.13/27.39  >>>> Starting back demodulation with 31.
% 27.13/27.39  
% 27.13/27.39  ======= end of input processing =======
% 27.13/27.39  
% 27.13/27.39  =========== start of search ===========
% 27.13/27.39  
% 27.13/27.39  
% 27.13/27.39  Resetting weight limit to 15.
% 27.13/27.39  
% 27.13/27.39  
% 27.13/27.39  Resetting weight limit to 15.
% 27.13/27.39  
% 27.13/27.39  sos_size=461
% 27.13/27.39  
% 27.13/27.39  
% 27.13/27.39  Resetting weight limit to 12.
% 27.13/27.39  
% 27.13/27.39  
% 27.13/27.39  Resetting weight limit to 12.
% 27.13/27.39  
% 27.13/27.39  sos_size=498
% 27.13/27.39  
% 27.13/27.39  Search stopped because sos empty.
% 27.13/27.39  
% 27.13/27.39  
% 27.13/27.39  Search stopped because sos empty.
% 27.13/27.39  
% 27.13/27.39  ============ end of search ============
% 27.13/27.39  
% 27.13/27.39  -------------- statistics -------------
% 27.13/27.39  clauses given                560
% 27.13/27.39  clauses generated        1274902
% 27.13/27.39  clauses kept                 581
% 27.13/27.39  clauses forward subsumed     799
% 27.13/27.39  clauses back subsumed          1
% 27.13/27.39  Kbytes malloced            10742
% 27.13/27.39  
% 27.13/27.39  ----------- times (seconds) -----------
% 27.13/27.39  user CPU time         25.53          (0 hr, 0 min, 25 sec)
% 27.13/27.39  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 27.13/27.39  wall-clock time       27             (0 hr, 0 min, 27 sec)
% 27.13/27.39  
% 27.13/27.39  Process 11626 finished Wed Jul 27 03:02:37 2022
% 27.13/27.39  Otter interrupted
% 27.13/27.39  PROOF NOT FOUND
%------------------------------------------------------------------------------