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

View Problem - Process Solution

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

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

% Result   : Unsatisfiable 3.03s 3.23s
% Output   : Refutation 3.03s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL236-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.11/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n012.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul  4 05:37:46 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 n012.cluster.edu,
% 0.12/0.35  Mon Jul  4 05:37:46 2022
% 0.12/0.35  The command was "./sos".  The process ID is 7959.
% 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.39  
% 0.12/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  -------------- Softie stats --------------
% 0.12/0.39  
% 0.12/0.39  UPDATE_STOP: 300
% 0.12/0.39  SFINDER_TIME_LIMIT: 2
% 0.12/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39  number of clauses in intial UL: 4
% 0.12/0.39  number of clauses initially in problem: 9
% 0.12/0.39  percentage of clauses intially in UL: 44
% 0.12/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39  percent of all initial clauses that are short: 100
% 0.12/0.39  absolute distinct symbol count: 6
% 0.12/0.39     distinct predicate count: 2
% 0.12/0.39     distinct function count: 2
% 0.12/0.39     distinct constant count: 2
% 0.12/0.39  
% 0.12/0.39  ---------- no more Softie stats ----------
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  =========== start of search ===========
% 3.03/3.23  
% 3.03/3.23  -------- PROOF -------- 
% 3.03/3.23  % SZS status Unsatisfiable
% 3.03/3.23  % SZS output start Refutation
% 3.03/3.23  
% 3.03/3.23  Model 3 (0.00 seconds, 0 Inserts)
% 3.03/3.23  
% 3.03/3.23  Stopped by limit on number of solutions
% 3.03/3.23  
% 3.03/3.23  Model 4 (0.00 seconds, 0 Inserts)
% 3.03/3.23  
% 3.03/3.23  Stopped by limit on number of solutions
% 3.03/3.23  
% 3.03/3.23  Stopped by limit on insertions
% 3.03/3.23  
% 3.03/3.23  Model 5 [ 1 9 13644 ] (0.00 seconds, 250000 Inserts)
% 3.03/3.23  
% 3.03/3.23  Model 6 [ 2 3 29588 ] (0.00 seconds, 194569 Inserts)
% 3.03/3.23  
% 3.03/3.23  ----> UNIT CONFLICT at   2.84 sec ----> 37 [binary,36.1,4.1] {+} $F.
% 3.03/3.23  
% 3.03/3.23  Length of proof is 3.  Level of proof is 3.
% 3.03/3.23  
% 3.03/3.23  ---------------- PROOF ----------------
% 3.03/3.23  % SZS status Unsatisfiable
% 3.03/3.23  % SZS output start Refutation
% 3.03/3.23  
% 3.03/3.23  1 [] {+} theorem(A)| -axiom(A).
% 3.03/3.23  2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 3.03/3.23  3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 3.03/3.23  4 [] {+} -theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))).
% 3.03/3.23  5 [] {+} axiom(or(not(or(A,A)),A)).
% 3.03/3.23  6 [] {+} axiom(or(not(A),or(B,A))).
% 3.03/3.23  7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 3.03/3.23  10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 3.03/3.23  30 [hyper,10,3,6] {+} theorem(or(not(A),A)).
% 3.03/3.23  36 [hyper,30,2,7] {-} theorem(or(A,not(A))).
% 3.03/3.23  37 [binary,36.1,4.1] {+} $F.
% 3.03/3.23  
% 3.03/3.23  % SZS output end Refutation
% 3.03/3.23  ------------ end of proof -------------
% 3.03/3.23  
% 3.03/3.23  
% 3.03/3.23  Search stopped by max_proofs option.
% 3.03/3.23  
% 3.03/3.23  
% 3.03/3.23  Search stopped by max_proofs option.
% 3.03/3.23  
% 3.03/3.23  ============ end of search ============
% 3.03/3.23  
% 3.03/3.23  ----------- soft-scott stats ----------
% 3.03/3.23  
% 3.03/3.23  true clauses given           1      (11.1%)
% 3.03/3.23  false clauses given          8
% 3.03/3.23  
% 3.03/3.23        FALSE     TRUE
% 3.03/3.23     7  2         1
% 3.03/3.23     9  3         4
% 3.03/3.23    11  2         1
% 3.03/3.23    13  4         1
% 3.03/3.23    15  1         1
% 3.03/3.23  tot:  12        8      (40.0% true)
% 3.03/3.23  
% 3.03/3.23  
% 3.03/3.23  Model 6 [ 2 3 29588 ] (0.00 seconds, 194569 Inserts)
% 3.03/3.23  
% 3.03/3.23  That finishes the proof of the theorem.
% 3.03/3.23  
% 3.03/3.23  Process 7959 finished Mon Jul  4 05:37:49 2022
%------------------------------------------------------------------------------