TSTP Solution File: SWW413-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SWW413-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n017.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  : 600s
% DateTime : Thu Jul 21 01:26:48 EDT 2022

% Result   : Unsatisfiable 0.22s 0.45s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem  : SWW413-1 : TPTP v8.1.0. Released v5.2.0.
% 0.14/0.14  % Command  : sos-script %s
% 0.14/0.36  % Computer : n017.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sun Jun  5 23:01:31 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.38  ----- Otter 3.2, August 2001 -----
% 0.14/0.38  The process was started by sandbox2 on n017.cluster.edu,
% 0.14/0.38  Sun Jun  5 23:01:31 2022
% 0.14/0.38  The command was "./sos".  The process ID is 4454.
% 0.14/0.38  
% 0.14/0.38  set(prolog_style_variables).
% 0.14/0.38  set(auto).
% 0.14/0.38     dependent: set(auto1).
% 0.14/0.38     dependent: set(process_input).
% 0.14/0.38     dependent: clear(print_kept).
% 0.14/0.38     dependent: clear(print_new_demod).
% 0.14/0.38     dependent: clear(print_back_demod).
% 0.14/0.38     dependent: clear(print_back_sub).
% 0.14/0.38     dependent: set(control_memory).
% 0.14/0.38     dependent: assign(max_mem, 12000).
% 0.14/0.38     dependent: assign(pick_given_ratio, 4).
% 0.14/0.38     dependent: assign(stats_level, 1).
% 0.14/0.38     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38     dependent: assign(sos_limit, 5000).
% 0.14/0.38     dependent: assign(max_weight, 60).
% 0.14/0.38  clear(print_given).
% 0.14/0.38  
% 0.14/0.38  list(usable).
% 0.14/0.38  
% 0.14/0.38  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.14/0.38  
% 0.14/0.38  This ia a non-Horn set with equality.  The strategy will be
% 0.14/0.38  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.38  unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.38  clauses in usable.
% 0.14/0.38  
% 0.14/0.38     dependent: set(knuth_bendix).
% 0.14/0.38     dependent: set(para_from).
% 0.14/0.38     dependent: set(para_into).
% 0.14/0.38     dependent: clear(para_from_right).
% 0.14/0.38     dependent: clear(para_into_right).
% 0.14/0.38     dependent: set(para_from_vars).
% 0.14/0.38     dependent: set(eq_units_both_ways).
% 0.14/0.38     dependent: set(dynamic_demod_all).
% 0.14/0.38     dependent: set(dynamic_demod).
% 0.14/0.38     dependent: set(order_eq).
% 0.14/0.38     dependent: set(back_demod).
% 0.14/0.38     dependent: set(lrpo).
% 0.14/0.38     dependent: set(hyper_res).
% 0.14/0.38     dependent: set(unit_deletion).
% 0.14/0.38     dependent: set(factor).
% 0.14/0.38  
% 0.14/0.38  ------------> process usable:
% 0.14/0.38  
% 0.14/0.38  ------------> process sos:
% 0.14/0.38    Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 0.14/0.38    Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] {-} A=A.
% 0.14/0.38  
% 0.14/0.38  ======= end of input processing =======
% 0.14/0.41  
% 0.14/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.41  
% 0.14/0.41  Stopped by limit on number of solutions
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  -------------- Softie stats --------------
% 0.14/0.41  
% 0.14/0.41  UPDATE_STOP: 300
% 0.14/0.41  SFINDER_TIME_LIMIT: 2
% 0.14/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.41  number of clauses in intial UL: 17
% 0.14/0.41  number of clauses initially in problem: 22
% 0.14/0.41  percentage of clauses intially in UL: 77
% 0.14/0.41  percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.41  percent of all initial clauses that are short: 100
% 0.14/0.41  absolute distinct symbol count: 11
% 0.14/0.41     distinct predicate count: 2
% 0.14/0.41     distinct function count: 3
% 0.14/0.41     distinct constant count: 6
% 0.14/0.41  
% 0.14/0.41  ---------- no more Softie stats ----------
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  =========== start of search ===========
% 0.22/0.45  
% 0.22/0.45  -------- PROOF -------- 
% 0.22/0.45  % SZS status Unsatisfiable
% 0.22/0.45  % SZS output start Refutation
% 0.22/0.45  
% 0.22/0.45  Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.45  
% 0.22/0.45  Stopped by limit on number of solutions
% 0.22/0.45  
% 0.22/0.45  -----> EMPTY CLAUSE at   0.04 sec ----> 148 [hyper,137,6,unit_del,14,19] {-} $F.
% 0.22/0.45  
% 0.22/0.45  Length of proof is 1.  Level of proof is 1.
% 0.22/0.45  
% 0.22/0.45  ---------------- PROOF ----------------
% 0.22/0.45  % SZS status Unsatisfiable
% 0.22/0.45  % SZS output start Refutation
% 0.22/0.45  
% 0.22/0.45  6 [] {+} -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 0.22/0.45  14 [] {+} x3!=x2.
% 0.22/0.45  19 [] {+} -heap(sep(lseg(x2,nil),emp)).
% 0.22/0.45  21 [] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 0.22/0.45  24 [] {-} heap(sep(lseg(x3,nil),sep(next(x2,x3),emp))).
% 0.22/0.45  137 [para_into,24.1.1,21.1.1] {-} heap(sep(next(x2,x3),sep(lseg(x3,nil),emp))).
% 0.22/0.45  148 [hyper,137,6,unit_del,14,19] {-} $F.
% 0.22/0.45  
% 0.22/0.45  % SZS output end Refutation
% 0.22/0.45  ------------ end of proof -------------
% 0.22/0.45  
% 0.22/0.45  
% 0.22/0.45  Search stopped by max_proofs option.
% 0.22/0.45  
% 0.22/0.45  
% 0.22/0.45  Search stopped by max_proofs option.
% 0.22/0.45  
% 0.22/0.45  ============ end of search ============
% 0.22/0.45  
% 0.22/0.45  ----------- soft-scott stats ----------
% 0.22/0.45  
% 0.22/0.45  true clauses given           0      (0.0%)
% 0.22/0.45  false clauses given          4
% 0.22/0.45  
% 0.22/0.45        FALSE     TRUE
% 0.22/0.45     3  0         1
% 0.22/0.45     6  0         1
% 0.22/0.45     8  0         1
% 0.22/0.45     9  0         1
% 0.22/0.45    11  0         1
% 0.22/0.45    12  0         3
% 0.22/0.45    13  0         4
% 0.22/0.45    15  2         4
% 0.22/0.45    16  3         6
% 0.22/0.45    17  2         0
% 0.22/0.45    18  0         1
% 0.22/0.45    19  0         4
% 0.22/0.45    20  5         7
% 0.22/0.45    22  2         2
% 0.22/0.45    23  1         13
% 0.22/0.45    24  1         7
% 0.22/0.45    25  1         2
% 0.22/0.45    26  0         4
% 0.22/0.45    27  0         10
% 0.22/0.45    28  1         7
% 0.22/0.45    29  0         1
% 0.22/0.45    30  0         1
% 0.22/0.45    31  0         5
% 0.22/0.45    32  0         2
% 0.22/0.45    34  0         5
% 0.22/0.45    36  0         1
% 0.22/0.45    37  0         1
% 0.22/0.45    39  0         2
% 0.22/0.45    40  0         2
% 0.22/0.45    41  0         1
% 0.22/0.45    46  0         1
% 0.22/0.45    47  0         1
% 0.22/0.45    56  0         1
% 0.22/0.45    58  0         1
% 0.22/0.45  tot:  18        104      (85.2% true)
% 0.22/0.45  
% 0.22/0.45  
% 0.22/0.45  Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.45  
% 0.22/0.45  That finishes the proof of the theorem.
% 0.22/0.45  
% 0.22/0.45  Process 4454 finished Sun Jun  5 23:01:31 2022
%------------------------------------------------------------------------------