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

View Problem - Process Solution

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

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

% Result   : Unsatisfiable 0.38s 0.62s
% Output   : Refutation 0.38s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : LCL211-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jul  3 17:50:15 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  ----- Otter 3.2, August 2001 -----
% 0.13/0.37  The process was started by sandbox on n020.cluster.edu,
% 0.13/0.37  Sun Jul  3 17:50:15 2022
% 0.13/0.37  The command was "./sos".  The process ID is 20314.
% 0.13/0.37  
% 0.13/0.37  set(prolog_style_variables).
% 0.13/0.37  set(auto).
% 0.13/0.37     dependent: set(auto1).
% 0.13/0.37     dependent: set(process_input).
% 0.13/0.37     dependent: clear(print_kept).
% 0.13/0.37     dependent: clear(print_new_demod).
% 0.13/0.37     dependent: clear(print_back_demod).
% 0.13/0.37     dependent: clear(print_back_sub).
% 0.13/0.37     dependent: set(control_memory).
% 0.13/0.37     dependent: assign(max_mem, 12000).
% 0.13/0.37     dependent: assign(pick_given_ratio, 4).
% 0.13/0.37     dependent: assign(stats_level, 1).
% 0.13/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37     dependent: assign(sos_limit, 5000).
% 0.13/0.37     dependent: assign(max_weight, 60).
% 0.13/0.37  clear(print_given).
% 0.13/0.37  
% 0.13/0.37  list(usable).
% 0.13/0.37  
% 0.13/0.37  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.37  
% 0.13/0.37  This is a Horn set without equality.  The strategy will
% 0.13/0.37  be hyperresolution, with satellites in sos and nuclei
% 0.13/0.37  in usable.
% 0.13/0.37  
% 0.13/0.37     dependent: set(hyper_res).
% 0.13/0.37     dependent: clear(order_hyper).
% 0.13/0.37  
% 0.13/0.37  ------------> process usable:
% 0.13/0.37  
% 0.13/0.37  ------------> process sos:
% 0.13/0.37  
% 0.13/0.37  ======= end of input processing =======
% 0.20/0.41  
% 0.20/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41  
% 0.20/0.41  Stopped by limit on number of solutions
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  -------------- Softie stats --------------
% 0.20/0.41  
% 0.20/0.41  UPDATE_STOP: 300
% 0.20/0.41  SFINDER_TIME_LIMIT: 2
% 0.20/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41  number of clauses in intial UL: 4
% 0.20/0.41  number of clauses initially in problem: 9
% 0.20/0.41  percentage of clauses intially in UL: 44
% 0.20/0.41  percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.41  percent of all initial clauses that are short: 100
% 0.20/0.41  absolute distinct symbol count: 6
% 0.20/0.41     distinct predicate count: 2
% 0.20/0.41     distinct function count: 2
% 0.20/0.41     distinct constant count: 2
% 0.20/0.41  
% 0.20/0.41  ---------- no more Softie stats ----------
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41  
% 0.20/0.41  Stopped by limit on number of solutions
% 0.20/0.41  
% 0.20/0.41  =========== start of search ===========
% 0.38/0.62  
% 0.38/0.62  -------- PROOF -------- 
% 0.38/0.62  % SZS status Unsatisfiable
% 0.38/0.62  % SZS output start Refutation
% 0.38/0.62  
% 0.38/0.62  Model 3 (0.00 seconds, 0 Inserts)
% 0.38/0.62  
% 0.38/0.62  Stopped by limit on number of solutions
% 0.38/0.62  
% 0.38/0.62  Model 4 (0.00 seconds, 0 Inserts)
% 0.38/0.62  
% 0.38/0.62  Stopped by limit on number of solutions
% 0.38/0.62  
% 0.38/0.62  ----> UNIT CONFLICT at   0.22 sec ----> 1142 [binary,1141.1,4.1] {+} $F.
% 0.38/0.62  
% 0.38/0.62  Length of proof is 5.  Level of proof is 5.
% 0.38/0.62  
% 0.38/0.62  ---------------- PROOF ----------------
% 0.38/0.62  % SZS status Unsatisfiable
% 0.38/0.62  % SZS output start Refutation
% 0.38/0.62  
% 0.38/0.62  1 [] {+} theorem(A)| -axiom(A).
% 0.38/0.62  2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 0.38/0.62  3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 0.38/0.62  4 [] {+} -theorem(or(not(not(q)),or(not(or(p,q)),p))).
% 0.38/0.62  5 [] {+} axiom(or(not(or(A,A)),A)).
% 0.38/0.62  6 [] {+} axiom(or(not(A),or(B,A))).
% 0.38/0.62  7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 0.38/0.62  9 [] {-} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 0.38/0.62  10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 0.38/0.62  49 [hyper,9,2,10] {-} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 0.38/0.62  92 [hyper,49,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 0.38/0.62  404 [hyper,92,3,7] {-} theorem(or(not(or(A,not(B))),or(not(or(A,B)),A))).
% 0.38/0.62  1141 [hyper,404,3,6] {-} theorem(or(not(not(A)),or(not(or(B,A)),B))).
% 0.38/0.62  1142 [binary,1141.1,4.1] {+} $F.
% 0.38/0.62  
% 0.38/0.62  % SZS output end Refutation
% 0.38/0.62  ------------ end of proof -------------
% 0.38/0.62  
% 0.38/0.62  
% 0.38/0.62  Search stopped by max_proofs option.
% 0.38/0.62  
% 0.38/0.62  
% 0.38/0.62  Search stopped by max_proofs option.
% 0.38/0.62  
% 0.38/0.62  ============ end of search ============
% 0.38/0.62  
% 0.38/0.62  ----------- soft-scott stats ----------
% 0.38/0.62  
% 0.38/0.62  true clauses given          63      (25.0%)
% 0.38/0.62  false clauses given        189
% 0.38/0.62  
% 0.38/0.62        FALSE     TRUE
% 0.38/0.62     9  0         25
% 0.38/0.62    11  0         77
% 0.38/0.62    12  0         1
% 0.38/0.62    13  126       40
% 0.38/0.62    14  0         4
% 0.38/0.62    15  179       23
% 0.38/0.62    16  6         3
% 0.38/0.62    17  122       11
% 0.38/0.62    18  10        1
% 0.38/0.62    19  67        3
% 0.38/0.62    20  8         2
% 0.38/0.62    21  50        2
% 0.38/0.62    22  8         0
% 0.38/0.62    23  23        0
% 0.38/0.62    24  2         0
% 0.38/0.62    25  8         0
% 0.38/0.62    26  4         0
% 0.38/0.62    27  2         0
% 0.38/0.62    28  2         0
% 0.38/0.62    29  2         0
% 0.38/0.62    31  3         0
% 0.38/0.62    33  2         0
% 0.38/0.62    37  1         0
% 0.38/0.62  tot:  625       192      (23.5% true)
% 0.38/0.62  
% 0.38/0.62  
% 0.38/0.62  Model 4 (0.00 seconds, 0 Inserts)
% 0.38/0.62  
% 0.38/0.62  That finishes the proof of the theorem.
% 0.38/0.62  
% 0.38/0.62  Process 20314 finished Sun Jul  3 17:50:15 2022
%------------------------------------------------------------------------------