TSTP Solution File: SET094-7 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SET094-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n027.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 : Tue Jul 19 05:15:40 EDT 2022

% Result   : Unsatisfiable 1.39s 1.58s
% Output   : Refutation 1.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET094-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.14  % Command  : sos-script %s
% 0.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jul  9 18:28:47 EDT 2022
% 0.13/0.36  % CPUTime  : 
% 0.13/0.39  ----- Otter 3.2, August 2001 -----
% 0.13/0.39  The process was started by sandbox on n027.cluster.edu,
% 0.13/0.39  Sat Jul  9 18:28:47 2022
% 0.13/0.39  The command was "./sos".  The process ID is 31639.
% 0.13/0.39  
% 0.13/0.39  set(prolog_style_variables).
% 0.13/0.39  set(auto).
% 0.13/0.39     dependent: set(auto1).
% 0.13/0.39     dependent: set(process_input).
% 0.13/0.39     dependent: clear(print_kept).
% 0.13/0.39     dependent: clear(print_new_demod).
% 0.13/0.39     dependent: clear(print_back_demod).
% 0.13/0.39     dependent: clear(print_back_sub).
% 0.13/0.39     dependent: set(control_memory).
% 0.13/0.39     dependent: assign(max_mem, 12000).
% 0.13/0.39     dependent: assign(pick_given_ratio, 4).
% 0.13/0.39     dependent: assign(stats_level, 1).
% 0.13/0.39     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.39     dependent: assign(sos_limit, 5000).
% 0.13/0.39     dependent: assign(max_weight, 60).
% 0.13/0.39  clear(print_given).
% 0.13/0.39  
% 0.13/0.39  list(usable).
% 0.13/0.39  
% 0.13/0.39  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.39  
% 0.13/0.39  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.39  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.39  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.39  clauses in usable.
% 0.13/0.39  
% 0.13/0.39     dependent: set(knuth_bendix).
% 0.13/0.39     dependent: set(para_from).
% 0.13/0.39     dependent: set(para_into).
% 0.13/0.39     dependent: clear(para_from_right).
% 0.13/0.39     dependent: clear(para_into_right).
% 0.13/0.39     dependent: set(para_from_vars).
% 0.13/0.39     dependent: set(eq_units_both_ways).
% 0.13/0.39     dependent: set(dynamic_demod_all).
% 0.13/0.39     dependent: set(dynamic_demod).
% 0.13/0.39     dependent: set(order_eq).
% 0.13/0.39     dependent: set(back_demod).
% 0.13/0.39     dependent: set(lrpo).
% 0.13/0.39     dependent: set(hyper_res).
% 0.13/0.39     dependent: set(unit_deletion).
% 0.13/0.39     dependent: set(factor).
% 0.13/0.39  
% 0.13/0.39  ------------> process usable:
% 0.13/0.39  
% 0.13/0.39  ------------> process sos:
% 0.13/0.39    Following clause subsumed by 101 during input processing: 0 [demod,104] {-} member(unordered_pair(A,A),universal_class).
% 0.13/0.39    Following clause subsumed by 170 during input processing: 0 [copy,170,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.13/0.39    Following clause subsumed by 196 during input processing: 0 [copy,196,flip.1] {-} A=A.
% 0.13/0.39  196 back subsumes 96.
% 0.13/0.39  196 back subsumes 88.
% 0.13/0.39  
% 0.13/0.39  ======= end of input processing =======
% 0.75/0.99  
% 0.75/0.99  Stopped by limit on insertions
% 0.75/0.99  
% 0.75/0.99  
% 0.75/0.99  Failed to model usable list: disabling FINDER
% 0.75/0.99  
% 0.75/0.99  
% 0.75/0.99  
% 0.75/0.99  -------------- Softie stats --------------
% 0.75/0.99  
% 0.75/0.99  UPDATE_STOP: 300
% 0.75/0.99  SFINDER_TIME_LIMIT: 2
% 0.75/0.99  SHORT_CLAUSE_CUTOFF: 4
% 0.75/0.99  number of clauses in intial UL: 67
% 0.75/0.99  number of clauses initially in problem: 166
% 0.75/0.99  percentage of clauses intially in UL: 40
% 0.75/0.99  percentage of distinct symbols occuring in initial UL: 63
% 0.75/0.99  percent of all initial clauses that are short: 100
% 0.75/0.99  absolute distinct symbol count: 52
% 0.75/0.99     distinct predicate count: 10
% 0.75/0.99     distinct function count: 32
% 0.75/0.99     distinct constant count: 10
% 0.75/0.99  
% 0.75/0.99  ---------- no more Softie stats ----------
% 0.75/0.99  
% 0.75/0.99  
% 0.75/0.99  
% 0.75/0.99  =========== start of search ===========
% 0.95/1.15  
% 0.95/1.15  
% 0.95/1.15  Changing weight limit from 60 to 37.
% 0.95/1.15  
% 0.95/1.15  Resetting weight limit to 37 after 110 givens.
% 0.95/1.15  
% 0.98/1.20  
% 0.98/1.20  
% 0.98/1.20  Changing weight limit from 37 to 23.
% 0.98/1.20  
% 0.98/1.20  Resetting weight limit to 23 after 115 givens.
% 0.98/1.20  
% 1.06/1.25  
% 1.06/1.25  
% 1.06/1.25  Changing weight limit from 23 to 20.
% 1.06/1.25  
% 1.06/1.25  Resetting weight limit to 20 after 120 givens.
% 1.06/1.25  
% 1.10/1.31  
% 1.10/1.31  
% 1.10/1.31  Changing weight limit from 20 to 19.
% 1.10/1.31  
% 1.10/1.31  Resetting weight limit to 19 after 125 givens.
% 1.10/1.31  
% 1.19/1.37  
% 1.19/1.37  
% 1.19/1.37  Changing weight limit from 19 to 16.
% 1.19/1.37  
% 1.19/1.37  Resetting weight limit to 16 after 130 givens.
% 1.19/1.37  
% 1.25/1.43  
% 1.25/1.43  
% 1.25/1.43  Changing weight limit from 16 to 15.
% 1.25/1.43  
% 1.25/1.43  Resetting weight limit to 15 after 135 givens.
% 1.25/1.43  
% 1.28/1.52  
% 1.28/1.52  
% 1.28/1.52  Changing weight limit from 15 to 14.
% 1.28/1.52  
% 1.28/1.52  Resetting weight limit to 14 after 145 givens.
% 1.28/1.52  
% 1.35/1.57  
% 1.35/1.57  
% 1.35/1.57  Changing weight limit from 14 to 13.
% 1.35/1.57  
% 1.35/1.57  Resetting weight limit to 13 after 155 givens.
% 1.35/1.57  
% 1.39/1.58  
% 1.39/1.58  -------- PROOF -------- 
% 1.39/1.58  % SZS status Unsatisfiable
% 1.39/1.58  % SZS output start Refutation
% 1.39/1.58  
% 1.39/1.58  ----> UNIT CONFLICT at   1.17 sec ----> 9135 [binary,9133.1,87.1] {-} $F.
% 1.39/1.58  
% 1.39/1.58  Length of proof is 7.  Level of proof is 5.
% 1.39/1.58  
% 1.39/1.58  ---------------- PROOF ----------------
% 1.39/1.58  % SZS status Unsatisfiable
% 1.39/1.58  % SZS output start Refutation
% 1.39/1.58  
% 1.39/1.58  1 [] {+} -subclass(A,B)| -member(C,A)|member(C,B).
% 1.39/1.58  6 [] {+} -member(A,unordered_pair(B,C))|A=B|A=C.
% 1.39/1.58  87 [] {+} member_of(x)!=y.
% 1.39/1.58  89 [factor,6.2.3] {+} -member(A,unordered_pair(B,B))|A=B.
% 1.39/1.58  102 [] {-} unordered_pair(A,A)=singleton(A).
% 1.39/1.58  104,103 [copy,102,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 1.39/1.58  173 [] {-} subclass(singleton(A),unordered_pair(B,A)).
% 1.39/1.58  174 [copy,173,demod,104] {-} subclass(unordered_pair(A,A),unordered_pair(B,A)).
% 1.39/1.58  192 [] {-} singleton(member_of(x))=x.
% 1.39/1.58  193 [copy,192,demod,104] {-} unordered_pair(member_of(x),member_of(x))=x.
% 1.39/1.58  195 [] {-} member(y,x).
% 1.39/1.58  8328 [para_from,193.1.1,174.1.1] {-} subclass(x,unordered_pair(A,member_of(x))).
% 1.39/1.58  9082 [hyper,8328,1,195] {-} member(y,unordered_pair(A,member_of(x))).
% 1.39/1.58  9133 [hyper,9082,89,flip.1] {-} member_of(x)=y.
% 1.39/1.58  9135 [binary,9133.1,87.1] {-} $F.
% 1.39/1.58  
% 1.39/1.58  % SZS output end Refutation
% 1.39/1.58  ------------ end of proof -------------
% 1.39/1.58  
% 1.39/1.58  
% 1.39/1.58  Search stopped by max_proofs option.
% 1.39/1.58  
% 1.39/1.58  
% 1.39/1.58  Search stopped by max_proofs option.
% 1.39/1.58  
% 1.39/1.58  ============ end of search ============
% 1.39/1.58  
% 1.39/1.58  That finishes the proof of the theorem.
% 1.39/1.58  
% 1.39/1.58  Process 31639 finished Sat Jul  9 18:28:48 2022
%------------------------------------------------------------------------------