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

View Problem - Process Solution

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

% Computer : n028.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:47 EDT 2022

% Result   : Unsatisfiable 44.38s 44.62s
% Output   : Refutation 44.38s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWW399-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n028.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  : 600
% 0.13/0.34  % DateTime : Sat Jun  4 16:15:26 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox2 on n028.cluster.edu,
% 0.13/0.36  Sat Jun  4 16:15:26 2022
% 0.13/0.36  The command was "./sos".  The process ID is 10264.
% 0.13/0.36  
% 0.13/0.36  set(prolog_style_variables).
% 0.13/0.36  set(auto).
% 0.13/0.36     dependent: set(auto1).
% 0.13/0.36     dependent: set(process_input).
% 0.13/0.36     dependent: clear(print_kept).
% 0.13/0.36     dependent: clear(print_new_demod).
% 0.13/0.36     dependent: clear(print_back_demod).
% 0.13/0.36     dependent: clear(print_back_sub).
% 0.13/0.36     dependent: set(control_memory).
% 0.13/0.36     dependent: assign(max_mem, 12000).
% 0.13/0.36     dependent: assign(pick_given_ratio, 4).
% 0.13/0.36     dependent: assign(stats_level, 1).
% 0.13/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36     dependent: assign(sos_limit, 5000).
% 0.13/0.36     dependent: assign(max_weight, 60).
% 0.13/0.36  clear(print_given).
% 0.13/0.36  
% 0.13/0.36  list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36  
% 0.13/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36  clauses in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(knuth_bendix).
% 0.13/0.36     dependent: set(para_from).
% 0.13/0.36     dependent: set(para_into).
% 0.13/0.36     dependent: clear(para_from_right).
% 0.13/0.36     dependent: clear(para_into_right).
% 0.13/0.36     dependent: set(para_from_vars).
% 0.13/0.36     dependent: set(eq_units_both_ways).
% 0.13/0.36     dependent: set(dynamic_demod_all).
% 0.13/0.36     dependent: set(dynamic_demod).
% 0.13/0.36     dependent: set(order_eq).
% 0.13/0.36     dependent: set(back_demod).
% 0.13/0.36     dependent: set(lrpo).
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: set(unit_deletion).
% 0.13/0.36     dependent: set(factor).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36    Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 0.13/0.36    Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} A=A.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.13/0.38  
% 0.13/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38  
% 0.13/0.38  Stopped by limit on number of solutions
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  -------------- Softie stats --------------
% 0.13/0.38  
% 0.13/0.38  UPDATE_STOP: 300
% 0.13/0.38  SFINDER_TIME_LIMIT: 2
% 0.13/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38  number of clauses in intial UL: 12
% 0.13/0.38  number of clauses initially in problem: 17
% 0.13/0.38  percentage of clauses intially in UL: 70
% 0.13/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38  percent of all initial clauses that are short: 100
% 0.13/0.38  absolute distinct symbol count: 8
% 0.13/0.38     distinct predicate count: 2
% 0.13/0.38     distinct function count: 3
% 0.13/0.38     distinct constant count: 3
% 0.13/0.38  
% 0.13/0.38  ---------- no more Softie stats ----------
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  =========== start of search ===========
% 3.33/3.52  
% 3.33/3.52  
% 3.33/3.52  Changing weight limit from 60 to 57.
% 3.33/3.52  
% 3.33/3.52  Model 2 (0.00 seconds, 0 Inserts)
% 3.33/3.52  
% 3.33/3.52  Stopped by limit on number of solutions
% 3.33/3.52  
% 3.33/3.52  Resetting weight limit to 57 after 35 givens.
% 3.33/3.52  
% 31.07/31.30  
% 31.07/31.30  
% 31.07/31.30  Changing weight limit from 57 to 52.
% 31.07/31.30  
% 31.07/31.30  Resetting weight limit to 52 after 95 givens.
% 31.07/31.30  
% 33.26/33.49  
% 33.26/33.49  
% 33.26/33.49  Changing weight limit from 52 to 44.
% 33.26/33.49  
% 33.26/33.49  Resetting weight limit to 44 after 100 givens.
% 33.26/33.49  
% 34.37/34.58  
% 34.37/34.58  
% 34.37/34.58  Changing weight limit from 44 to 42.
% 34.37/34.58  
% 34.37/34.58  Resetting weight limit to 42 after 105 givens.
% 34.37/34.58  
% 36.08/36.34  
% 36.08/36.34  
% 36.08/36.34  Changing weight limit from 42 to 40.
% 36.08/36.34  
% 36.08/36.34  Resetting weight limit to 40 after 115 givens.
% 36.08/36.34  
% 39.05/39.27  
% 39.05/39.27  
% 39.05/39.27  Changing weight limit from 40 to 39.
% 39.05/39.27  
% 39.05/39.27  Resetting weight limit to 39 after 135 givens.
% 39.05/39.27  
% 41.17/41.35  
% 41.17/41.35  
% 41.17/41.35  Changing weight limit from 39 to 38.
% 41.17/41.35  
% 41.17/41.35  Resetting weight limit to 38 after 140 givens.
% 41.17/41.35  
% 42.81/43.03  
% 42.81/43.03  
% 42.81/43.03  Changing weight limit from 38 to 37.
% 42.81/43.03  
% 42.81/43.03  Resetting weight limit to 37 after 145 givens.
% 42.81/43.03  
% 44.38/44.62  
% 44.38/44.62  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 44.38/44.62  
% 44.38/44.62  ----> UNIT CONFLICT at  44.21 sec ----> 27462 [binary,27461.1,12.1] {+} $F.
% 44.38/44.62  
% 44.38/44.62  Length of proof is 5.  Level of proof is 5.
% 44.38/44.62  
% 44.38/44.62  ---------------- PROOF ----------------
% 44.38/44.62  % SZS status Unsatisfiable
% 44.38/44.62  % SZS output start Refutation
% 44.38/44.62  
% 44.38/44.62  1 [] {+} -heap(sep(next(nil,A),B)).
% 44.38/44.62  2 [] {+} -heap(sep(lseg(nil,A),B))|A=nil.
% 44.38/44.62  6 [] {+} -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 44.38/44.62  12 [] {+} -heap(sep(lseg(x1,nil),emp)).
% 44.38/44.62  14 [] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 44.38/44.62  16,15 [] {+} sep(lseg(A,A),B)=B.
% 44.38/44.62  17 [] {-} heap(sep(next(x1,nil),emp)).
% 44.38/44.62  66 [para_into,17.1.1.1.1,2.2.1,unit_del,1] {+} -heap(sep(lseg(nil,x1),A)).
% 44.38/44.62  364 [para_into,66.1.1,14.1.1] {+} -heap(sep(A,sep(lseg(nil,x1),B))).
% 44.38/44.62  921 [para_into,364.1.1.2.1.2,6.2.1] {+} -heap(sep(A,sep(lseg(nil,B),C)))| -heap(sep(next(x1,B),sep(lseg(B,D),E)))|heap(sep(lseg(x1,D),E)).
% 44.38/44.62  949 [factor,921.1.2,demod,16] {+} -heap(sep(next(x1,nil),A))|heap(sep(lseg(x1,nil),A)).
% 44.38/44.62  27461 [hyper,949,17] {-} heap(sep(lseg(x1,nil),emp)).
% 44.38/44.62  27462 [binary,27461.1,12.1] {+} $F.
% 44.38/44.62  
% 44.38/44.62  % SZS output end Refutation
% 44.38/44.62  ------------ end of proof -------------
% 44.38/44.62  
% 44.38/44.62  
% 44.38/44.62  Search stopped by max_proofs option.
% 44.38/44.62  
% 44.38/44.62  
% 44.38/44.62  Search stopped by max_proofs option.
% 44.38/44.62  
% 44.38/44.62  ============ end of search ============
% 44.38/44.62  
% 44.38/44.62  ----------- soft-scott stats ----------
% 44.38/44.62  
% 44.38/44.62  true clauses given          56      (37.6%)
% 44.38/44.62  false clauses given         93
% 44.38/44.62  
% 44.38/44.62        FALSE     TRUE
% 44.38/44.62    12  0         32
% 44.38/44.62    13  0         20
% 44.38/44.62    14  0         67
% 44.38/44.62    15  0         21
% 44.38/44.62    16  0         194
% 44.38/44.62    17  0         33
% 44.38/44.62    18  0         243
% 44.38/44.62    19  16        37
% 44.38/44.62    20  168       416
% 44.38/44.62    21  23        43
% 44.38/44.62    22  182       419
% 44.38/44.62    23  89        78
% 44.38/44.62    24  234       747
% 44.38/44.62    25  47        114
% 44.38/44.62    26  183       349
% 44.38/44.62    27  103       26
% 44.38/44.62    28  241       276
% 44.38/44.62    29  41        17
% 44.38/44.62    30  386       221
% 44.38/44.62    31  81        58
% 44.38/44.62    32  344       169
% 44.38/44.62    33  41        26
% 44.38/44.62    34  255       74
% 44.38/44.62    35  63        56
% 44.38/44.62    36  147       105
% 44.38/44.62    37  45        42
% 44.38/44.62  tot:  2689      3883      (59.1% true)
% 44.38/44.62  
% 44.38/44.62  
% 44.38/44.62  Model 2 (0.00 seconds, 0 Inserts)
% 44.38/44.62  
% 44.38/44.62  That finishes the proof of the theorem.
% 44.38/44.62  
% 44.38/44.62  Process 10264 finished Sat Jun  4 16:16:10 2022
%------------------------------------------------------------------------------