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

View Problem - Process Solution

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

% Computer : n023.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:43 EDT 2022

% Result   : Theorem 0.12s 0.41s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : -

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