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

View Problem - Process Solution

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

% Computer : n005.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:29 EDT 2022

% Result   : Unsatisfiable 2.92s 3.15s
% Output   : Refutation 2.92s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET081-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.13  % Command  : sos-script %s
% 0.12/0.33  % Computer : n005.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  : 600
% 0.12/0.34  % DateTime : Sat Jul  9 19:13:37 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.36  ----- Otter 3.2, August 2001 -----
% 0.12/0.36  The process was started by sandbox on n005.cluster.edu,
% 0.12/0.36  Sat Jul  9 19:13:37 2022
% 0.12/0.36  The command was "./sos".  The process ID is 28458.
% 0.12/0.36  
% 0.12/0.36  set(prolog_style_variables).
% 0.12/0.36  set(auto).
% 0.12/0.36     dependent: set(auto1).
% 0.12/0.36     dependent: set(process_input).
% 0.12/0.36     dependent: clear(print_kept).
% 0.12/0.36     dependent: clear(print_new_demod).
% 0.12/0.36     dependent: clear(print_back_demod).
% 0.12/0.36     dependent: clear(print_back_sub).
% 0.12/0.36     dependent: set(control_memory).
% 0.12/0.36     dependent: assign(max_mem, 12000).
% 0.12/0.36     dependent: assign(pick_given_ratio, 4).
% 0.12/0.36     dependent: assign(stats_level, 1).
% 0.12/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36     dependent: assign(sos_limit, 5000).
% 0.12/0.36     dependent: assign(max_weight, 60).
% 0.12/0.36  clear(print_given).
% 0.12/0.36  
% 0.12/0.36  list(usable).
% 0.12/0.36  
% 0.12/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.36  
% 0.12/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36  clauses in usable.
% 0.12/0.36  
% 0.12/0.36     dependent: set(knuth_bendix).
% 0.12/0.36     dependent: set(para_from).
% 0.12/0.36     dependent: set(para_into).
% 0.12/0.36     dependent: clear(para_from_right).
% 0.12/0.36     dependent: clear(para_into_right).
% 0.12/0.36     dependent: set(para_from_vars).
% 0.12/0.36     dependent: set(eq_units_both_ways).
% 0.12/0.36     dependent: set(dynamic_demod_all).
% 0.12/0.36     dependent: set(dynamic_demod).
% 0.12/0.36     dependent: set(order_eq).
% 0.12/0.36     dependent: set(back_demod).
% 0.12/0.36     dependent: set(lrpo).
% 0.12/0.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: set(unit_deletion).
% 0.12/0.36     dependent: set(factor).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36    Following clause subsumed by 92 during input processing: 0 [demod,95] {-} member(unordered_pair(A,A),universal_class).
% 0.12/0.36    Following clause subsumed by 161 during input processing: 0 [copy,161,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.12/0.36    Following clause subsumed by 177 during input processing: 0 [copy,177,flip.1] {-} A=A.
% 0.12/0.36  177 back subsumes 88.
% 0.12/0.36  177 back subsumes 80.
% 0.12/0.36  
% 0.12/0.36  ======= end of input processing =======
% 0.90/1.15  
% 0.90/1.15  Model 1 (0.00 seconds, 0 Inserts)
% 0.90/1.15  
% 0.90/1.15  Stopped by limit on number of solutions
% 0.90/1.15  
% 0.90/1.15  
% 0.90/1.15  -------------- Softie stats --------------
% 0.90/1.15  
% 0.90/1.15  UPDATE_STOP: 300
% 0.90/1.15  SFINDER_TIME_LIMIT: 2
% 0.90/1.15  SHORT_CLAUSE_CUTOFF: 4
% 0.90/1.15  number of clauses in intial UL: 67
% 0.90/1.15  number of clauses initially in problem: 152
% 0.90/1.15  percentage of clauses intially in UL: 44
% 0.90/1.15  percentage of distinct symbols occuring in initial UL: 64
% 0.90/1.15  percent of all initial clauses that are short: 100
% 0.90/1.15  absolute distinct symbol count: 50
% 0.90/1.15     distinct predicate count: 10
% 0.90/1.15     distinct function count: 30
% 0.90/1.15     distinct constant count: 10
% 0.90/1.15  
% 0.90/1.15  ---------- no more Softie stats ----------
% 0.90/1.15  
% 0.90/1.15  
% 0.90/1.15  
% 0.90/1.15  Stopped by limit on insertions
% 0.90/1.15  
% 0.90/1.15  =========== start of search ===========
% 2.92/3.15  
% 2.92/3.15  -------- PROOF -------- 
% 2.92/3.15  % SZS status Unsatisfiable
% 2.92/3.15  % SZS output start Refutation
% 2.92/3.15  
% 2.92/3.15  Stopped by limit on insertions
% 2.92/3.15  
% 2.92/3.15  Stopped by limit on insertions
% 2.92/3.15  
% 2.92/3.15  Stopped by limit on insertions
% 2.92/3.15  
% 2.92/3.15  Model 2 [ 1 2 9308 ] (0.00 seconds, 250000 Inserts)
% 2.92/3.15  
% 2.92/3.15  Stopped by limit on insertions
% 2.92/3.15  
% 2.92/3.15  Stopped by limit on insertions
% 2.92/3.15  
% 2.92/3.15  Stopped by limit on insertions
% 2.92/3.15  
% 2.92/3.15  ----> UNIT CONFLICT at   2.77 sec ----> 303 [binary,301.1,79.1] {-} $F.
% 2.92/3.15  
% 2.92/3.15  Length of proof is 4.  Level of proof is 3.
% 2.92/3.15  
% 2.92/3.15  ---------------- PROOF ----------------
% 2.92/3.15  % SZS status Unsatisfiable
% 2.92/3.15  % SZS output start Refutation
% 2.92/3.15  
% 2.92/3.15  6 [] {+} -member(A,unordered_pair(B,C))|A=B|A=C.
% 2.92/3.15  79 [] {+} y!=x.
% 2.92/3.15  81 [factor,6.2.3] {+} -member(A,unordered_pair(B,B))|A=B.
% 2.92/3.15  93 [] {-} unordered_pair(A,A)=singleton(A).
% 2.92/3.15  95,94 [copy,93,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 2.92/3.15  175 [] {-} member(y,singleton(x)).
% 2.92/3.15  176 [copy,175,demod,95] {-} member(y,unordered_pair(x,x)).
% 2.92/3.15  301 [hyper,176,81] {-} y=x.
% 2.92/3.15  303 [binary,301.1,79.1] {-} $F.
% 2.92/3.15  
% 2.92/3.15  % SZS output end Refutation
% 2.92/3.15  ------------ end of proof -------------
% 2.92/3.15  
% 2.92/3.15  
% 2.92/3.15  Search stopped by max_proofs option.
% 2.92/3.15  
% 2.92/3.15  
% 2.92/3.15  Search stopped by max_proofs option.
% 2.92/3.15  
% 2.92/3.15  ============ end of search ============
% 2.92/3.15  
% 2.92/3.15  ----------- soft-scott stats ----------
% 2.92/3.15  
% 2.92/3.15  true clauses given           0      (0.0%)
% 2.92/3.15  false clauses given          7
% 2.92/3.15  
% 2.92/3.15        FALSE     TRUE
% 2.92/3.15     3  0         6
% 2.92/3.15     5  4         7
% 2.92/3.15     6  2         1
% 2.92/3.15     7  8         4
% 2.92/3.15     8  10        12
% 2.92/3.15     9  7         1
% 2.92/3.15    10  9         7
% 2.92/3.15    11  6         7
% 2.92/3.15    12  2         8
% 2.92/3.15    13  6         10
% 2.92/3.15    14  4         1
% 2.92/3.15    15  0         5
% 2.92/3.15    16  2         5
% 2.92/3.15    17  0         6
% 2.92/3.15    18  0         2
% 2.92/3.15    19  0         4
% 2.92/3.15    20  0         2
% 2.92/3.15    21  0         1
% 2.92/3.15    22  1         1
% 2.92/3.15    23  1         0
% 2.92/3.15    24  1         3
% 2.92/3.15  tot:  63        93      (59.6% true)
% 2.92/3.15  
% 2.92/3.15  
% 2.92/3.15  Model 2 [ 1 -102 9308 ] (0.00 seconds, 250000 Inserts)
% 2.92/3.15  
% 2.92/3.15  That finishes the proof of the theorem.
% 2.92/3.15  
% 2.92/3.15  Process 28458 finished Sat Jul  9 19:13:40 2022
%------------------------------------------------------------------------------