TSTP Solution File: SET581+3 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SET581+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n006.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:19:02 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET581+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n006.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.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jul  9 17:09:51 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox2 on n006.cluster.edu,
% 0.13/0.35  Sat Jul  9 17:09:51 2022
% 0.13/0.35  The command was "./sos".  The process ID is 22162.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  formula_list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35  
% 0.13/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35  clauses in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(knuth_bendix).
% 0.13/0.35     dependent: set(para_from).
% 0.13/0.35     dependent: set(para_into).
% 0.13/0.35     dependent: clear(para_from_right).
% 0.13/0.35     dependent: clear(para_into_right).
% 0.13/0.35     dependent: set(para_from_vars).
% 0.13/0.35     dependent: set(eq_units_both_ways).
% 0.13/0.35     dependent: set(dynamic_demod_all).
% 0.13/0.35     dependent: set(dynamic_demod).
% 0.13/0.35     dependent: set(order_eq).
% 0.13/0.35     dependent: set(back_demod).
% 0.13/0.35     dependent: set(lrpo).
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: set(unit_deletion).
% 0.13/0.35     dependent: set(factor).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35    Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} intersection(A,B)=intersection(B,A).
% 0.13/0.35    Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] {-} A=A.
% 0.13/0.35  19 back subsumes 12.
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.19/0.39  
% 0.19/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  -------------- Softie stats --------------
% 0.19/0.39  
% 0.19/0.39  UPDATE_STOP: 300
% 0.19/0.39  SFINDER_TIME_LIMIT: 2
% 0.19/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39  number of clauses in intial UL: 11
% 0.19/0.39  number of clauses initially in problem: 18
% 0.19/0.39  percentage of clauses intially in UL: 61
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 81
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 11
% 0.19/0.39     distinct predicate count: 4
% 0.19/0.39     distinct function count: 3
% 0.19/0.39     distinct constant count: 4
% 0.19/0.39  
% 0.19/0.39  ---------- no more Softie stats ----------
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  =========== start of search ===========
% 0.19/0.50  
% 0.19/0.50  -------- PROOF -------- 
% 0.19/0.50  % SZS status Theorem
% 0.19/0.50  % SZS output start Refutation
% 0.19/0.50  
% 0.19/0.50  Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.50  
% 0.19/0.50  Stopped by limit on number of solutions
% 0.19/0.50  
% 0.19/0.50  Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.50  
% 0.19/0.50  Stopped by limit on number of solutions
% 0.19/0.50  
% 0.19/0.50  Stopped by limit on insertions
% 0.19/0.50  
% 0.19/0.50  Model 5 [ 1 0 146 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.50  
% 0.19/0.50  ----> UNIT CONFLICT at   0.12 sec ----> 64 [binary,63.1,4.1] {-} $F.
% 0.19/0.50  
% 0.19/0.50  Length of proof is 3.  Level of proof is 2.
% 0.19/0.50  
% 0.19/0.50  ---------------- PROOF ----------------
% 0.19/0.50  % SZS status Theorem
% 0.19/0.50  % SZS output start Refutation
% 0.19/0.50  
% 0.19/0.50  3 [] {+} member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 0.19/0.50  4 [] {+} -member(A,empty_set).
% 0.19/0.50  10 [] {+} -not_equal(intersection($c2,$c1),empty_set).
% 0.19/0.50  14 [] {+} not_equal(A,B)|A=B.
% 0.19/0.50  17 [] {+} member($c3,$c2).
% 0.19/0.50  18 [] {+} member($c3,$c1).
% 0.19/0.50  55 [hyper,18,3,17] {-} member($c3,intersection($c2,$c1)).
% 0.19/0.50  62,61 [hyper,14,10] {-} intersection($c2,$c1)=empty_set.
% 0.19/0.50  63 [back_demod,55,demod,62] {-} member($c3,empty_set).
% 0.19/0.50  64 [binary,63.1,4.1] {-} $F.
% 0.19/0.50  
% 0.19/0.50  % SZS output end Refutation
% 0.19/0.50  ------------ end of proof -------------
% 0.19/0.50  
% 0.19/0.50  
% 0.19/0.50  Search stopped by max_proofs option.
% 0.19/0.50  
% 0.19/0.50  
% 0.19/0.50  Search stopped by max_proofs option.
% 0.19/0.50  
% 0.19/0.50  ============ end of search ============
% 0.19/0.50  
% 0.19/0.50  ----------- soft-scott stats ----------
% 0.19/0.50  
% 0.19/0.50  true clauses given           0      (0.0%)
% 0.19/0.50  false clauses given          4
% 0.19/0.50  
% 0.19/0.50        FALSE     TRUE
% 0.19/0.50     3  0         1
% 0.19/0.50     5  3         1
% 0.19/0.50     6  1         0
% 0.19/0.50     7  0         1
% 0.19/0.50     8  0         3
% 0.19/0.50    10  0         1
% 0.19/0.50    12  0         4
% 0.19/0.50    13  2         6
% 0.19/0.50    14  0         2
% 0.19/0.50    15  0         4
% 0.19/0.50    19  0         5
% 0.19/0.50    22  0         3
% 0.19/0.50    25  0         1
% 0.19/0.50    27  0         6
% 0.19/0.50  tot:  6         38      (86.4% true)
% 0.19/0.50  
% 0.19/0.50  
% 0.19/0.50  Model 5 [ 1 0 146 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.50  
% 0.19/0.50  That finishes the proof of the theorem.
% 0.19/0.50  
% 0.19/0.50  Process 22162 finished Sat Jul  9 17:09:51 2022
%------------------------------------------------------------------------------