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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SET583+3 : TPTP v8.1.0. Released v2.2.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:19:03 EDT 2022

% Result   : Theorem 0.18s 0.43s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12  % 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.33  % DateTime : Sat Jul  9 16:34:22 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 n005.cluster.edu,
% 0.12/0.35  Sat Jul  9 16:34:22 2022
% 0.12/0.35  The command was "./sos".  The process ID is 23785.
% 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 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.35  12 back subsumes 7.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.38  
% 0.12/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38  
% 0.12/0.38  Stopped by limit on number of solutions
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  -------------- Softie stats --------------
% 0.12/0.38  
% 0.12/0.38  UPDATE_STOP: 300
% 0.12/0.38  SFINDER_TIME_LIMIT: 2
% 0.12/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38  number of clauses in intial UL: 6
% 0.12/0.38  number of clauses initially in problem: 11
% 0.12/0.38  percentage of clauses intially in UL: 54
% 0.12/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38  percent of all initial clauses that are short: 100
% 0.12/0.38  absolute distinct symbol count: 6
% 0.12/0.38     distinct predicate count: 3
% 0.12/0.38     distinct function count: 1
% 0.12/0.38     distinct constant count: 2
% 0.12/0.38  
% 0.12/0.38  ---------- no more Softie stats ----------
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38  
% 0.12/0.38  Stopped by limit on number of solutions
% 0.12/0.38  
% 0.12/0.38  =========== start of search ===========
% 0.18/0.43  
% 0.18/0.43  -------- PROOF -------- 
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  % SZS output start Refutation
% 0.18/0.43  
% 0.18/0.43  Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.43  
% 0.18/0.43  Stopped by limit on number of solutions
% 0.18/0.43  
% 0.18/0.43  Model 4 [ 1 4 92235 ] (0.00 seconds, 96762 Inserts)
% 0.18/0.43  
% 0.18/0.43  ----> UNIT CONFLICT at   0.05 sec ----> 20 [binary,18.1,6.1] {+} $F.
% 0.18/0.43  
% 0.18/0.43  Length of proof is 1.  Level of proof is 1.
% 0.18/0.43  
% 0.18/0.43  ---------------- PROOF ----------------
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  % SZS output start Refutation
% 0.18/0.43  
% 0.18/0.43  3 [] {+} A=B| -subset(A,B)| -subset(B,A).
% 0.18/0.43  6 [] {+} $c2!=$c1.
% 0.18/0.43  10 [] {+} subset($c2,$c1).
% 0.18/0.43  11 [] {+} subset($c1,$c2).
% 0.18/0.43  18 [hyper,10,3,11,flip.1] {-} $c2=$c1.
% 0.18/0.43  20 [binary,18.1,6.1] {+} $F.
% 0.18/0.43  
% 0.18/0.43  % SZS output end Refutation
% 0.18/0.43  ------------ end of proof -------------
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Search stopped by max_proofs option.
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Search stopped by max_proofs option.
% 0.18/0.43  
% 0.18/0.43  ============ end of search ============
% 0.18/0.43  
% 0.18/0.43  ----------- soft-scott stats ----------
% 0.18/0.43  
% 0.18/0.43  true clauses given           0      (0.0%)
% 0.18/0.43  false clauses given          3
% 0.18/0.43  
% 0.18/0.43        FALSE     TRUE
% 0.18/0.43     3  0         2
% 0.18/0.43     5  1         0
% 0.18/0.43     9  2         0
% 0.18/0.43    13  0         1
% 0.18/0.43    16  0         1
% 0.18/0.43  tot:  3         4      (57.1% true)
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Model 4 [ 1 4 92235 ] (0.00 seconds, 96762 Inserts)
% 0.18/0.43  
% 0.18/0.43  That finishes the proof of the theorem.
% 0.18/0.43  
% 0.18/0.43  Process 23785 finished Sat Jul  9 16:34:22 2022
%------------------------------------------------------------------------------