TSTP Solution File: NUM009-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : NUM009-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n028.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 : Mon Jul 18 14:15:45 EDT 2022

% Result   : Unsatisfiable 6.24s 6.47s
% Output   : Refutation 6.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM009-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Thu Jul  7 12:16:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.38  ----- Otter 3.2, August 2001 -----
% 0.12/0.38  The process was started by sandbox on n028.cluster.edu,
% 0.12/0.38  Thu Jul  7 12:16:38 2022
% 0.12/0.38  The command was "./sos".  The process ID is 23630.
% 0.12/0.38  
% 0.12/0.38  set(prolog_style_variables).
% 0.12/0.38  set(auto).
% 0.12/0.38     dependent: set(auto1).
% 0.12/0.38     dependent: set(process_input).
% 0.12/0.38     dependent: clear(print_kept).
% 0.12/0.38     dependent: clear(print_new_demod).
% 0.12/0.38     dependent: clear(print_back_demod).
% 0.12/0.38     dependent: clear(print_back_sub).
% 0.12/0.38     dependent: set(control_memory).
% 0.12/0.38     dependent: assign(max_mem, 12000).
% 0.12/0.38     dependent: assign(pick_given_ratio, 4).
% 0.12/0.38     dependent: assign(stats_level, 1).
% 0.12/0.38     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.38     dependent: assign(sos_limit, 5000).
% 0.12/0.38     dependent: assign(max_weight, 60).
% 0.12/0.38  clear(print_given).
% 0.12/0.38  
% 0.12/0.38  list(usable).
% 0.12/0.38  
% 0.12/0.38  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.38  
% 0.12/0.38  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.38  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.38  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.38  clauses in usable.
% 0.12/0.38  
% 0.12/0.38     dependent: set(knuth_bendix).
% 0.12/0.38     dependent: set(para_from).
% 0.12/0.38     dependent: set(para_into).
% 0.12/0.38     dependent: clear(para_from_right).
% 0.12/0.38     dependent: clear(para_into_right).
% 0.12/0.38     dependent: set(para_from_vars).
% 0.12/0.38     dependent: set(eq_units_both_ways).
% 0.12/0.38     dependent: set(dynamic_demod_all).
% 0.12/0.38     dependent: set(dynamic_demod).
% 0.12/0.38     dependent: set(order_eq).
% 0.12/0.38     dependent: set(back_demod).
% 0.12/0.38     dependent: set(lrpo).
% 0.12/0.38     dependent: set(hyper_res).
% 0.12/0.38     dependent: set(unit_deletion).
% 0.12/0.38     dependent: set(factor).
% 0.12/0.38  
% 0.12/0.38  ------------> process usable:
% 0.12/0.38  
% 0.12/0.38  ------------> process sos:
% 0.12/0.38    Following clause subsumed by 322 during input processing: 0 [copy,322,flip.1] {-} A=A.
% 0.12/0.38  322 back subsumes 244.
% 0.12/0.38  322 back subsumes 205.
% 0.12/0.38  
% 0.12/0.38  ======= end of input processing =======
% 0.76/0.93  
% 0.76/0.93  Model 1 (0.00 seconds, 0 Inserts)
% 0.76/0.93  
% 0.76/0.93  Stopped by limit on number of solutions
% 0.76/0.93  
% 0.76/0.93  
% 0.76/0.93  -------------- Softie stats --------------
% 0.76/0.93  
% 0.76/0.93  UPDATE_STOP: 300
% 0.76/0.93  SFINDER_TIME_LIMIT: 2
% 0.76/0.93  SHORT_CLAUSE_CUTOFF: 4
% 0.76/0.93  number of clauses in intial UL: 158
% 0.76/0.93  number of clauses initially in problem: 282
% 0.76/0.93  percentage of clauses intially in UL: 56
% 0.76/0.93  percentage of distinct symbols occuring in initial UL: 89
% 0.76/0.93  percent of all initial clauses that are short: 100
% 0.76/0.93  absolute distinct symbol count: 111
% 0.76/0.93     distinct predicate count: 20
% 0.76/0.93     distinct function count: 79
% 0.76/0.93     distinct constant count: 12
% 0.76/0.93  
% 0.76/0.93  ---------- no more Softie stats ----------
% 0.76/0.93  
% 0.76/0.93  
% 0.76/0.93  
% 0.76/0.93  Model 2 (0.00 seconds, 0 Inserts)
% 0.76/0.93  
% 0.76/0.93  Stopped by limit on number of solutions
% 0.76/0.93  
% 0.76/0.94  =========== start of search ===========
% 6.24/6.47  
% 6.24/6.47  -------- PROOF -------- 
% 6.24/6.47  % SZS status Unsatisfiable
% 6.24/6.47  % SZS output start Refutation
% 6.24/6.47  
% 6.24/6.47  Model 3 (0.00 seconds, 0 Inserts)
% 6.24/6.47  
% 6.24/6.47  Stopped by limit on number of solutions
% 6.24/6.47  
% 6.24/6.47  Stopped by limit on insertions
% 6.24/6.47  
% 6.24/6.47  Stopped by limit on insertions
% 6.24/6.47  
% 6.24/6.47  Model 4 [ 1 2 11340 ] (0.00 seconds, 250000 Inserts)
% 6.24/6.47  
% 6.24/6.47  Stopped by limit on insertions
% 6.24/6.47  
% 6.24/6.47  Model 5 [ 4 30 230928 ] (0.00 seconds, 250000 Inserts)
% 6.24/6.47  
% 6.24/6.47  Stopped by limit on insertions
% 6.24/6.47  
% 6.24/6.47  Stopped by limit on insertions
% 6.24/6.47  
% 6.24/6.47  Stopped by limit on insertions
% 6.24/6.47  
% 6.24/6.47  Model 6 [ 6 34 234690 ] (0.00 seconds, 250000 Inserts)
% 6.24/6.47  
% 6.24/6.47  Stopped by limit on insertions
% 6.24/6.47  
% 6.24/6.47  ----> UNIT CONFLICT at   6.08 sec ----> 1576 [binary,1575.1,204.1] {+} $F.
% 6.24/6.47  
% 6.24/6.47  Length of proof is 3.  Level of proof is 3.
% 6.24/6.47  
% 6.24/6.47  ---------------- PROOF ----------------
% 6.24/6.47  % SZS status Unsatisfiable
% 6.24/6.47  % SZS output start Refutation
% 6.24/6.47  
% 6.24/6.47  1 [] {+} -member(A,B)|little_set(A).
% 6.24/6.47  153 [] {+} member(A,natural_numbers)| -little_set(A)|member(empty_set,f44(A)).
% 6.24/6.47  155 [] {+} member(A,natural_numbers)| -member(A,f44(A)).
% 6.24/6.47  204 [] {+} -member(empty_set,natural_numbers).
% 6.24/6.47  297 [] {-} member(empty_set,infinity).
% 6.24/6.47  1330 [hyper,297,1] {-} little_set(empty_set).
% 6.24/6.47  1361 [hyper,1330,153,unit_del,204] {-} member(empty_set,f44(empty_set)).
% 6.24/6.47  1575 [hyper,1361,155] {-} member(empty_set,natural_numbers).
% 6.24/6.47  1576 [binary,1575.1,204.1] {+} $F.
% 6.24/6.47  
% 6.24/6.47  % SZS output end Refutation
% 6.24/6.47  ------------ end of proof -------------
% 6.24/6.47  
% 6.24/6.47  
% 6.24/6.47  Search stopped by max_proofs option.
% 6.24/6.47  
% 6.24/6.47  
% 6.24/6.47  Search stopped by max_proofs option.
% 6.24/6.47  
% 6.24/6.47  ============ end of search ============
% 6.24/6.47  
% 6.24/6.47  ----------- soft-scott stats ----------
% 6.24/6.47  
% 6.24/6.47  true clauses given           0      (0.0%)
% 6.24/6.47  false clauses given         14
% 6.24/6.47  
% 6.24/6.47        FALSE     TRUE
% 6.24/6.47     3  0         4
% 6.24/6.47     4  7         5
% 6.24/6.47     5  12        1
% 6.24/6.47     6  7         7
% 6.24/6.47     7  7         18
% 6.24/6.47     8  24        32
% 6.24/6.47     9  13        14
% 6.24/6.47    10  6         29
% 6.24/6.47    11  10        25
% 6.24/6.47    12  20        51
% 6.24/6.47    13  16        24
% 6.24/6.47    14  12        17
% 6.24/6.47    15  11        24
% 6.24/6.47    16  9         26
% 6.24/6.47    17  23        32
% 6.24/6.47    18  8         16
% 6.24/6.47    19  9         33
% 6.24/6.47    20  17        27
% 6.24/6.47    21  19        38
% 6.24/6.47    22  27        70
% 6.24/6.47    23  9         17
% 6.24/6.47    24  3         18
% 6.24/6.47    25  2         14
% 6.24/6.47    26  11        12
% 6.24/6.47    27  20        14
% 6.24/6.47    28  15        25
% 6.24/6.47    29  19        38
% 6.24/6.47    30  32        13
% 6.24/6.47    31  3         29
% 6.24/6.47    32  0         16
% 6.24/6.47    33  20        8
% 6.24/6.47    34  5         6
% 6.24/6.47    35  0         18
% 6.24/6.47    36  22        15
% 6.24/6.47    37  1         0
% 6.24/6.47    38  0         22
% 6.24/6.47    39  6         6
% 6.24/6.47    40  3         14
% 6.24/6.47    41  0         2
% 6.24/6.47    42  0         2
% 6.24/6.47    43  2         1
% 6.24/6.47    44  2         5
% 6.24/6.47    45  0         10
% 6.24/6.47    46  3         3
% 6.24/6.47    47  0         3
% 6.24/6.47    48  0         3
% 6.24/6.47    49  1         0
% 6.24/6.47    52  0         4
% 6.24/6.47    53  0         2
% 6.24/6.47    54  1         0
% 6.24/6.47    55  0         6
% 6.24/6.47    56  0         1
% 6.24/6.47    59  0         4
% 6.24/6.47  tot:  437       824      (65.3% true)
% 6.24/6.47  
% 6.24/6.47  
% 6.24/6.47  Model 6 [ 6 -183 234690 ] (0.00 seconds, 250000 Inserts)
% 6.24/6.47  
% 6.24/6.47  That finishes the proof of the theorem.
% 6.24/6.47  
% 6.24/6.47  Process 23630 finished Thu Jul  7 12:16:44 2022
%------------------------------------------------------------------------------