TSTP Solution File: SET057-6 by SOS---2.0

View Problem - Process Solution

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

% Computer : n003.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:01 EDT 2022

% Result   : Unsatisfiable 1.93s 2.11s
% Output   : Refutation 1.93s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET057-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n003.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jul  9 21:50:59 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n003.cluster.edu,
% 0.13/0.36  Sat Jul  9 21:50:59 2022
% 0.13/0.36  The command was "./sos".  The process ID is 4199.
% 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=5.
% 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 138 during input processing: 0 [copy,138,flip.1] {-} A=A.
% 0.13/0.36  138 back subsumes 63.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.41/0.59  
% 0.41/0.59  Model 1 (0.00 seconds, 0 Inserts)
% 0.41/0.59  
% 0.41/0.59  Stopped by limit on number of solutions
% 0.41/0.59  
% 0.41/0.59  
% 0.41/0.59  -------------- Softie stats --------------
% 0.41/0.59  
% 0.41/0.59  UPDATE_STOP: 300
% 0.41/0.59  SFINDER_TIME_LIMIT: 2
% 0.41/0.59  SHORT_CLAUSE_CUTOFF: 4
% 0.41/0.59  number of clauses in intial UL: 50
% 0.41/0.59  number of clauses initially in problem: 121
% 0.41/0.59  percentage of clauses intially in UL: 41
% 0.41/0.59  percentage of distinct symbols occuring in initial UL: 64
% 0.41/0.59  percent of all initial clauses that are short: 100
% 0.41/0.59  absolute distinct symbol count: 50
% 0.41/0.59     distinct predicate count: 10
% 0.41/0.59     distinct function count: 30
% 0.41/0.59     distinct constant count: 10
% 0.41/0.59  
% 0.41/0.59  ---------- no more Softie stats ----------
% 0.41/0.59  
% 0.41/0.59  
% 0.41/0.59  
% 0.41/0.59  Stopped by limit on insertions
% 0.41/0.59  
% 0.41/0.59  =========== start of search ===========
% 1.93/2.11  
% 1.93/2.11  -------- PROOF -------- 
% 1.93/2.11  % SZS status Unsatisfiable
% 1.93/2.11  % SZS output start Refutation
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Model 2 [ 14 1 3363 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Model 3 [ 14 2 17018 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Model 4 [ 9 1 5774 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  Stopped by limit on insertions
% 1.93/2.11  
% 1.93/2.11  -----> EMPTY CLAUSE at   1.73 sec ----> 350 [hyper,327,5,71,unit_del,61,62] {-} $F.
% 1.93/2.11  
% 1.93/2.11  Length of proof is 2.  Level of proof is 1.
% 1.93/2.11  
% 1.93/2.11  ---------------- PROOF ----------------
% 1.93/2.11  % SZS status Unsatisfiable
% 1.93/2.11  % SZS output start Refutation
% 1.93/2.11  
% 1.93/2.11  2 [] {+} -member(not_subclass_element(A,B),B)|subclass(A,B).
% 1.93/2.11  5 [] {+} -subclass(A,B)| -subclass(B,A)|A=B.
% 1.93/2.11  60 [] {-} x!=y.
% 1.93/2.11  61 [copy,60,flip.1] {+} y!=x.
% 1.93/2.11  62 [] {+} -member(not_subclass_element(y,x),y).
% 1.93/2.11  71 [] {-} member(not_subclass_element(A,B),A)|subclass(A,B).
% 1.93/2.11  137 [] {-} member(not_subclass_element(x,y),y).
% 1.93/2.11  327 [hyper,137,2] {-} subclass(x,y).
% 1.93/2.11  350 [hyper,327,5,71,unit_del,61,62] {-} $F.
% 1.93/2.11  
% 1.93/2.11  % SZS output end Refutation
% 1.93/2.11  ------------ end of proof -------------
% 1.93/2.11  
% 1.93/2.11  
% 1.93/2.11  Search stopped by max_proofs option.
% 1.93/2.11  
% 1.93/2.11  
% 1.93/2.11  Search stopped by max_proofs option.
% 1.93/2.11  
% 1.93/2.11  ============ end of search ============
% 1.93/2.11  
% 1.93/2.11  ----------- soft-scott stats ----------
% 1.93/2.11  
% 1.93/2.11  true clauses given           2      (13.3%)
% 1.93/2.11  false clauses given         13
% 1.93/2.11  
% 1.93/2.11        FALSE     TRUE
% 1.93/2.11     3  0         1
% 1.93/2.11     5  5         10
% 1.93/2.11     6  2         1
% 1.93/2.11     7  12        8
% 1.93/2.11     8  11        18
% 1.93/2.11     9  18        3
% 1.93/2.11    10  8         22
% 1.93/2.11    11  10        20
% 1.93/2.11    12  3         3
% 1.93/2.11    13  10        29
% 1.93/2.11    14  4         3
% 1.93/2.11    15  0         9
% 1.93/2.11    16  1         2
% 1.93/2.11    17  0         5
% 1.93/2.11    18  0         2
% 1.93/2.11    19  0         1
% 1.93/2.11    20  0         1
% 1.93/2.11    22  1         0
% 1.93/2.11    23  1         0
% 1.93/2.11    24  0         1
% 1.93/2.11  tot:  86        139      (61.8% true)
% 1.93/2.11  
% 1.93/2.11  
% 1.93/2.11  Model 4 [ 9 -60 5774 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.11  
% 1.93/2.11  That finishes the proof of the theorem.
% 1.93/2.11  
% 1.93/2.11  Process 4199 finished Sat Jul  9 21:51:00 2022
%------------------------------------------------------------------------------