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

View Problem - Process Solution

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

% Computer : n018.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:16:59 EDT 2022

% Result   : Unsatisfiable 10.41s 10.61s
% Output   : Refutation 10.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SET235-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n018.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 : Mon Jul 11 03:06:13 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 sandbox2 on n018.cluster.edu,
% 0.12/0.35  Mon Jul 11 03:06:13 2022
% 0.12/0.35  The command was "./sos".  The process ID is 2695.
% 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  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 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 165 during input processing: 0 [copy,165,flip.1] {-} A=A.
% 0.12/0.35  165 back subsumes 75.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.94/1.13  
% 0.94/1.13  Model 1 (0.00 seconds, 0 Inserts)
% 0.94/1.13  
% 0.94/1.13  Stopped by limit on number of solutions
% 0.94/1.13  
% 0.94/1.13  
% 0.94/1.13  -------------- Softie stats --------------
% 0.94/1.13  
% 0.94/1.13  UPDATE_STOP: 300
% 0.94/1.13  SFINDER_TIME_LIMIT: 2
% 0.94/1.13  SHORT_CLAUSE_CUTOFF: 4
% 0.94/1.13  number of clauses in intial UL: 61
% 0.94/1.13  number of clauses initially in problem: 146
% 0.94/1.13  percentage of clauses intially in UL: 41
% 0.94/1.13  percentage of distinct symbols occuring in initial UL: 64
% 0.94/1.13  percent of all initial clauses that are short: 100
% 0.94/1.13  absolute distinct symbol count: 59
% 0.94/1.13     distinct predicate count: 11
% 0.94/1.13     distinct function count: 34
% 0.94/1.13     distinct constant count: 14
% 0.94/1.13  
% 0.94/1.13  ---------- no more Softie stats ----------
% 0.94/1.13  
% 0.94/1.13  
% 0.94/1.13  
% 0.94/1.13  Stopped by limit on insertions
% 0.94/1.13  
% 0.94/1.13  =========== start of search ===========
% 10.41/10.61  
% 10.41/10.61  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Model 2 [ 2 1 11487 ] (0.00 seconds, 250000 Inserts)
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Model 3 [ 18 1 4690 ] (0.00 seconds, 250000 Inserts)
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Model 4 [ 43 1 4652 ] (0.00 seconds, 250000 Inserts)
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Model 5 [ 42 10 107162 ] (0.00 seconds, 250000 Inserts)
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Model 6 [ 60 2 11812 ] (0.00 seconds, 250000 Inserts)
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Model 7 [ 49 3 25425 ] (0.00 seconds, 250000 Inserts)
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Model 8 [ 45 2 8118 ] (0.00 seconds, 250000 Inserts)
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Model 9 [ 54 2 6653 ] (0.00 seconds, 250000 Inserts)
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  Stopped by limit on insertions
% 10.41/10.61  
% 10.41/10.61  ----> UNIT CONFLICT at  10.22 sec ----> 9796 [binary,9795.1,186.1] {-} $F.
% 10.41/10.61  
% 10.41/10.61  Length of proof is 4.  Level of proof is 4.
% 10.41/10.61  
% 10.41/10.61  ---------------- PROOF ----------------
% 10.41/10.61  % SZS status Unsatisfiable
% 10.41/10.61  % SZS output start Refutation
% 10.41/10.61  
% 10.41/10.61  1 [] {+} -subclass(A,B)| -member(C,A)|member(C,B).
% 10.41/10.61  12 [] {+} -member(A,cross_product(B,C))|ordered_pair(first(A),second(A))=A.
% 10.41/10.61  73 [] {+} -member(ordered_pair(first(not_subclass_element(x,y)),second(not_subclass_element(x,y))),x).
% 10.41/10.61  74 [] {+} -subclass(x,y).
% 10.41/10.61  83 [] {-} member(not_subclass_element(A,B),A)|subclass(A,B).
% 10.41/10.61  164 [] {+} subclass(x,cross_product(universal_class,universal_class)).
% 10.41/10.61  186 [hyper,83,74] {-} member(not_subclass_element(x,y),x).
% 10.41/10.61  1295 [hyper,164,1,186] {-} member(not_subclass_element(x,y),cross_product(universal_class,universal_class)).
% 10.41/10.61  9651,9650 [hyper,1295,12] {-} ordered_pair(first(not_subclass_element(x,y)),second(not_subclass_element(x,y)))=not_subclass_element(x,y).
% 10.41/10.61  9795 [back_demod,73,demod,9651] {-} -member(not_subclass_element(x,y),x).
% 10.41/10.61  9796 [binary,9795.1,186.1] {-} $F.
% 10.41/10.61  
% 10.41/10.61  % SZS output end Refutation
% 10.41/10.61  ------------ end of proof -------------
% 10.41/10.61  
% 10.41/10.61  
% 10.41/10.61  Search stopped by max_proofs option.
% 10.41/10.61  
% 10.41/10.61  
% 10.41/10.61  Search stopped by max_proofs option.
% 10.41/10.61  
% 10.41/10.61  ============ end of search ============
% 10.41/10.61  
% 10.41/10.61  ----------- soft-scott stats ----------
% 10.41/10.61  
% 10.41/10.61  true clauses given          14      (11.9%)
% 10.41/10.61  false clauses given        104
% 10.41/10.61  
% 10.41/10.61        FALSE     TRUE
% 10.41/10.61     7  14        23
% 10.41/10.61     8  47        21
% 10.41/10.61     9  329       77
% 10.41/10.61    10  158       106
% 10.41/10.61    11  981       217
% 10.41/10.61    12  238       220
% 10.41/10.61    13  853       281
% 10.41/10.61    14  10        113
% 10.41/10.61    15  189       396
% 10.41/10.61    16  0         47
% 10.41/10.61    17  5         154
% 10.41/10.61    18  0         36
% 10.41/10.61    19  0         105
% 10.41/10.61    20  1         35
% 10.41/10.61    21  0         20
% 10.41/10.61    22  0         17
% 10.41/10.61    23  0         42
% 10.41/10.61    24  0         18
% 10.41/10.61    25  0         6
% 10.41/10.61    26  0         10
% 10.41/10.61    27  0         39
% 10.41/10.61    28  0         14
% 10.41/10.61    29  0         32
% 10.41/10.61    30  0         19
% 10.41/10.61    31  0         20
% 10.41/10.61    32  0         27
% 10.41/10.61    33  0         14
% 10.41/10.61    34  0         19
% 10.41/10.61    35  0         6
% 10.41/10.61    36  0         11
% 10.41/10.61    37  0         1
% 10.41/10.61    38  0         1
% 10.41/10.61    39  0         2
% 10.41/10.61    41  0         1
% 10.41/10.61    42  0         2
% 10.41/10.61    46  0         4
% 10.41/10.61    48  0         6
% 10.41/10.61    50  0         6
% 10.41/10.61    52  0         2
% 10.41/10.61    55  0         1
% 10.41/10.61    57  0         3
% 10.41/10.61    59  0         3
% 10.41/10.61    60  0         2
% 10.41/10.61  tot:  2825      2179      (43.5% true)
% 10.41/10.61  
% 10.41/10.61  
% 10.41/10.61  Model 9 [ 54 -96 6653 ] (0.00 seconds, 250000 Inserts)
% 10.41/10.61  
% 10.41/10.61  That finishes the proof of the theorem.
% 10.41/10.61  
% 10.41/10.61  Process 2695 finished Mon Jul 11 03:06:23 2022
%------------------------------------------------------------------------------