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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL217-1 : TPTP v8.1.0. Released v1.1.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 : Sun Jul 17 14:28:46 EDT 2022

% Result   : Unsatisfiable 5.74s 5.91s
% Output   : Refutation 5.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL217-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n006.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 : Sun Jul  3 18:23:52 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox on n006.cluster.edu,
% 0.12/0.35  Sun Jul  3 18:23:52 2022
% 0.12/0.35  The command was "./sos".  The process ID is 32037.
% 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=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35  
% 0.12/0.35  This is a Horn set without equality.  The strategy will
% 0.12/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35  in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: clear(order_hyper).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.40  
% 0.12/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40  
% 0.12/0.40  Stopped by limit on number of solutions
% 0.12/0.40  
% 0.12/0.40  
% 0.12/0.40  -------------- Softie stats --------------
% 0.12/0.40  
% 0.12/0.40  UPDATE_STOP: 300
% 0.12/0.40  SFINDER_TIME_LIMIT: 2
% 0.12/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40  number of clauses in intial UL: 4
% 0.12/0.40  number of clauses initially in problem: 9
% 0.12/0.40  percentage of clauses intially in UL: 44
% 0.12/0.40  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.40  percent of all initial clauses that are short: 100
% 0.12/0.40  absolute distinct symbol count: 6
% 0.12/0.40     distinct predicate count: 2
% 0.12/0.40     distinct function count: 2
% 0.12/0.40     distinct constant count: 2
% 0.12/0.40  
% 0.12/0.40  ---------- no more Softie stats ----------
% 0.12/0.40  
% 0.12/0.40  
% 0.12/0.40  
% 0.12/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40  
% 0.12/0.40  Stopped by limit on number of solutions
% 0.12/0.40  
% 0.12/0.40  =========== start of search ===========
% 5.74/5.91  
% 5.74/5.91  -------- PROOF -------- 
% 5.74/5.91  % SZS status Unsatisfiable
% 5.74/5.91  % SZS output start Refutation
% 5.74/5.91  
% 5.74/5.91  Model 3 (0.00 seconds, 0 Inserts)
% 5.74/5.91  
% 5.74/5.91  Stopped by limit on number of solutions
% 5.74/5.91  
% 5.74/5.91  Stopped by limit on insertions
% 5.74/5.91  
% 5.74/5.91  Model 4 [ 1 1 196 ] (0.00 seconds, 250000 Inserts)
% 5.74/5.91  
% 5.74/5.91  Stopped by limit on insertions
% 5.74/5.91  
% 5.74/5.91  Model 5 [ 1 2 6859 ] (0.00 seconds, 250000 Inserts)
% 5.74/5.91  
% 5.74/5.91  Stopped by limit on insertions
% 5.74/5.91  
% 5.74/5.91  Model 6 [ 1 2 13254 ] (0.00 seconds, 250000 Inserts)
% 5.74/5.91  
% 5.74/5.91  Stopped by limit on insertions
% 5.74/5.91  
% 5.74/5.91  Stopped by limit on insertions
% 5.74/5.91  
% 5.74/5.91  Model 7 [ 2 1 737 ] (0.00 seconds, 250000 Inserts)
% 5.74/5.91  
% 5.74/5.91  Stopped by limit on insertions
% 5.74/5.91  
% 5.74/5.91  Model 8 [ 2 4 20070 ] (0.00 seconds, 250000 Inserts)
% 5.74/5.91  
% 5.74/5.91  ----> UNIT CONFLICT at   5.53 sec ----> 1333 [binary,1332.1,4.1] {-} $F.
% 5.74/5.91  
% 5.74/5.91  Length of proof is 5.  Level of proof is 5.
% 5.74/5.91  
% 5.74/5.91  ---------------- PROOF ----------------
% 5.74/5.91  % SZS status Unsatisfiable
% 5.74/5.91  % SZS output start Refutation
% 5.74/5.91  
% 5.74/5.91  1 [] {+} theorem(A)| -axiom(A).
% 5.74/5.91  2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 5.74/5.91  3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 5.74/5.91  4 [] {+} -theorem(or(not(or(not(p),q)),or(not(or(not(p),not(q))),not(p)))).
% 5.74/5.91  5 [] {+} axiom(or(not(or(A,A)),A)).
% 5.74/5.91  7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 5.74/5.91  8 [] {+} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 5.74/5.91  9 [] {+} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 5.74/5.91  10 [hyper,5,1] {-} theorem(or(not(or(A,A)),A)).
% 5.74/5.91  55 [hyper,9,2,10] {-} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 5.74/5.91  115 [hyper,55,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 5.74/5.91  653 [hyper,115,3,7] {-} theorem(or(not(or(A,not(B))),or(not(or(A,B)),A))).
% 5.74/5.91  1332 [hyper,653,2,8] {-} theorem(or(not(or(A,B)),or(not(or(A,not(B))),A))).
% 5.74/5.91  1333 [binary,1332.1,4.1] {-} $F.
% 5.74/5.91  
% 5.74/5.91  % SZS output end Refutation
% 5.74/5.91  ------------ end of proof -------------
% 5.74/5.91  
% 5.74/5.91  
% 5.74/5.91  Search stopped by max_proofs option.
% 5.74/5.91  
% 5.74/5.91  
% 5.74/5.91  Search stopped by max_proofs option.
% 5.74/5.91  
% 5.74/5.91  ============ end of search ============
% 5.74/5.91  
% 5.74/5.91  ----------- soft-scott stats ----------
% 5.74/5.91  
% 5.74/5.91  true clauses given          83      (31.9%)
% 5.74/5.91  false clauses given        177
% 5.74/5.91  
% 5.74/5.91        FALSE     TRUE
% 5.74/5.91     9  0         15
% 5.74/5.91    11  0         114
% 5.74/5.91    13  72        117
% 5.74/5.91    14  7         2
% 5.74/5.91    15  172       40
% 5.74/5.91    16  10        6
% 5.74/5.91    17  114       38
% 5.74/5.91    18  21        3
% 5.74/5.91    19  57        30
% 5.74/5.91    20  18        3
% 5.74/5.91    21  38        17
% 5.74/5.91    22  9         2
% 5.74/5.91    23  21        4
% 5.74/5.91    24  0         5
% 5.74/5.91    25  10        0
% 5.74/5.91    26  5         2
% 5.74/5.91    27  4         1
% 5.74/5.91    28  6         0
% 5.74/5.91    29  1         5
% 5.74/5.91    30  1         0
% 5.74/5.91    31  3         2
% 5.74/5.91    32  1         0
% 5.74/5.91    33  4         1
% 5.74/5.91    34  1         0
% 5.74/5.91    35  1         1
% 5.74/5.91    36  1         1
% 5.74/5.91    37  2         2
% 5.74/5.91    46  1         0
% 5.74/5.91    47  0         1
% 5.74/5.91    57  1         0
% 5.74/5.91  tot:  581       412      (41.5% true)
% 5.74/5.91  
% 5.74/5.91  
% 5.74/5.91  Model 8 [ 2 4 20070 ] (0.00 seconds, 250000 Inserts)
% 5.74/5.91  
% 5.74/5.91  That finishes the proof of the theorem.
% 5.74/5.91  
% 5.74/5.91  Process 32037 finished Sun Jul  3 18:23:58 2022
%------------------------------------------------------------------------------